text:
Talk:Low-density parity-check code

For a person who has not studied information theory, the introduction chapter says absolutely nothing. It's some state of the art code, rrright. For what/Where/Why is it used? I think the introduction should answer these questions first. Then it's okay to jump into the technics. Besides, what's Forney's factor graph notation anyway? Maybe an article about it should be created, or at least Forney linked somewhere. (Elsewhere than to Forney, Texas). --ZeroOne 19:52, 12 Oct 2004 (UTC)

LDPC advantage
I'd agree with the first comment. I am not an information theory specialist and have been trying to get an idea what advantage LDPC gives over eg Reed Solomon, but cannot find this basic information anywhere. Andrew P, UK.

Not impressed with the article either. But in answer to your question: LDPC codes approach the theoretical (Shannon) limit as the block size increases. (I.E. They are the best (in terms of error recovery) that an error correcting code can be.) A Google of LDPC turns up a lot of good articles. Nahaj 15:25, 8 November 2005 (UTC)

Generating the parity-check matrix
Although Gallager's original codes used a randomly generated parity-check matrix, this doesn't have to be the case. A subset of Gallager codes can be built analytically by an algebraic method based on shortened Reed-Solomon codes with two information symbols. LDPC codes can also be constructed algebraically based on the points and lines of finite geometries. The highest performance LDPC codes are constructed using a method known as density evolution.

Density evolution is a measure of the code, not a method of code construction. To quote Moon's "Error Correction Coding": "Density evolution is an analytical technique which can be used to understand limits of performance of LDPC decoders. "  Although, obviously, ANYTHING that measures a code can be used to AID in generating good codes. (And there have been many articles on building various subsets of Gallager codes by many many different methods.) If the author of the anonymous comment above would like to provide a *current* reference for their interesting claim that "The highest performance LDPC codes are constructed using a method known as density evolution.", I'd appreciate it. Work on finding GOOD non-randomly generated LDPC codes is still ongoing in a number of places... I'd recommed the "IEEE Trans. Information Theory", and the "IEEE Trans. Communications" as jumping in points. Nahaj 17:18, 16 January 2006 (UTC)

The reference I had in mind when making the statement about "The highest performance LDPC codes..." was S.-Y. Chung, G. D. Forney, T. J. Richardson, R. L. Urbanke, "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit," IEEE Communications Letters, vol. 5, no. 2, Feb. 2001. The authors develop an improved implementation of density evolution called discretized density evolution. Using this algorithm and an improved optimization algorithm they design good rate-1/2 irregular LDPC codes for binary-input AWGN channels that approach the Shannon limit very closely, i.e., to within 0.0045 dB. I'm not sure whether this is regarded as a current reference or not. Duncan Aitken, UK.

The claim was made that "The highest performance LDPC codes" are constructed by the method. I'm still waiting for a reference supporting that extreme claim. When it comes to "highest", or best, or any other such term for an algorithm, the status can change rapidly... and only a current article can tell which is currently best. An article from several years ago [ which is very good, by the way ] showing that a method was good doesn't address the issue whether it is the method that currently produces the highest performance codes. Nahaj 15:32, 18 February 2006 (UTC)

There are two separate issues here: the origin of good parity-check matrices, and the current "best" performance. Edratzer 17:17, 17 September 2006 (UTC)
 * I agree with Nahaj that there is more than one way of creating a good parity-check matrix; some documentation of good methods needs to be documented. The LDPC world splits slightly into two camps, psuedo-random generation and non-random approaches.  I mainly have experience of the former and am happy to write about the approaches used in this community (ie determination of good degree sequences via denisty evolution or an approximation, and then construction of codes with this degree sequence).  Do we have a good author to write about deterministic methods?
 * As far as I'm aware the best performance is still from SY Chung's paper. I'm not sure what standard of proof is required for Wikipedia as the lack of specific counter evidence can not be proved without citing every LDPC paper since!

Applications of LDPC
Other than the mention that LDPC is adopted for satellite broadcasting it would be useful if someone added more text on other applications of LDPC. In particular, any thoughts on comparsions with turbo codes in "real world" cases (mobile, etc.).--Alistair9210 08:42, 4 July 2006 (UTC)

Is not LDPC used in 802.11n? 192.114.175.2 (talk) 11:57, 5 December 2007 (UTC)

Yes its specifiyed in the HT of 802.11n wich codelength between 648 and 1944 bits. —Preceding unsigned comment added by 131.188.138.93 (talk) 13:19, 13 August 2010 (UTC)

Operational use
I think some of the details need to be better written here. The variable 'k' is not even defined. Also, the sentence "or there must be an even number of odd values" is confusing. Instead of writing that, should write something straight-forward, such as - the "Exclusive OR" of all the bits linked by the lines will be logical 0. Also, as if by 'magic', the matrices "P" and "I" just pop out of nowhere, and nobody has any idea what they are. KorgBoy (talk) 08:10, 25 May 2017 (UTC)

I think H should be reduced to -P^T | I_{k} and not (n-k). Because the number of rows of H is actually k. It works for this example since n-k = k here, but for general n and k, it will not work. — Preceding unsigned comment added by Swaprava (talk • contribs) 17:53, 5 January 2020 (UTC)

Similarly, G will be starting with I_{n-k} and not k. LDPC codes encode n-k bits into n bits, right? — Preceding unsigned comment added by Swaprava (talk • contribs) 17:56, 5 January 2020 (UTC)

Forgotten?
Were LDPC codes "forgotten"? Gallager was a famous name in the information theory community in the 1970s and 1980s, so I doubt they were truly forgotten; they just couldn't be practically used. Calbaer 01:03, 21 July 2006 (UTC)

In the paper that effectively reintroducted LDPC codes (MacKay and Neal "Near Shannon Limit Performance of Low Density Parity Check Codes") there is a brief mention of this topic. The suggestion is that a slightly related family of codes (concatenated codes) were believed to be better and hence LDPC codes were ignored. This paper cites personal communication from Gallager on this topic. Edratzer 17:25, 17 September 2006 (UTC)

LDPC codes were actually rediscovered one year before MacKay and Neal, by Wiberg, Loeliger, and Kötter in "Codes and Iterated Decoding on General Graphs", published in 1995. This was triggered by the publication of Turbo codes in 1993, which sparked the new interest in iterative decoding algorithms. This page should be updated with a reference to that paper. Nicwi (talk) 21:21, 6 March 2016 (UTC)

Links
I have just reverted the addition of a link added by an anonymous user to a University repository of various LDPC papers. The repository does not appear to be a general source of reference or contain VHDL code that may aid the new reader. I propose adding a link to instead as this page  contains open-source hardware source code. Any comments? Can the anonymous link adder come forward? Edratzer 08:07, 8 January 2007 (UTC)

Expert attention needed
Apparently, some diagrams were deleted due to no source because the diagram creator did not use a *-self template, making this article incomplete because the text depends on them. Could someone who knows about LDPC codes redraw the missing diagrams? Jesse Viviano 07:24, 26 September 2007 (UTC)

Can someone let me know what diagrams need redrawing? There is a pretty good chance that I can redraw them. User dfhayes 24/04/2008 —Preceding unsigned comment added by Dfhayes (talk • contribs) 11:03, 24 April 2008 (UTC)
 * The page used to have a series of steps of belief propagation on a channel with erasures. It would be good to reinstate these.  If you have a good way of showing belief propagation on a channel with soft messages that would be good too. Edratzer (talk) 19:08, 24 April 2008 (UTC)

I think we should the decoding part should be divided into two parts: one for the erasure channel and another for the decoding of soft messages. I'm quite new in wikipedia, but I'm working on LDPC codes and I think I can help to improve this part. —Preceding unsigned comment added by Cunchem (talk • contribs) 12:30, 2 September 2008 (UTC)

Gallager Codes
I think that the title of this page should also be Gallager Codes so that it will come up easily in an internet search. I don't know how to do this or I would do it myself —Preceding unsigned comment added by Lansey (talk • contribs) 09:12, 4 June 2008 (UTC) Thanks, this wiki pages now comes up first for a search of Gallager Codes, thanks --Lansey (talk) 10:07, 6 July 2008 (UTC)
 * I have created a redirect from Gallager codes. Edratzer (talk) 14:59, 7 June 2008 (UTC)

Function
Hi all. As far as i know, check matrix $$H$$ can not be represented as $$\begin{bmatrix} P | I_k \end{bmatrix}$$ just by changing the row-column order. Because almost every column contains j 1's, there is not enought columns with single 1. Example is not good enought. Vlsergey (talk) 20:47, 28 August 2008 (UTC)
 * The row operations include addition of rows to each other - we're not just talking about row/column permutations. I've linked to the page on row operations but if you would like to make the article clearer then feel free.  I guess more mention could be made of matrix rank too.  Edratzer (talk) 22:07, 23 September 2008 (UTC)

In this case $$P$$ is also called a generator matrix of the code. --Cunchem 08:46, 3 April 2009 (UTC) —Preceding unsigned comment added by Cunchem (talk • contribs)

POV
Citation 5 on carrier recovery doesn't seem to be significant in the LDPC coding arena (Google Scholar gives 7 citations of which 2 are self-citations). I note that the Userid that added the section is very similar to the name of one of the article authors. Edratzer (talk) 21:51, 23 January 2009 (UTC)

 * Sorry, I should have looked here first, since I just reverted and asked you to explain. The better thing to do, instead of the cryptic POV tag on something  that doesn't like like a POV issue, is to just fix it, especially if it was added with an apparent WP:COI, and leave the editor a note to explain that he think his own stuff should be cited then he should make his case on this talk page instead of citing it himself.  WP:SOFIXIT. Dicklyon (talk) 00:39, 24 January 2009 (UTC)

Section Function
This section adds no information on LDPC encoding or other properties. Information on Generator and Parity Check matrices and deriving the code using these belongs to an article on general FEC coding. And I am pretty sure that in practice you don't do a large size, sparse(!) matrix multiplication, but rather sum up the check nodes along the edges in the graph. Please remove this unhelpful stuff. The section may rather tell something about the structure of LDPC codes, as bipartite graphs, regular or irregular etc. Give links to derived codes, such as Tornado codes for the BEC etc.

Section Decoding
Similar to above, this section should write something about decoding algorithms, such as message passing etc. This section states that decoding an LDPC code is NP-complete. Well, this is certainly not true for a binary erasure channel, and ironically the example given discusses just that channel.

Does the subsection on lookup-table decoding need a citation? Or does anyone know of some elaboration on the method described? I'm not sure how a 1024-bit table would help decode an LDPC with a 1024-bit block size. (I may be misreading that section; it could probably be cleaned up anyway; e.g. "very high iterations" could be "many iterations" or some more fluent wording.) — Preceding unsigned comment added by 173.73.92.75 (talk) 03:30, 15 February 2014 (UTC)

The section on lookup-table absolutely needs a citation. How can any machine store a lookup table for arbitrary 1024 bit strings, much less a microcontroller? -EdwinOlson — Preceding unsigned comment added by 64.94.31.206 (talk) 23:13, 24 June 2014 (UTC)

Other things
Sentence two in the introduction: isn't that kinda obvious? Sentence three: data transmission rate? please be precise: code rate. Turbo codes can also be classified as LDPC codes. How are they differentiated? The article states three different years for the invention of Gallager codes: 1960, 1962, and 1963. The article should further cite different variants of LDPC codes in practice.

Sorry if points are rather rough, it's late, I'm tired, and I am not an expert on coding. Anyway, thanks for giving a check. G'night ;) Nageh (talk) 22:39, 22 May 2009 (UTC)

Capacity achieving?
The third sentence of the introduction ("LDPC was the first code to allow data transmission rates close to the theoretical maximum") does not really bring any valuable information. It all depends too much on what is meant by "close to the theoretical maximum". Either one should give a precise value like "within XX dB from theoretical maximum" with a corresponding reference, or one should lose the sentence altogether. Kaioshin82 (talk) 13:19, 30 July 2009 (UTC)

 * I've tried to clarify the start of the article. I'm guessing the original author is referring to whether or not LDPC codes can achieve capacity.  Edratzer (talk) 08:08, 5 August 2009 (UTC)

 * Thanks! That's a much better introduction. Pfagerburg (talk) 01:28, 7 August 2009 (UTC)

comparison to multidimensional parity check code
I have put a sentence in the introduction saying: "LDPC codes operate on the same principle as Multidimensional parity-check codes except that LDPC codes form the Parity bits from groups of randomly selected data bits" MDPC codes being much simpler make it easier for the beginner to grasp the central idea being used in LDPC codes. At least one person has disputed the connection between MDPC and LDPC codes. I cannot imagine how anyone could fail to see the connection. I am starting this new section in order that we may arrive at a consensus on this issue. just-emery (talk) 23:43, 6 June 2009 (UTC)

 * I'm no expert on LDPC, but I'm not sure I see the direct connection either, other than their names! LDPCs are designed around the concept of random parity matrices, whereas MDPCs are completely structured.  My understanding is that the performance of LDPCs is determined in terms of the expectation over all random sparse parity matrices, whereas the weight spectrum of an MDPC is obviously deterministic. Oli Filth(talk 02:12, 7 June 2009 (UTC)

 * Oh, now you are just being ridiculous. Obviously there are differences. When I say that they operate on the same basic 'principle' I am speaking to beginners who are unfamiliar with error correction who might find MDPC codes to be more intuitive. LDPC codes perform much better because  there aren't as many 'cycles' in their graphs. MDPC codes are nothing but 'cycles'. I think it would be useful to point out (in the article) how they differ and why LDPC codes are better.
 * And no, I am not an expert either But I can plainly see how they are similar. If you disagree then what 'basic principle' do you say they are based on? just-emery (talk) 03:10, 7 June 2009 (UTC)

 * My point is, how is LDPC related to MDPC any more than it is to any other block code? Oli Filth(talk 12:04, 7 June 2009 (UTC)

 * What else would you compare it to? just-emery (talk) 17:01, 7 June 2009 (UTC)

 * Why do they need a specific comparison point? Singling out MDPC implies that they're related in some way (i.e. more so than any other block code).  Oli Filth(talk 17:11, 7 June 2009 (UTC)

 * If you dont think they are most closely related to MDPC codes then what do you think they are most closely related to? please stop ignoring me and answer my question. just-emery (talk) 17:40, 7 June 2009 (UTC)

 * I'm not sure why you think there has to be an answer to that question! LDPC is what it is; a block code that achieves close to the Shannon bound, which has a class of sub-optimal iterative decoders, and whose performance is defined statistically over all random parity matrices.  On these points alone, it sounds most like a turbo code.  But even that would be misleading, as the construction is entirely different.  Oli Filth(talk 17:57, 7 June 2009 (UTC)

 * According to what you just said the difference between LDPC and MDPC codes is that LDPC produces its parity bits from groups of randomly selected data bits and it therefore achieves close to the shannon limit. how does that differ from what I said originally? just-emery (talk) 18:53, 7 June 2009 (UTC)

 * I've already stated what the problem is with "LDPC operates on the same principle as MDPC"; it indicates a relationship where there is none. You may as well have substituted BCH, RS, Golay, Hamming, turbo or RM in there and the sentence would have been as meaningful!  Oli Filth(talk 19:00, 7 June 2009 (UTC)

If my statement had simply been that they operate on the same principle and nothing else then you might, arguably, have had a point but my statement as it now reads is: "LDPC codes operate on the same general principle as Multidimensional parity-check codes. The main difference between them being that LDPC codes form the Parity bits from groups of randomly selected data bits and are therefore able to achieve much closer to the Shannon limit due to the greatly reduced number of cycles within their graphs." It is the difference that is being pointed out as being meaningful. Furthermore MDPC codes are more intuitive and easier for beginners to understand so pointing out the difference between MDPC and LDPC codes should help them understand it better. That is the purpose of the article is it not? just-emery (talk) 19:45, 7 June 2009 (UTC)

 * If that sentence were to be retained, I would scrap the mention of MDPC entirely, and talk about block codes in general.

 * Incidentally, I don't believe that the reduced cycles is what lets it attain close to the Shannon limit; instead it simplifies the decoding procedure (although I'm happy to be proved wrong on that one!). Oli Filth(talk 20:01, 7 June 2009 (UTC)

 * I found this:http://www.comlab.hut.fi/studies/3410/slides_08_12_4.pdf I havent read it through completely but it seems to be relevant. just-emery (talk) 20:23, 7 June 2009 (UTC)
 * the lack of cycles makes belief propagation work better. beliefs arent propagating around in circles. that would be bad. just-emery (talk) 20:26, 7 June 2009 (UTC)
 * also see Gallager p42 where he talks about 'independence assumption'. also theorem c.1 just-emery (talk) 20:52, 7 June 2009 (UTC)

I've removed the new paragraph for now, as I think we should be sure on the details first (and probably need someone like User:Edratzer who really knows what they're talking about to help!). Also, this is material that should really be somewhere other than the lead, as the lead isn't supposed to introduce material which isn't then discussed further down. Oli Filth(talk 21:23, 7 June 2009 (UTC)

 * if you dont 'know' what you are talking about then why are you taking it upon yourself to remove it? this is not how wikipedia is supposed to work. just-emery (talk) 21:33, 7 June 2009 (UTC)
 * regarding cycles:http://www.ece.cmu.edu/~moura/papers/intermag05-lu-ieeexplore-1.pdf just-emery (talk) 21:33, 7 June 2009 (UTC)
 * reducing cycles is called increasing 'girth' for ldpc codes. just-emery (talk) 21:46, 7 June 2009 (UTC)
 * http://axiom.anu.edu.au/~williams/papers/P167.pdf just-emery (talk) 22:04, 7 June 2009 (UTC)

 * With no disrespect intended, I'm not sure you know what you're talking about either (that was my point: my impression is that neither of us is qualified to make in-depth edits to this article). At the moment it seems to be a case of adding sentences based on cobbling together nuggets gleaned from various Google searches; that's not a good way to get a coherent or factually correct article on a subject of this nature.  My editing policy is that it's better to remove material than to have unsourced and questionable material remain in the article.  (That, by the way, is how Wikipedia is supposed to work; see WP:Verifiability and so on.)
 * Secondly, the one thing I am fairly confident in is that there is no meaningful connection between MDPC and LDPC. Please find a source for this assertion if you believe it should remain in the article.  Oli Filth(talk 22:13, 7 June 2009 (UTC)

 * Thats obviously a subjective judgement call. I totally disagree with you. as you obviously realize, no reference will ever prove a judgement call. I have repeatedly explained myself at great length on this and other topics only to be completely ignored by you. its clear that you will not allow anything in any of the articles except what you yourself want in it despite the fact that you clearly know very little about mdpc, belief propagation, or soft-in soft-out decoding.  heavy handed edits such as yours are ruining wikipedia.just-emery (talk) 22:38, 7 June 2009 (UTC)

 * If it's an unsourced (or unsourceable) subjective judgement, then I'm afraid it has no place in an article. And as I've already iterated, there's no meaningful rationale for such a comparison.  These are the two reasons for my removal of the material.  Oli Filth(talk 22:50, 7 June 2009 (UTC)

 * Again, with no disrespect intended, your explanations have been (to a large degree) based on flawed or incomplete understanding of the issues. Please don't make unfounded accusations about the motivation behind my edits (see WP:AGF); in essence, the only thing I will not "allow" is unsourced material, especially when it's of dubious accuracy.  Oli Filth(talk 23:13, 7 June 2009 (UTC)

Regarding comparing the 2. Do you not admit that you could create an ldpc matrix that was equivalent to a mdpc code? so in effect you can think of an mdpc code as a ldpc code whose matrix satisfies certain constraints. so the fact that it uses a matrix doesnt change anything. hence the connection between them. its the randomness of the matrix that is important. just-emery (talk) 22:32, 7 June 2009 (UTC) Since that is the only difference between them then it must be the reason for teh increased performance of ldpc codes.

 * All linear block codes may be defined in terms of a parity matrix! (That's practically the definition.)  MDPC is nothing special in this regard.  Oli Filth(talk 22:49, 7 June 2009 (UTC)

 * LDPC codes and MDPC are based on the same component code: the parity checksum, and in my opinion the relationship stop there. In an LDPC codes, the number of symbols involved in a parity check is small and does not depend on the length of the code, while in MDPC the number of symbols involved in one parity check depend on the length of the code. In my opinion it is a big difference, since the encoding and the decoding algorithm will not have the same complexity. In addition, for a given length and a given dimension, an LDPC code will outperform an MDPC codes if decoded with an iterative decoding algorithm.Cunchem (talk) 08:40, 8 June 2009 (UTC)

 * That was my point just above; all linear codes can be defined in terms of a parity checksum. Oli Filth(talk 15:31, 8 June 2009 (UTC)

Start again
The above discussion is clearly getting nowhere, so I'll repeat my challenges to the material again. If the answer to any one of the following questions is "no" then the material should be removed (although I suspect the answer to all three is "no"): Oli Filth(talk 23:38, 7 June 2009 (UTC)
 * 1) Do you have a justification as to why the comparison "LDPC vs. MDPC" is more relevant than "LDPC vs. x"? (where x is any other linear block code).
 * 2) Can you think of any similarities between LPDC and MDPC other than that they're both linear block codes, and both have the term "parity check" in their name?
 * 3) Do you have a source for any of this?

 * @User:Em3ryguy: My 2 cents on this: I'm pretty sure that multi-dimensionality on parity check matrices is a more general concept, and has no specific connection to LDPC codes. If you want to add information about MDPC in an article about LDPC, you have to provide a (scientific) reference stating the connection.

 * Ok, I had another look at Multidimensional parity-check code. If that is what it is, I can see where you see the connection. I guess you could indeed classify these codes as LDPC codes, since there would be roughly sqrt_d(k) ones per column in the parity-check matrix for a k-size word and dimension d.

 * This would make a MDPC code a special case of an LDPC code.

 * Yet, I think this information should be somewhere at the bottom of the page.

 * What do other people think? Nageh (talk) 11:24, 8 June 2009 (UTC)

 * Answering to myself... I think the confusion arises because there is some information missing in the article. LDPC codes are characterized by two central points:
 * construction via bipartite graph,
 * resulting parity-check matrix is sparse.
 * So the question is whether you regard MDPC codes as being constructed via a bipartite graph. Since that certainly was not the original intention of MDPC code design, classifying MDPC codes as LDPC codes seems a little bit stretched after all.

 * To summarize: If there is reference to MDPC codes in the article, then it should say that "an MDPC code may be viewed as a simple, regular LDPC code". After all, I would rather omit this information than to include it.

 * Nageh (talk) 11:44, 8 June 2009 (UTC)

 * does "sqrt_d(k) ones per column" makes a matrix sparse?
 * since sqrt(k)/k approaches 0 with k->infinity, I would say, yes, they are sparse... but that's just my opinion.
 * I think the number of ones per column is $$\lim_{k\rightarrow \infty} \frac{dk + 2\sqrt{k}}{k + 2\sqrt{k}} = d$$. (Note that I'm tired, so I could easily have screwed up...)
 * Your threshold for sparsity seems to be based on the number of ones divided by the overall number of elements (n.k). This sounds fair enough, but wouldn't this classify most codes as sparse (e.g. Hamming)?  Oli Filth(talk 19:01, 8 June 2009 (UTC)
 * If I didn't mess things up in my head, then for a hypercube of dimension d and a k element word you would have sqrt_d(k) ones per column in the parity-check matrix, and consequently the percentage of ones in the matrix approaches zero. I don't see this is true for most linear block codes, in fact RS codes have pretty dense parity-check matrices... but I might be dumb right now.
 * BTW, I'm just talking about the "parity part" of the matrix... so, number of ones in the parity part divided by (n-k)*k.
 * Nageh (talk) 20:59, 8 June 2009 (UTC)

 * I think that LDPC are also characterized by there ability to be efficiently decoded by a low complexity iterative decoding algorithm. Cunchem (talk) 14:54, 8 June 2009 (UTC)
 * Not really. In the original Gallager codes you had to do a full matrix multiplication. The idea was just that there was algorithms doing this faster for sparse matrices than general algorithms, but it was definitely not low complexity.
 * In the original article of Gallager, after analysing the performances of LDPC under Maximum Likelihood decoding, he introduces 2 algorithms in part 4 that are in fact iterative algorithm. He says that these algorithms are suboptimal but have a low complexity. Maybe you were refering at the encoding when speaking about matrix multiplication. Cunchem (talk) 19:54, 8 June 2009 (UTC)
 * It seems my memories were blurry... thanks for correcting me.
 * Nageh (talk) 20:59, 8 June 2009 (UTC)
 * My (rather limited) understanding of LDPC is that the bipartite graph viewpoint and the parity-matrix viewpoint are equivalent (it's just a mapping between codeword bits and parity constraints), therefore all linear block codes have one. In the case of LDPC, however, the sparsity of the parity matrix leads to a sparse graph, which in turn leads to an efficient decoder.  So I'm still not convinced that MDPC is especially relevant, and would still be reluctant to include this without some authoritative reference.  Oli Filth(talk 15:31, 8 June 2009 (UTC)
 * All linear block codes may be modeled as bipartite graphs, sure. But the point is: how do you construct the codes? If you take the graph approach, this is what would be called LDPC codes. Other codes, e.g. RS codes, take other approaches, such as polynomial interpolation.
 * I agree with you regarding MDPC. As I said before, it seems very stretched to view MDPC codes as constructed via bipartite graphs, since the original intention was likely simply to compute single parity bits over rows and columns in a hypercube. I suggest leaving mentioning MDPC codes out, or otherwise, if there is an appropriate place (subjective) in the article, then it should only say that "MDPC codes may be viewed as simple regular LDPC codes".
 * Edit: I rather vote for removing the reference to MDPC codes.
 * Nageh (talk) 16:59, 8 June 2009 (UTC)

 * I see your point on why LDPC construction is special, and I think we agree that it means that MDPC is no more relevant than any other code construction. Oli Filth(talk 18:46, 8 June 2009 (UTC)

 * Regarding randomness, I do not recall randomness being a central criterion in the definition of LDPC codes; in fact, you could very well construct low-density parity check matrices algebraically and deterministically, it's just that randomized constructions turn out to be superior.
 * Nageh (talk) 09:14, 8 June 2009 (UTC)

@ User:78.42.25.227
I am confused by your recent edit... In the parity-check matrix, there will be either 1's or 0's. The null space of the matrix defines the graph. I don't see why there should be "probabilities" in the matrix for syndrome computation. And syndrome computation tells you normally whether decoding was correct (syndrome is 0) or not (not 0). Please justify your edit (or anyone else), either on the talk page or as a reference, or I will revert your edit. Thanks, cheers, Nageh (talk) 18:14, 20 October 2009 (UTC)

 * Oups I just reverted the change before reading your post ... Maybe it is a way to represent or implement the iterative decoding, and in this case it should be justified. —Preceding unsigned comment added by Cunchem (talk • contribs) 07:39, 21 October 2009 (UTC)

Probably trivial in the context...
Trivial, I'm sure, but...

In the introduction to the article, it refers to Gallager developing the LDPC concept in his doctoral dissertation at MIT in 1960.

However, in the History section, it states that LDPC codes were first developed by Gallager in 1963. Reference 6 states 1963. Which is true?

David Kelsey — Preceding unsigned comment added by 101.178.141.19 (talk) 00:54, 27 September 2015 (UTC)

 * "The story of LDPC codes and iterative decoding begins in Gallager’s remarkable Ph.D. thesis completed in 1960, and later published in 1963"
 * [R. G. Gallager. Low-Density Parity-Check Codes. MIT Press, 1963]
 * Markovisch (talk • contribs) 01:02, 27 March 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 5 external links on Low-density parity-check code. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20061008053124/http://www.ieeevtc.org/vtc2003fall/2003panelsessions/llee.pdf to http://www.ieeevtc.org/vtc2003fall/2003panelsessions/llee.pdf
 * Added archive https://web.archive.org/web/20091213012126/http://blog.ds2.es/ds2blog/2009/10/ieee-communications-magazine-paper-on-ghn.html to http://blog.ds2.es/ds2blog/2009/10/ieee-communications-magazine-paper-on-ghn.html
 * Added archive https://web.archive.org/web/20130526003113/http://www.atsc.org/cms/pdf/pt2/Wells_ATSC_paper_on_T2.pdf to http://www.atsc.org/cms/pdf/pt2/Wells_ATSC_paper_on_T2.pdf
 * Added archive https://web.archive.org/web/20090926035703/http://www.mathworks.com/access/helpdesk/help/toolbox/comm/ref/fec.ldpcenc.html to http://www.mathworks.com/access/helpdesk/help/toolbox/comm/ref/fec.ldpcenc.html
 * Added archive https://web.archive.org/web/20090217170744/http://www.mathworks.com/access/helpdesk/help/toolbox/comm/ref/fec.ldpcdec.html to http://www.mathworks.com/access/helpdesk/help/toolbox/comm/ref/fec.ldpcdec.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 14:14, 7 January 2018 (UTC)

Decoding
The decoding section directly jumps to technicalities and state-of-the-art improvements while never really introducing belief propagation and bit flipping algorithms which I believe are not that hard to understand.

The part about seeing an LDPC as independent SPC codes and using SOVA or BCJR is confusing. I believe it tries to draw an analogy between turbo codes or convolutional codes and LDPC codes. It currently has no reference and the only references I could find on applying those algorithms to LDPC were in really specific constructions with structured codes or concatenations.

The part about lookup table has no reference either. I have no doubt that a bit flipping algorithm can run on a low power CPU and that some computations can be avoided by using a lookup table (for the check nodes computations for example). But I am not sure that this is what the author meant and if this is what was meant I don't see how it is relevant to detail the lookup table and the usage of the FIFO.

Bpcov (talk) 19:44, 28 July 2018 (UTC)

title: Talk:Low-density parity-check code


text:
Cal Anderson Park

Cal Anderson Park is a public park on Seattle, Washington's Capitol Hill that includes Lincoln Reservoir and Bobby Morris Playfield.

Features
The north end of the open park features Waterworks, a large mountain-shaped water fountain feeding a shallow texture pool, a reflecting pool, and a wading pool. The south end features the lighted Bobby Morris Playfield. The wading pool operates in the summer months from 12 noon to 7 p.m.

Other features:
 * Shelterhouse
 * Plaza
 * Children's play area
 * Caged tennis courts with outdoor lights
 * Basketball courts
 * Dodgeball court

History
Lincoln Reservoir was begun in 1889, in response to the Great Seattle Fire of the same year, and was completed in 1901. A parcel just south of it was named Lincoln Park the same year. The famed Olmsted Brothers designed the park, as part of their many works in the Seattle area. In 1908 it was developed as a playfield, and in 1922 its name was changed to Broadway Playfield so as not to duplicate the name of the new Lincoln Park in West Seattle. The playfield was named after Bobby Morris, former King County, Washington auditor, in 1980. Meanwhile, the area around the reservoir had come to be known as Lincoln Reservoir Park. On April 10, 2003, the entire area was designated Cal Anderson Park, after Washington's first openly gay state legislator. Anderson had died in 1995 of AIDS.

From 2003–2005, the reservoir was rebuilt as a covered basin.

Three security cameras were installed in the park in April 2008 in an effort to combat certain types of criminal activity, namely vandalism, drug dealing, and public sex.

In 2004, World Naked Bike Ride Seattle established a tradition of stopping briefly in the park, usually in the midsection near the shelter house and water feature. Body Pride ride also began making stops in 2005.

In 2009, Forbes magazine recognized Cal Anderson Park as one of the 12 Best City Parks in the U.S.

The Seattle March for Science took place at the park on April 22, 2017.

On June 8, 2020, protesters occupied the park and declared it part of the Capitol Hill Autonomous Zone (CHAZ). The area was renamed the Capitol Hill Occupied Protest (CHOP) several days later.

On June 20, 2020, a shooting took place in the park, which served as a gathering area in the CHOP at the time. A 19-year-old man was fatally shot, and a 33-year-old man was critically injured. The incident was cited by opponents of the zone as a justification to disband it, using either the National Guard or the Seattle Police Department.

On April 29, 2023, a shooting in the park killed two men and critically injured another.

Light rail station
The northwest corner of Cal Anderson Park (at the corner of East Denny Way and Nagle Place) contains an entrance to the underground Capitol Hill Station of Sound Transit's Link light rail.

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

title: Cal Anderson Park


text:
Talk:Cal Anderson Park

Waterworks
--- Another Believer ( Talk ) 18:16, 18 February 2019 (UTC)
 * https://artbeat.seattle.gov/category/artbeat/public-art/weekly-art-hit/page/4/

BLM memorial garden

 * https://www.seattletimes.com/seattle-news/politics/seattle-plans-to-remove-cal-anderson-parks-blm-garden-draws-pushback/

--- Another Believer ( Talk ) 14:33, 11 October 2023 (UTC)

Photos after garden removal:

--- Another Believer ( Talk ) 16:57, 30 December 2023 (UTC)

title: Talk:Cal Anderson Park


text:
Talk:John Frame (theologian)

Wish list
I'd like to add a section about Frame's thought, especially as it differs from Van Til. --Flex 19:55, 12 Oct 2004 (UTC)

I'd also like to see more details on Frame's presuppositionalism, his treatment of ethics, and his "biblicism." --Fl e x (talk/contribs) 13:51, 6 May 2008 (UTC)

Neutrality
The section on epistemology is well received, but it must be wikified and made neutral in accordance with Wikipolicy. --Flex 21:35, 8 March 2006 (UTC)

 * Can you point out what is or is not POV? I'm seeing a few questionable phrases ("Christians such as Frame...", etc.) but nothing substantial. Remember that Wikipedia is not a debate, and the presentation of Frame's ideas does not endorse them nor does it particularly call out for rebuttal. However, if there is a notable opposition to or refutation of his ideas, then perhaps we should add some links to the appropriate pages. -Harmil 14:51, 14 March 2006 (UTC)

 * I already neutralized it and removed the POV tag from the article. Sorry I didn't note that here. --Flex 13:21, 15 March 2006 (UTC)

Keep, move, or disambiguate?
User:GeorgeWilliams inappropriately moved this page to John M. Frame by cutting and pasting the contents of another article. That left the history and the talk pages for both the new and old hanging (not to mention left a number of WP articles obviously pointing to the wrong article). If the page should be moved, the proper procedure is to use the Wikitools to move them, not do so manually, so that everything stays consistent. I have restored the old state until we come to resolution.

More to the point, by Google hits and publications, the philosopher/theologian seems to be much likelier the person sought than an athlete from the 1700s, so this was by no means a non-controversial move and should not have been made unilaterally. At the very least, I would argue this page should become a disambiguation page, but really, based on Google, I think a top link to the cricketer is the most appropriate solution under WP:DISAMBIG since the vast majority of people looking for John Frame will want this one. --Fl e x (talk|contribs) 22:42, 27 April 2007 (UTC)

 * Agreed. I tried the conventional move but it did not work because of a redirect page.  I did not realise that a copy would cause problems on other pages.  If there is a link to the cricketer I will be happy with that.  --GeorgeWilliams 07:54, 28 April 2007 (UTC)

Ok. That's how we'll do it then. Thanks! --Fl e x (talk|contribs) 15:36, 28 April 2007 (UTC)

Worship and music
I've added a brief section about Frame's views in this field. I haven't added any references yet but there are several articles on the internet from other notable reformed theologians who have publicly disagreed with Frame. I'll try to cite them shortly. Sidefall (talk) 13:05, 6 May 2008 (UTC)

 * Good call. See the reference section at regulative principle of worship. Note, however, that those who advocate exclusive psalmody and/or a capella singing are a small minority, and we must be careful not to give their criticisms undue weight here -- this article should stress Frame's positions, not theirs. The disagreement over musical/worship style, on the other hand, has wider participation. --Fl e x (talk/contribs) 13:48, 6 May 2008 (UTC)

 * Thanks. As I said in my edit, it's not just the two points you mention that have provoked dispute - Frame has also been criticised for his support of contemporary worship music (including modern instruments) and dancing. I'd guess there are quite a few who accept traditional hymns and the pipe organ, but are opposed to more recent developments. On the minority views, I don't know the sizes of the various factions. Have you any idea? I'd be very interested to find out. If the statistics are authoritative they would make a useful addition to Wikipedia. Another question is have any other prominent Presbyterian theologians expressed similar views to Frame? My feeling is probably not - maybe Frame is the only one who's dared to stick his neck out, which is why he's been criticised so much. But I don't move in these circles and I am anything but an expert. My personal research interest is in changes to styles of worship over recent years and the influence of the charismatic movement in this regard - any sources you know of relating to this would be much appreciated. Sidefall (talk) 15:04, 6 May 2008 (UTC)

 * Consider the Presbyterian Church in America, the largest conservative Presbyterian denom in the US (about 340,000 members) and the denom in which Frame is ordained. It has churches with traditional, contemporary, and liturgical worship styles, and many PCA churches offer multiple styles. For instance, at one of the PCA's flagship churches, Tim Keller's Redeemer Pres in NYC, "[t]he morning services use primarily classical music and the evening services use primarily jazz and contemporary music." Generally those who favor exclusive psalmody and a capella believe it is a matter of principle and separate from those who don't. Consequently, AFAICT, these practices are almost exclusively found in so-called micro-denominations like the Reformed Presbyterian Church of North America, which has around 6500 members worldwide. (Compare the other articles that link to exclusive psalmody).

 * Other resources you might consider are Marva Dawn's Reaching Out without Dumbing Down, Royal Waste of Time, and How Shall We Worship?; the writings of Keven Twit, who spearheads Indelible Grace which re-sets hymns to modern music (e.g., "My Grandmother Saved It, My Mother Threw It Away, and Now I'm Buying It Back" from Reformed Worship, the articles on the right side of this page, "Criteria for Judging Rock Music", and "Why We Still Need Hymns in a Postmodern World: The Formative Power of Worship" [note especially the bibliography at the end]); and some of the articles found here (note also Richard L. Pratt, Jr.'s article on the regulative principle, which doesn't show up in that search). See also this Q&A for a summary of the debate from a PCA member representing an organization that is close to the PCA. --Fl e x (talk/contribs) 16:04, 6 May 2008 (UTC)

 * Thanks for very comprehensive reply. I wasn't aware that exclusive psalmody was such a minority view and I agree with your comment about undue weight. I'll do some editing when I have time. Sidefall (talk) 07:16, 7 May 2008 (UTC)

Link is incorrect - a query over this
This article, when it says Frame is an authority on Cornelius van Til, says the link is incorrect. The link takes us to Frame's own website which contains a list of works by Frame, so maybe some of these works discuss the work of van Til. Vorbee (talk) 15:10, 3 April 2018 (UTC) The article on Cornelius van Til does say that Frame is a sympathetic critic of van Til, so perhaps the link should be moved to this article. Vorbee (talk) 15:17, 3 April 2018 (UTC)
 * Fixed, with a new citation. StAnselm (talk) 22:34, 3 April 2018 (UTC)

I give up
I just spent hours at the Poythress article, trying to fix the fact that it seems to be a self-published promotional site, rather that an independent, third-party, academic/encyclopedic treatment. In doing so, I found and added the 2017 Festschrift, theretofore unmentioned, and added more independent sources than appeared to date.

But in wikilinking to this (Frame) biography, I throw up my hands. (I wikilinked, because of the regard held for the blog that the two have written together, etc.) Here I find the same situation—sentence after sentence without sourcing, another clear case of large volume early additions of "privileged text" (less politely put, non-independent content that is either WP:OR or plagiarised, and likely with COI issues attending).

Are there no standards of scholarly biography, here, in this sub-genre of WP biography? Is the whole of encyclopedic article-writing on contemporary theological persons similarly "just trust us, we know about this" in its underpinnings (that is, ignoring WP guidelines and policies, for personal knowledge or self-published information provided essentially directly by the title subject)? I give up. One cannot edit if, even with one's "family", one does not share common convictions regarding quality and submission to the rules. — Preceding unsigned comment added by 2601:246:C700:2DB2:8133:1B3B:F75D:70F4 (talk) 18:41, 16 July 2019 (UTC)
 * Besides removing whole sections/paragraphs of self-published WP editor "scholarship" here—the single biggest, even screaming issue of the article (the article's attempt to pass off individual WP editor perspectives as independent, published, authoritative third-party thought)—the article as a whole needs restructuring, so it flows and makes sense to non-specialist readers. E.g., look at point at which the "Presuppositions" section appears, and look at the order of paragraphs relative to the order of the theological publications referenced. — Preceding unsigned comment added by 2601:246:C700:2DB2:8133:1B3B:F75D:70F4 (talk) 19:36, 16 July 2019 (UTC)
 * These 10.5 kb of edits (the majority of the article), here and here, were done by an unlogged editor, from the same address, and it is ALL unsourced, interpretive content. These edits should never have been allowed to stand in the first place, because they are either WP:OR or plagiarism, perhaps from a non-independent editor. Please look to undo the huge self-published mess these earlier edits created. If local, dedicated editors do not do so, I will call the situation to the attention of administrators.
 * This whole article is a shambles. "citation needed" "citation needed" "citation needed"... I've never seen anything like it.
 * The only thing that is undebatable about John Frame is that he believes in food.  JohndanR (talk) 21:52, 26 September 2020 (UTC)
 * The first addition linked here had mostly been cut. I have just removed the second. Article still needs attention from an expert, or someone with the time and inclination to re-write it completely with sourcing. Tacyarg (talk) 20:29, 21 September 2023 (UTC)

title: Talk:John Frame (theologian)


text:
Venetian Festival

Venetian Festival is the name of a festival held in cities in Europe and North America. They are based on carnival, or carnevale, the period just before Lent, as celebrated in the 17th century in Venice, Italy. Venetian festivals re-create the fantasy of the earlier events with food, costumes, masks, music, theater, juggling and other spectacles. The masks and costumes are worn by people who often travel from other countries to attend and perform (or parade) in these festivals. The elaborate costumes and masks are handmade by artisans from various countries. Many involve male and female or group versions and are based on old Venetian characters and costumes.

In the U.S., A Venetian Festival is held in Charlevoix, Michigan which started in 1930. There is also a Venetian Festival held in Saugatuck, Michigan.

Another Venetian Festival, in Lake Geneva, Wisconsin, has been run by the Lake Geneva Jaycees since 1962.

A Venetian Festival was formerly held annually on the third weekend of July at Silver Beach County Park in St. Joseph, Michigan, a small town on the coast of Lake Michigan in the southwest part of the state. It started in 1979, and grew from a handful of people to nearly 200,000 visitors at the end. Once a two-day event on Friday and Saturday, this festival eventually ran from Thursday through Sunday and featured a variety of amusements. It was discontinued after the 2011 festival.

title: Venetian Festival


text:
Wikipedia:WikiProject Time

Some Wikipedians have formed this project to better organize information in articles related to Time. This page and its subpages contain their suggestions. The project's members hope this project will help to focus the efforts of other Wikipedians. If you would like to help, please inquire on the talk page and see the to-do list there.

Scope
This WikiProject aims to take an overview of the way temporal concepts are treated within Wikipedia, in particular to ensure a coherent approach for all time-related articles. The principal articles with which this project deals are included in the Category:Time or one of its subcategories.

Goals
To create, expand, and maintain articles related to time. This will specifically include those articles contained within the Category:Time, and generally include any article that discusses time.

Article alerts
Pages can still be rescued even when the project is inactive

Departments

 * WikiProject Time/Assessment - the assessment department.

Participants
Want to help improve Time-related articles? Join WikiProject Time by adding your name here:
 * 1) AMK152 (talk) 14:50, 7 August 2006 (UTC)
 * 2) John Carter (talk) 23:01, 1 May 2007 (UTC)
 * 3) Flappy Pigeon
 * 4) Zginder (talk) 13:34, 4 October 2007 (UTC)
 * 5) Arthur Rubin (talk) 02:01, 14 November 2007 (UTC)
 * 6) Yamara ✉ 19:33, 2 January 2008 (UTC)
 * 7) Anubhab91 (talk) 11:12, 12 February 2012 (UTC)
 * 8) Pro66 (Formerly known as Pathfinder2006) (talk) 19:02, 4 January 2008 (UTC)
 * 9) Firedrop (talk) 12:38, 12 May 2008 (UTC)
 * 10) Fatka (talk) 02:08, 4 November 2008 (UTC)
 * 11) Loadmaster (talk) 17:43, 23 December 2008 (UTC)
 * 12) Kendrick7talk 03:20, 14 February 2009 (UTC)
 * 13) Kpgjhpjm
 * 14) Ktsquare (talk) 00:44, 24 July 2009 (UTC)
 * 15) Glenn L (talk) 06:21, 3 September 2010 (UTC)
 * 16) Tim Parenti (talk) 19:37, 30 March 2011 (UTC)
 * 17) ViswaPrabha വിശ്വപ്രഭ (talk) ViswaPrabha വിശ്വപ്രഭ (talk) 19:58, 6 November 2011 (UTC)
 * 18) Guy Macon (talk) 20:46, 6 December 2011 (UTC)
 * 19) Uncle Ed (talk) 00:39, 28 February 2012 (UTC), I got the ball rolling on date calculations, such as the age template (gosh that was a long time ago!); now interested in time zones and daylight saving time.
 * 20)  04:19, 5 August 2012 (UTC)
 * 21) Ock Raz   talk  12:08, 17 August 2013 (UTC)
 * 22) ~KvnG 10:06, 6 November 2013 (UTC)
 * 23) Doc H e u h  (talk) 02:34, 11 January 2015 (UTC)
 * 24) Evensteven (talk) 21:13, 16 February 2015 (UTC)
 * 25) Brateevsky — I'm interested mostly in Time in Russia and time in former USSR.
 * 26) Boca Jóvenes (talk) 09:19, 6 August 2016 (UTC)
 * 27) Maxim Stoyalov DENAMAX (talk) 09:36, 24 February 2017 (UTC)
 * 28) Matt Johnson (talk) 17:18, 31 October 2017 (UTC) - I've been keeping the list of tz database time zones maintained.
 * 29) RaptorChief (talk) 05:37, 1 February 2018 (UTC)
 * 30) PetesGuide (talk) (K6WEB) 18:24, 22 February 2018 (UTC)
 * 31) Iwaterpolo (talk) 21:15, 5 January 2020 (UTC)
 * 32) 3Todd (talk) 13:32, 28 April 2020 (UTC)
 * 33) Glauberfm (talk) 16:34, 24 July 2020 (UTC)
 * 34) TheRealGrantma (talk) 03:26, 8 November 2020 (UTC)
 * 35) Jaredscribe (talk) 05:29, 18 March 2021 (UTC) working on Asian Lunisolar calendars & historic, religious & cultural holidays.  And few Roman, European & American holidays. Committed to the Encylopedic mission w/ WP:NPOV, etc.
 * 36) ContributeToTheWiki (talk) 12:16, 27 January 2023 (UTC) Working on certain pages that could be improved or expanded.

Inactive participants
title="Amit's Contributions">Contribs ]])
 * 1) Mak Allen (talk) 10:15, 13 February 2008 (UTC)
 * 2) Flaming (talk) 05:02, 14 February 2008 (UTC) Generally inactive, but I try...
 * 3) Kaaveh (talk) 02:18, 12 May 2008 (UTC)
 * 4) Manoj Pai (talk) 16.24, 20 May 2008 (UTC)
 * 5) Regret Tenenbaum (talk) 04:33, 21 May 2008 (UTC)
 * 6) UC Bill (talk) 21:39, 28 October 2008 (UTC)
 * 7) Sungrad (talk)
 * 8) Eyezee (talk) 09:57, 21 March 2009 (UTC) that is if i have the time
 * 9) Wikid as© 14:38, 25 April 2009 (UTC) - need more time
 * 10) ResidualDecay (talk) 04:40, 13 September 2009 (UTC)
 * 11) Terry0051 (talk) 14:22, 12 October 2009 (UTC)
 * 12) Handbook3 (talk) 23:51, 2 March 2010 (UTC)
 * 13) Peter midnight (talk) 07:57, 27 May 2010 (UTC)
 * 14) Jameschrislloyd (talk) 17:36, 10 June 2010 (UTC)
 * 15) Swatkatz14 (talk) 09:42, 7 January 2011 (UTC)
 * 16) Zpanos (talk) 20:17, 27 March 2011 (UTC)
 * 17) Inbamkumar86 (talk) 21:03, 19 September 2011 (UTC)
 * 18) Theanonymous3
 * 19) Anti-Quasar
 * 20) Johnmahorney (talk) 16:20, 22 August 2012 (UTC)
 * 21) Dewey420 (talk) 02:43, 5 September 2012 (UTC)
 * 22) SonnyPondrom (talk) 9:11, 14 December 2012 (UTC)
 * 23) User:Avenzhang (talk) 22:29, 29 January 2013 (UTC)
 * 24) User:ACEOREVIVED (UTC)
 * 25) User:Jogi don (UTC)
 * 26) FrankP (talk) 12:03, 16 November 2004 (UTC)
 * 27) jredmond (talk) 15:17, 26 October 2005 (UTC)
 * 28) Jsarmi (talk) 15:06, 29 January 2008 (UTC)
 * 29) Cosmic Latte (talk) 04:34, 21 March 2008 (UTC)
 * 30) RobertFritzius (talk) 17:41, 8 July 2008 (UTC)
 * 31) Amit  ( Talk  | [[Special:Contributions/Amit6|<span
 * 1) claude (talk) 18:47, 5 October 2009 (UTC)
 * 2) Sean (Talk | Contribs) 20:09, 26 December 2009 (UTC)
 * 3) SuperHero2111 (talk) 00:55, 4 December 2013 (UTC)
 * 4) SteveJonesMO (talk) 17:00, 12 January 2014 (UTC)
 * 5) Synester.balck (talk) 06:30, 12 september 2014 (UTC)
 * 6) Philipakoda (talk) 22:53, 23 March 2023 (UTC)
 * 7) SXandR (talk) 16:35, 28 September 2023 (UTC)

Categories and subpages

 * List of

Parentage
Descendants of this WikiProject are:
 * WikiProject Calendars (tagged inactive)
 * WikiProject Days of the year
 * WikiProject Watches (tagged semi-active)
 * WikiProject Years

Related WikiProjects

 * WikiProject Timeline Tracer
 * WikiProject History
 * WikiProject Holidays
 * WikiProject Leaders by year
 * WikiProject Years in science

title: Wikipedia:WikiProject Time


text:
Ron Jaworski

Ronald Vincent Jaworski (born March 23, 1951), nicknamed "Jaws", is an American former football quarterback who played 17 seasons in the National Football League (NFL). He played college football for the Youngstown State Penguins and was selected by the Los Angeles Rams in the second round of the 1973 NFL draft. After spending four seasons mostly as a backup for the Rams, Jaworski was traded to the Philadelphia Eagles in 1977, where he would lead the Eagles to four consecutive playoff appearances, including a division title and the franchise's first Super Bowl appearance in 1980. After ten seasons with the Eagles, Jaworski signed with the Miami Dolphins, where he would spend two seasons as a backup.

After his playing career, Jaworski worked as an NFL analyst on ESPN from 1990 to 2017. From 2004 to 2019, he served as an executive of the Philadelphia Soul franchise of the Arena Football League, where he also briefly served as the league's Executive Committee Chair from 2018 to 2019. He is also the founder and CEO of Ron Jaworski Golf, which owns and manages several golf courses across the Delaware Valley region.

Early life and college
Jaworski was born and raised in Lackawanna, New York. A three-sport star in high school, he turned down a Major League Baseball offer from the St. Louis Cardinals to attend college at Youngstown State University, where he was nicknamed "Rifle Ron" and the "Polish Rifle", a reference to his Polish ethnicity.

At Youngstown State, he showcased his skills as a quarterback for a pass-oriented offense, earning a selection in the Senior Bowl. Jaworski set several school records during his tenure at Youngstown State, including single-season passing completions (139), career passing completions (325), single-season passing yardage (2,123), career passing yardage (4,612), single-season passing touchdowns (18), and career passing touchdowns (32).

Los Angeles Rams
Jaworski was selected in the second round of the 1973 NFL draft by the Los Angeles Rams. Jaworski was named the third-string quarterback, backing up John Hadl and James Harris, and only appeared in a total of five games through his first two seasons.

In 1975, Jaworski saw his first major playing time in Week 13, when starter James Harris suffered a shoulder injury three plays into the game. Jaworski led the Rams to a 22–5 victory over the Green Bay Packers, where he completed 14 of 24 passes for 174 yards and an interception. The next week, Jaworski made his first career start for the final week of the season, where he led the Rams to a 10–3 win over the Pittsburgh Steelers.

Entering the playoffs, there was speculation as to whether James Harris was healed enough to return or if Jaworski would start for the divisional round game against the St. Louis Cardinals. It was only minutes before gametime when Jaworski was informed by head coach Chuck Knox that he would be starting. In his playoff debut, Jaworski completed 12 of 23 passes for 203 yards with both a passing and rushing touchdown, en route to a 35–23 victory to advance to the NFC Championship Game. Despite Jaworski's performance, he was not named the starter for the NFC Championship, as James Harris was deemed healthy enough to return. However, Harris reaggravated his shoulder injury after just two passes in the game, and Jaworski came in as a backup. He completed 11 of 22 passes for 147 yards, but threw two interceptions in the 37–7 loss to the Dallas Cowboys.

Entering the 1976 season, Jaworski was named the Week 1 starter after James Harris fractured his thumb. In the season opener against the Atlanta Falcons, however, Jaworski left the game due to a fractured right shoulder. Backup Pat Haden relieved Jaworski, and led the Rams to a 30–14 victory. In Week 6 against the Chicago Bears, Haden was injured, and Jaworski, although not yet fully recovered, came in and preserved a 20–12 victory. Jaworski started the next week against the New Orleans Saints, but he was benched for Haden in the fourth quarter after completing just 3 of 11 passes for 15 yards. James Harris would start at quarterback for the remainder of the season, and Jaworski would only appear in two other games.

1977–1979
In March 1977, Jaworski was traded by the Rams to the Philadelphia Eagles in exchange for former All-Pro tight end Charle Young. Jaworski would be reunited with former Rams quarterbacks coach Dick Vermeil, who was now the head coach for the Eagles.

In the 1977 season, Jaworski started all 14 games for the Eagles, leading them to a 5–9 record on the season. In 1978, Jaworski led the Eagles to a 9–7 record, clinching both a wild card spot and the franchise's first postseason appearance in 18 years. In the Wild Card game against the Atlanta Falcons, Jaworski helped the Eagles jump to a 13–0 lead that they would hold into the fourth quarter. However, Steve Bartkowski and the Falcons responded late with two touchdowns, and although Jaworski brought the Eagles to the Falcons' 16-yard-line with just 13 seconds to play, punter/kicker Mike Michel missed what would have been a game-winning 34-yard field goal, and the Eagles fell 14–13. As of 2024, this Falcons-Eagles playoff game is believed to be first and only time in NFL history where both starting quarterbacks were of Polish heritage.

In 1979, Jaworski led the Eagles to an 11–5 record and a second-straight wild card berth. In the Wild Card game against the Chicago Bears, Jaworski led the Eagles out of a 17–10 halftime deficit as the Eagles rallied to beat the Bears 27–17. Jaworski completed 12 of 23 passes for 204 passing yards with three touchdowns and one interception. In the divisional round game against the Tampa Bay Buccaneers, the Eagles quickly fell behind to a 17–0 deficit. Despite an attempted comeback led by Jaworski, the Eagles fell to the Buccaneers 24–17.

1980: Super Bowl appearance
In 1980, Jaworski saw perhaps his most successful season in the NFL. The Eagles started out 11–1, en route to a 12–4 record and a NFC East division title. Jaworski threw for 3,529 yards and 27 touchdowns, and received multiple honors, including the Bert Bell Award, the NFC Offensive Player of the Year Award from UPI, and a selection to the Pro Bowl. Jaworski also finished third in AP NFL MVP voting. Facing the Minnesota Vikings in the divisional round, the Eagles trailed 14–7 at halftime, but Jaworski and the Eagles responded by outscoring the Vikings 24–2 in the second half, resulting in a 31–16 Eagles win. Jaworski completed 17 of 38 passes for 190 passing yards with one touchdown and two interceptions.

In the NFC Championship Game, the Eagles would face their division rival, the Dallas Cowboys. In frigid conditions at Veterans Stadium, the Eagles pulled off a strong rushing attack as they went on to defeat the Cowboys 20–7, advancing to their first ever Super Bowl in franchise history.

The Eagles went into Super Bowl XV as slight favorites over the AFC-champion Oakland Raiders. However, Jaworski and the Eagles hit a brick wall, as the Eagles suffered four turnovers and fell behind to a 14–3 halftime deficit. From there, the Raiders kept on with their attack to prevail 27–10 over the Eagles. Jaworski completed 18 of 38 passes for 291 yards while throwing a touchdown and three interceptions with a lost fumble.

1981–1986
In 1981, Jaworski led the Eagles to another strong start to the season, going 7–1 through the first eight games. However, the Eagles went 3–5 in the second half of the season, but still clinched a wild card spot for their fourth consecutive playoff appearance. In the Wild Card game against the New York Giants, the Eagles were unable to overcome 20 first quarter points scored by New York, and despite their best efforts, they ultimately fell to the Giants 27–21. Jaworski went 13 of 24 for 154 yards and one touchdown.

In the 1982 strike-shortened season, Jaworski led the Eagles to a 3–6 record, as the Eagles missed the playoffs for the first time since 1977. Following the season, Eagles head coach Dick Vermeil retired, and was replaced by defensive coordinator Marion Campbell.

Jaworski and the Eagles' struggles continued into 1983, as the Eagles posted a 5–11 record. In 1984, Jaworski led the Eagles to a 5–7–1 record before he suffered a broken left leg in Week 13 against his former team, the Los Angeles Rams. Jaworski's injury ended both his season and his streak of 116 consecutive starts, an NFL record for quarterbacks at the time that stood until 1999, when it was broken by Packers quarterback Brett Favre.

In the second round of the 1985 NFL draft, the Eagles selected quarterback Randall Cunningham. Despite the selection, Jaworski was still intended to be the starter for the Eagles, although Cunningham was intended to be Jaworski's successor in the future. However, after a poor performance in Jaworski's return from his leg injury in the 1985 season opener, he was benched and replaced by Randall Cunningham for Week 2. Jaworski returned to significant playing time in Week 5, when Cunningham was benched in the second quarter due to poor play. Jaworski threw for three touchdowns in the 23–21 loss to the New Orleans Saints, and was subsequently named the starter for the remainder of the season. In Week 7, Jaworski was named the NFC Offensive Player of the Week after a 16–14 victory over the Dallas Cowboys, where he threw for 380 yards and one touchdown. In a Week 10 game against the Atlanta Falcons, he tied an NFL record with a game-winning, 99-yard touchdown pass in overtime to Mike Quick. Jaworski would lead the Eagles to a 7–9 finish on the season, finishing 6–6 as the starter.

At the end of the 1985 season, head coach Marion Campbell was fired and was replaced by former Chicago Bears defensive coordinator Buddy Ryan. Leading up to the 1986 season, Ryan had planned for recently-acquired quarterback Matt Cavanaugh to be the team's starter, however, Ryan ultimately changed his mind days before the season opener, and he named Jaworski the starter. Jaworski led the Eagles to a 2–4 start before he was sidelined due to an elbow injury he suffered just before a Week 7 game against the Dallas Cowboys. Jaworski returned the next week, but was injured again after hurting his finger in Week 10 against the New York Giants. The injury would end Jaworski's season, as Randall Cunningham would replace him. After the season, Jaworski was released by the Eagles, ending his ten-season tenure with the team. He finished with a 69–67–1 record as the Eagles' starter, and held the franchise records for quarterback wins, passing yards, pass completions, pass attempts, and passing touchdowns at the time of his release. Although each of these records were eventually broken by Donovan McNabb, Jaworski still ranks second as of 2024.

Miami Dolphins
In August 1987, Jaworski signed with the Miami Dolphins to backup quarterback Dan Marino. Jaworski did not appear in any games in the 1987 season, and appeared in two games during the 1988 season. He was released by the Dolphins following the 1988 season.

Kansas City Chiefs
In August 1989, Jaworski signed with the Kansas City Chiefs. While initially backing up quarterback Steve DeBerg, Jaworski made his first start in three years in Week 4 after DeBerg was benched due to poor play. Jaworski went 1–2 as starter, but suffered a sprained knee in Week 6 against the Los Angeles Raiders. Steve DeBerg returned as the starter for the Chiefs, and Jaworski did not appear in a game for the remainder of the season.

Retirement
Following the 1989 season, Jaworski contemplated retirement, and he was seen as a potential candidate to replace James Florio in the United States House of Representatives. He ultimately never ran for the seat, but he was waived by the Chiefs in July 1990 and subsequently retired from professional football. In his 17-season career, Jaworski threw for 28,190 yards, 179 touchdowns, and 164 interceptions, while also rushing for 859 yards and 16 touchdowns.

Awards and honors

 * Pro Bowl (1980)
 * Bert Bell Award (1980)
 * UPI NFC Player of the Year (1980)
 * Ed Block Courage Award (1985)
 * Youngstown State Athletics Hall of Fame (1986)
 * National Polish-American Sports Hall of Fame (1991)
 * Philadelphia Eagles Hall of Fame (1992)
 * Philadelphia Sports Hall of Fame (2017)
 * National Quarterback Club Hall of Fame (2022)
 * New Jersey Hall of Fame (2022)

Broadcasting
Following his retirement, Jaworski joined ESPN as an NFL studio analyst in 1990. He mainly appeared as an analyst on NFL Matchup, where he was noted for his skill in breaking down teams' strategies and gameplans. Jaworski also served as a reporter on Sunday NFL Countdown. In 2006, Jaworski worked a game as a color commentator with Brad Nessler and Dick Vermeil during the opening-night doubleheader of Monday Night Football. The next season, Jaworski was selected to replace Joe Theismann as a full-time color commentator for Monday Night Football, where he would work alongside Mike Tirico and Tony Kornheiser. In 2009, Kornheiser was replaced by Jon Gruden as the other color commentator on the broadcast with Jaworski. Following the 2011 season, ESPN announced that the Monday Night Football broadcast team would be reduced to just Tirico and Gruden. Jaworski, however, signed a five-year contract extension with ESPN to remain as an NFL analyst on other programming. In 2017, it was reported that Jaworski, along with a number of other ESPN analysts, would be laid off by the network. Jaworski himself was not aware of his future with the network, as he was still under contract with ESPN. Reports eventually came out that ESPN wanted to retain Jaworski, but parent company Disney ultimately blocked it.

Jaworski also worked as a color commentator for Tampa Bay Buccaneers preseason games on WFLA-TV from 2003 to 2006.

Jaworski frequently appeared on 97.5 The Fanatic as an Eagles analyst, and hosted The Ron Jaworski Show on the station from 2019 to 2021.

Since 2022, Jaworski has worked for NBC Sports Philadelphia as an analyst on Eagles Pregame Live and Eagles Postgame Live, where he works alongside Michael Barkann, Barrett Brooks, and Reuben Frank. Also since 2022, Jaworski has also appeared as a weekly guest on Joe DeCamara and Jon Ritchie's show on 94.1 WIP.

Golf
Throughout his NFL career, Jaworski was an avid golfer, as he spent many off-days at courses. While with the Eagles in 1979, Jaworski and teammate John Bunting managed a golf club in Jenkintown, Pennsylvania. In 1984, Jaworski purchased a club in Gloucester County, New Jersey, which is today Tall Pines State Preserve. Today, Jaworski is the CEO of Ron Jaworski Golf, which is based in Mount Laurel, New Jersey. The company owns and operates eight courses throughout Pennsylvania, Delaware, and New Jersey, including: Blue Heron Pines Golf Club in Galloway Township, New Jersey, Back Creek Golf Club in Middletown, Delaware, Downingtown Country Club in Downingtown, Pennsylvania, Honey Run Country Club in York, Pennsylvania, Ramblewood Country Club in Mount Laurel, New Jersey, RiverWinds Golf Tennis Club in West Deptford Township, New Jersey, Running Deer Golf Club in Pittsgrove Township, New Jersey, and Valleybrook Country Club in Blackwood, New Jersey.

Arena Football League
In 2003, Jaworski, along with an ownership group that included Bon Jovi members Jon Bon Jovi and Richie Sambora, founded the Philadelphia Soul, an expansion franchise in the Arena Football League. The team began play in the 2004 season, and Jaworski served as the team's president until 2009, when the league went into hiatus due to economic issues. After the league returned in 2010, Jaworski led an effort to bring back the Soul, and the team returned to play for the 2011 season. With the departures Bon Jovi and Sambora as co-owners, Jaworski now served as a majority owner of the team alongside Craig Spencer, who was with the previous ownership group. In 2018, Jaworski was appointed to be the chairman of the league's Executive Committee. Jaworski also helped establish two other teams in the AFL, the Albany Empire in 2018 and the Atlantic City Blackjacks in 2019. He served as a partner owner of both of these franchises, but was not involved in the football operations of the franchises in order to prevent a potential conflict of interest due to his ownership of the Soul. After the 2019 season, however, the league folded, and the Philadelphia Soul, Albany Empire, and Atlantic City Blackjacks each shut down. During Jaworski's time as an executive for the Soul, the team won three ArenaBowl championships (XXII, XXIX, and XXX).

Other ventures
Jaworski is also a published author. In 2010, his first book, The Games That Changed the Game: The Evolution of the NFL in Seven Sundays, was published. The book highlights seven games in NFL history which greatly changed the strategies and tactics used in professional football.

Jaworski was one of the primary investors and advisors for the Elite Football League of India, which was founded in 2011. Other prominent investors in the league included Brandon Chillar, Mike Ditka, Michael Irvin, Mark Wahlberg, and Kurt Warner.

Jaworski runs the Jaws Youth Playbook, a charity foundation that assists at-risk youth in the Delaware Valley.

Personal life
, Jaworski lives in Medford, New Jersey. He and his wife, Liz, have three children.

While Jaworski played for the Eagles, he was friends and next-door neighbors with former Philadelphia 76ers guard Doug Collins. Collins is credited with coining Jaworski's now well-known nickname "Jaws".

title: Ron Jaworski


text:
Wikipedia:Articles for deletion/Canadian National Federation (0th nomination)

Canadian National Federation
Too new to be notable political group--less than 50 displayed hits for "Canadian National Federation" -blind -unions -Rhythmic, and at least some still aren't this particular "group". Also trying to use Wikipedia for self-promotion--note 'see wikipedia' link here. Niteowlneils 19:59, 12 Oct 2004 (UTC)
 * Delete. Not notable. Hint: If Wikipedia is a way for you to get *more* notable, then you're not notable enough to have an article on it. --Improv 20:59, 12 Oct 2004 (UTC)
 * Delete: "New" group that wants...well, everything. We all want freedom and sovereignty and morality...who doesn't?...but maybe not the way you mean it. Geogre 21:18, 12 Oct 2004 (UTC)
 * Delete: The desperation is painful. I'm Canadian and I've never heard of this organisation. User:Rhombus
 * Delete Jayjg 22:37, 12 Oct 2004 (UTC)
 * Delete; as Rhombus, I'm Canadian and know nothing of this group. One expects Canadian National Federation of something. Bearcat 04:53, 13 Oct 2004 (UTC)
 * Delete. Yeah, this is rather pathetic.  I'd recommend adding the basic information to the CAP page (as a footnote), but it doesn't deserve its own site until we're certain this is more than someone's bright new idea.  CJCurrie 03:08, 16 Oct 2004 (UTC)


text:
Talk:Tristan Downe-Dewdney

from VfD:

Founder of non-notable Canadian National Federation (see above), who seems otherwise non-notable--less than 70 displayed hits for Tristan Downe-Dewdney, and several are WP mirrors or other public contribution sites. Niteowlneils 19:59, 12 Oct 2004 (UTC)
 * Delete. Not notable. --Improv 21:00, 12 Oct 2004 (UTC)
 * Delete: Article itself says that the party is minor and that her run for office before was also for a minor party. Her claim, therefore, is hosting a radio show, but no telling whether that is substantial or not. Not notable. Geogre 21:20, 12 Oct 2004 (UTC)
 * Delete. Not notable. Jayjg 22:39, 12 Oct 2004 (UTC)
 * Weak delete. Lots of things of minor notability can add up to real notability, but I don't see it happeneing yet in Tristan's case.  — siro  χ  o  23:37, Oct 12, 2004 (UTC)
 * While you're cleaning up the list of failed candidates for Trinity-Spadina in the past election, please do check out Daniel_Knezetic and David_Watters Krupo 04:39, Oct 13, 2004 (UTC)
 * Keep for now, for the same reasons mentioned on the Knezetic entry. At the very least, the information could be added to the CAP page (as a "spinoff"). CJCurrie 18:03, 14 Oct 2004 (UTC)
 * Keep - SimonP 17:52, Oct 19, 2004 (UTC)

end moved discussion

Article was changed to redirect to Canadian Action Party candidates, 2004 Canadian federal election by this edit after proposed deletion because subject was an "unelected political figure with no properly sourced indication of notability."  PK T (alk)  15:36, 29 December 2010 (UTC)

title: Talk:Tristan Downe-Dewdney


text:
Wessel

Wessel may refer to:

 * Wessel (name), including a list of people with the name
 * Wessel Islands, a group of islands forming part of the Northern Territory, Australia, named after the Dutch ship Wesel in 1636
 * Cape Wessel, the most northerly point of Rimbija Island (itself the northernmost of the Wessel Islands)
 * Wessels plass, a square in Oslo, Norway

title: Wessel


text:
Alexandra Bastedo

Alexandra Lendon Bastedo (9 March 1946 – 12 January 2014) was a British actress, best known for her role as the beautiful secret agent Sharron Macready in the 1968 British espionage/science fiction adventure series The Champions. Bastedo was a vegetarian and animal welfare advocate, and wrote a number of books on both subjects.

Early life
Bastedo was born in Hove, England. Her mother (Liberiana Dorina Rescagliova 1917–2001) was of French, German and Italian descent, while her Canadian-born father (Gilbert Lendon Bastedo 1915–1985) was of Spanish, Dutch, Scottish and native American extraction. She attended Brighton and Hove High School and Brighton School of Drama.

Professional career
Bastedo made her film debut as one of the title characters in William Castle's poorly received 13 Frightened Girls (1963). She gained attention on the European continent, earning her the nickname, "La Bastedo". One of her first appearances in popular culture was in the 1966 film Doctor in Clover where she appears as a young nurse dancing with Sir Lancelot at a party (a non-speaking role).

Although most familiar to viewers of 1960s TV as Sharron Macready in The Champions, she was also known for her language skills, speaking Italian, Spanish, French and German. This ability brought her to the attention of 10 Downing Street, where she was employed to assist with translations, and landed her the role of co-presenter of Miss World competitions with Peter Marshall in the 1980s.

In 1979, she played in the series The Aphrodite Inheritance. In 1988, Bastedo was the cover star for Rank, a live album by British band The Smiths that charted at number 2 on the UK Albums Chart. In 1992, she appeared in "Fat" – the second broadcast episode of Absolutely Fabulous, playing a 1960s model associate of Edina and Patsy. She was seen in two episodes of The Saint series, alongside Roger Moore.

In 2006, Bastedo was reunited for the first time with her co-stars from The Champions to provide commentaries and an interview for a DVD release of the show. Still working as an actress, she appeared in Batman Begins, and touring theatres in 2006 with a production of Beyond Reasonable Doubt alongside Leslie Grantham and Simon Ward. In 2008, she joined the cast of EastEnders, playing Cynthia. In January 2008, she appeared as co-presenter (with Ed Stewart) of "The Magic of Mantovani" at Lighthouse, Poole. The success of this concert led, the following year, to a second concert at the same venue, with the Mantovani Orchestra, which she again co-presented.

Personal life
Bastedo dated David Frost and Omar Sharif, but turned down the advances of Steve McQueen who, she recalled, propositioned her with the line, "My wife doesn't understand me". In the case of Sharif, the liaison lasted only a few weeks because of the actor's bridge-playing, his odd hours and the fact that he took telephone numbers from other women.

Mike Tomkies, the Fleet Street journalist who abandoned the life of a celebrity reporter to live alone in the wilderness, lived with her for a while in Canada, and they talked of marriage, but she was prohibited from marrying by a contract for The Champions (1968 to 69). He said that she was the "most stunningly beautiful creature" he had ever seen.

In 1980, at Chichester Cathedral, Bastedo married Patrick Garland, a director, writer and actor; he became a long-serving director of the Chichester Festival Theatre. Bastedo wrote a memoir, Beware Dobermanns, Donkeys and Ducks, as well as several books on caring for cats and dogs. Her husband died on 19 April 2013.

Animal welfare
Bastedo was a vegetarian and the founder of Alexandra Bastedo Champions (ABC) Animal Sanctuary. In an interview for the BBC television series Where Are They Now? Bastedo provided a glimpse into her private life. She used to be the president of her local RSPCA branch but gave up her position in 2008, to dedicate more time to her fast-growing animal sanctuary at her home in West Chiltington, West Sussex. A journalist who interviewed her husband in 2010 described their domestic surroundings:

"[W]e sit in his Sussex garden looking towards a small lake with a jetty and a battered rowing boat – a perfect pastoral scene which could be a stage set. He lives with his wife, the actress Alexandra Bastedo, who remains startlingly beautiful, a couple of Dobermans, some territorial cats, and a menagerie of horses, donkeys, pigs and goats – Bastedo runs an animal sanctuary. Garland's domain is largely inside the house where he closes doors to keep animals out of rooms lined with 12,000 books."

She was also a patron to a number of animal welfare organisations including Compassion in World Farming, Wildlife Aid Foundation, National Animal Welfare Trust, Greyhounds in Need and Naturewatch.

Death
Bastedo died of breast cancer on 12 January 2014, aged 67, in a hospital in Worthing, England. She was buried at St Mary's Church, Sullington, West Sussex. The service was conducted by her local vicar and friend, Revd Derek Spencer.

Filmography

 * 13 Frightened Girls (aka The Candy Web) (1963) – Alex
 * The Liquidator (1965) – Radio Operator (uncredited)
 * Doctor in Clover (1966) – Nurse at Party (uncredited)
 * That Riviera Touch (1966) – Girl at Roulette Table
 * Casino Royale (1967) – Meg
 * Wedding Night (1970) – Gloria – Girl Friend
 * My Lover, My Son (1970) – Cicely Clarkson
 * This, That and the Other (1970) – Angie
 * The Kashmiri Run (1970) - Henrietta Fleming
 * The Blood Spattered Bride (1972) – Mircalla Karstein
 * I Hate My Body (1974) – Leda Schmidt
 * The Ghoul (1975) – Angela
 * El Clan de los Nazarenos (1975) – Arima
 * Tu dios y mi infierno (1976) – Liselotte
 * Find the Lady (1976) – Victoria
 * The Man Inside (1976, TV movie) – Joan Lytton
 * La Gioconda está triste (1977)
 * El Mirón (1977) – Elena – wife
 * Cabo de vara (1978) - Lola
 * Stigma (1980) – Anna
 * A Choice of Two (1981)
 * Draw! (1984, TV movie) – Bess, Harry's Girlfriend in Bell City / member of acting troupe
 * La veritat oculta (1987) – Agnes / Chiromancer
 * The Byzantine Cat (2002) - Barbara
 * Batman Begins (2005) – Gotham Society Dame

Television

 * The Count of Monte Cristo (TV series, 1964) – Renée de Saint-Méran
 * The Saint (episode "The Crime of the Century", 1965) – Joan Vendel
 * The Scales of Justice (episode "The Haunted Man", 1966) – Laura
 * The Wednesday Play (1966) (TV) – The Girl
 * The Saint (episode "The Counterfeit Countess", 1967) – Mireille
 * The Champions (TV series, 1968–69) – Sharron Macready
 * Call My Bluff as herself, 4 episodes (1969-1975)
 * Randall and Hopkirk (Deceased) (episode "Whoever Heard of a Ghost Dying?", 1969) – Carol Latimer
 * Codename (1970) (TV series) – Diana Dalzell
 * From a Bird's Eye View (episode "Sicillian Affair", 1970) – Lisa Vespucci
 * The Starlost (TV series, 1973), episode 11 "The Astrometrics"
 * The Aphrodite Inheritance (miniseries, 1979) – Helene
 * ''Magnolia Blossom by Agatha Christie, 1982 - Clare Hamilton
 * Legend of the Champions (TV, 1983) – Sharron Macready
 * Absolutely Fabulous (episode "Fat", 1992) – Penny Caspar-Morse
 * EastEnders (2008–2009) – Cynthia (final television appearance)

Radio

 * Halloween Party by Agatha Christie, BBC radio 1993
 * Five Little Pigs by Agatha Christie, BBC radio 1994
 * Elephants Can Remember by Agatha Christie, dramatised by Michael Bakewell, BBC radio 2006

title: Alexandra Bastedo


text:
Category:Minas Gerais

.
 * Minas Gerais — the Brazilian state located in the of Brazil.

title: Category:Minas Gerais


text:
Television presentation

Television presentation refers to the way in which television stations present themselves between programs.

It has become increasingly important in the recent multichannel television environment for television stations to create an attractive and distinct on-air appearance, through the various elements that form the 'television presentation' umbrella. These include idents, the short clips that are often shown before a program on many stations. They often consist of an animated form of the station's logo, and many have a continuity announcer who speaks over the clip with information about programs on the station. Some stations, such as BBC One in the UK have used live action idents since 1997. This approach however is less common. Other elements include digital on-screen graphics (DOGs) and End Credit Promotions (ECPs). Computerised graphics have been popular since BBC Two introduced the world's first computer-generated television identification in the summer of 1979. Less than three months later, American broadcaster NBC introduced their first computerised graphics.

There have been several examples of television presentation choices less popular with viewers. In 2002, the new controller of BBC One, Lorraine Heggessey, deemed the package which had been in place since 1997 too "slow and distant". The old package consisted of a hot air balloon with an image of the earth printed on it flying over various landmarks across the UK. The package was unique and certainly popular with viewers. Again, it was a rare example of ordinary people recognising and identifying with a channel's on-air look. Heggessey instead wanted to introduce a set of idents showing people of various cultural backgrounds dancing in different ways.

The style was ridiculed by many, including the BBC's own animated satire Monkey Dust, whose spoofs of the idents included two men engaging in anal sex, and Channel 4's digital channel E4, who spoofed it in a set of their own idents and it also was identified by the public for the wrong reasons.

In the United States, cable channel MTV changes its presentation every few months. However, since its inception, the logo (the letter "M" with "tv" on the lower right side) has always remained the same.

In Japan, the state's public broadcaster NHK has set up an institute, the NHK Broadcasting Culture Research Institute, to preserve historical TV and radio presentations within the country, as well as researches of Japanese broadcasting presentations throughout the years.

title: Television presentation


text:
Howard Saunders

Howard Saunders (16 September 1835 – 20 October 1907) was a British businessman, who later in life became a noted ornithologist, specialising in gulls and terns.

Life and work
Saunders was born in London on 16 September 1835. He received his early education at Leatherhead and Rottingdean. He entered business as a merchant banker, which allowed him to travel widely. From 1855 to 1862 he travelled in Brazil and Chile.

After 1862 Saunders devoted himself to the study of the birds of Spain. He published several articles on the subject in The Ibis, having visited the Pyrenees in 1883 and 1884. He also published articles on the birds of Switzerland in 1891, and an account of The Distribution of Birds in France in 1893. He was the co-editor with P. L. Sclater for The Ibis in 1883–1886 and 1895–1900.

Saunders was an expert on gulls and terns. Among other duties, he wrote about the gull specimens from the Challenger expedition of 1872–1876.

Saunders served as secretary of the British Ornithologists' Union from 1901 to 1907, and first secretary and treasurer of the British Ornithologists' Club. He was also an active member of the Zoological, Linnean and Royal Geographical Societies.

Ornithological publications
In 1869 his first article on the birds of Spain was published in The Ibis.

In 1872 he described a new species of green woodpecker, the Iberian green woodpecker, that inhibits the Iberian Peninsula. He called it Gecinus sharpii (now Picus sharpii), after the name of its discoverer, Richard Bowdler Sharpe (1847-1909).

In 1889 the first edition of the Illustrated Manual of British Birds was published. It was issued in twenty parts in 1888 and 1889. In The Zoologist of 1888 appeared a 'notice' about parts i-iv.

Ten years later a second edition appeared. The third edition was published twenty years after the death of Saunders and was revised and enlarged by William Eagle Clarke.

Legacy
Two species of birds have been named after him:
 * Saunders's gull
 * Saunders's tern

title: Howard Saunders


text:
User:Redfox379

Redfox379 has the goal of both writing biographies for every single signifigant character in Romance of the Three Kingdoms and writing the articles about every single band Scott Avery and his band members have been in. Now that it has been cleaned up, his proudest achivements are the Klank and Celldweller articles, whcih he hopes to soon expand upon. He hopes you wish him luck, cuz he's gonna need it pretty bad.

title: User:Redfox379


text:
Iris Tree

Iris Tree (27 January 1897 – 13 April 1968) was an English poet, actress, and art model, described as a bohemian, an eccentric, a wit, and an adventurer.

Biography
Iris Tree's parents were actors Sir Herbert Beerbohm Tree and Helen Maud, Lady Tree. Her sisters were actresses Felicity and Viola Tree. An aunt was author Constance Beerbohm, and her uncles were explorer and author Julius Beerbohm and caricaturist and parodist Max Beerbohm.

Iris was sought after as an art model while a young woman, being painted by Augustus John, simultaneously by Duncan Grant, Vanessa Bell, and Roger Fry, and sculpted by Jacob Epstein, showing her bobbed hair (she was said to have cut off the rest and left it on a train) that, along with other behavior, caused much scandal. The Epstein sculpture is displayed at the Tate Britain. She was often photographed by Man Ray, was friends with Nancy Cunard for a time, and acted alongside Diana Cooper in the mid-1920s.

Iris studied at the Slade School of Art. She contributed verse to the 1917 Sitwell anthology Wheels; her published collections were Poems (1919), The Traveller and other Poems (1927), and The Marsh Picnic (1966).

She married twice. Her first marriage was to Curtis Moffat, a New York artist; Ivan Moffat, the screenwriter, was their son. She came to America to act in Karl Vollmöller's play The Miracle in 1925, and there met her second husband, the actor and ex-officer of the Austrian cavalry, Count Friedrich von Ledebur. The two roamed around California, gypsy style, with their son, then moved back to Europe where they were involved in the Chekhov Theatre Studio. They both appeared (after their divorce) in the 1956 film version of Moby Dick. She also appeared as a poet, essentially as herself, in Federico Fellini's La Dolce Vita (1960).

title: Iris Tree


text:
Humberto Fernández-Morán

Humberto Fernández-Morán Villalobos (18 February 1924 – 17 March 1999) was a Venezuelan research scientist born in Maracaibo, Venezuela, known for inventing the diamond knife or scalpel, significantly advancing the development of electromagnetic lenses for electron microscopy based on superconducting technology, and many other scientific contributions.

Career
Fernández-Morán founded the Venezuelan Institute for Neurological and Brain Studies, the predecessor of the current Venezuelan Institute for Scientific Research (IVIC). He studied medicine at the University of Munich, where he graduated summa cum laude in 1944. He contributed to the development of the electron microscope and was the first person to use the concept of cryo-ultramicrotomy. After flying over Angel Falls in his home country of Venezuela he was inspired by the concept of the smoothly reoccurring flow system inherent in a waterfall to take his diamond knife invention and combine it with an ultramicrotome to dramatically improve the ultra-thin sectioning of electron microscopy samples. The ultramictrotome advances the rotating, drum-mounted specimen sample in such small increments (utilizing the very low thermal expansion coefficient of Invar) past the stationary diamond knife that sectioning thicknesses of several Angstrom units are possible. He also helped to advance the field of electron cryomicroscopy - the use of superconductive electromagnetic lenses cooled with liquid helium in electron microscopes to achieve the highest resolution possible - among many other research topics.

Fernández-Morán was commissioned in 1957 with the supervision of the first Venezuelan research nuclear reactor, the RV-1 nuclear reactor, one of the first in Latin America.

He was appointed Minister of Education during the last year of the regime of Marcos Pérez Jiménez and was forced to leave Venezuela when the dictatorship was overthrown in 1958. He worked with NASA for the Apollo Project and taught in many universities, such as MIT, University of Chicago and the University of Stockholm.

He donated a collection of his papers to the National Library of Medicine in 1986.

Personal life
His wife Anna was Swedish and together they had two daughters, Brigida Elena and Verónica.

The body of Humberto Fernández-Morán was cremated and his ashes rest today in Cemetery The Square Luxburg-Carolath in his hometown, Maracaibo.

Inventions

 * Diamond knife
 * Ultra microtome

Awards and honors

 * 1967, the John Scott Award, for his invention of the diamond scalpel.
 * Knight of the Order of the Polar Star
 * Claude Bernard Medal, University of Montreal
 * Cambridge annual Medical Prize

title: Humberto Fernández-Morán


text:
Urchin

Urchin or urcheon is the Middle English term for "hedgehog". It may refer to:

Common meanings

 * Street children, homeless children
 * Sea urchins, spiny sea creatures

Arts and entertainment

 * Urchin (band), a band led by Dave Murray and Adrian Smith of Iron Maiden
 * Urchin (album), a 1998 album by Inga Liljeström
 * Urchin (film), a 2007 film about a homeless boy living underground, by John Harlacher
 * Urchin, the squirrel protagonist in The Mistmantle Chronicles book series
 * Urchin, an enemy in the 1990 video game Super Mario World
 * Urchin (Dungeons & Dragons), a type of monster in the Dungeons & Dragons role-playing game
 * "Urchin", a song by Arca from Arca

Other uses

 * HMS Urchin, five ships of the British Royal Navy
 * Urchin Software Corporation, a US web analytics company owned by Google
 * Urchin (software), a series of web analytics developed by the Urchin Software Corporation (now Google Analytics)
 * Urchin (detonator), code name for the device that triggered the detonation of the earliest plutonium atomic bombs
 * The Urchins, English hooligan firm associated with Liverpool F.C.
 * Urchin Rock, off the coast of Graham Land, Antarctica

title: Urchin