text:
Talk:Atiśa

Naming Issue
I want to point out that in his native Bangladesh, "Atisha" is actually spelled "Atish", the extra "a" added to the end is somewhat of a mistake in English transliteration. Also, his full name is Atish Dipankar. So, I propose to move this article to "Atish Dipankar" and have a redirect in "Atish". Thanks. --Ragib 00:48, 15 Jun 2005 (UTC)

 * Which name s more common across the Buddhist world? We are dealing with an international Buddhist figure who was active in three contemporary nations. If, for instance, Atisha is a Sanskrit form I'd argue it should be retained with a mention of the Bangladesh form.

 * I think the transliteration is similar to Ram being written as Rama, the extra "a" being added by the Europeans. I also do think that the buddhist population in Bangladesh as well as other countries of South Asia use the correct form of pronounciation. Bengali language is derived from Sanskrit, so I do not see any reason why his name would be spelt differently in Sanskrit. It is the English translations that add the extra "a", making the illusion of the Sanskrit name having it. Thanks. --Ragib 15:59, 16 Jun 2005 (UTC)

 * In fact, there was such phenomenon as Schwa deletion in Indo-Aryan languages. But in sanskrit the correct form of pronunciation is Rama, Atisha, not Ram and Atish as in modern Bengali and Hindi. 80.250.56.174 (talk) 20:00, 11 February 2017 (UTC)

Ok, I have a question for anyone with a Tibetan or Buddhist background, was the name "Atisha" a title or name given to him by Tibetans? I'm now confused whether the name "Atisha" was his name from his early days (in which case my arguments above would be ok), or a sanskrit prefix or title or given name taken later (in which case the Sanskrit or Tibetan pronounciation should take the upper hand). I'm pretty sure that Dipankar was his name given from birth or early days in Bengal, but I'm not sure of "Atisha". Thanks. --Ragib 09:21, 17 Jun 2005 (UTC)

 * Hi Ragib, I can find a definitive answer for you, but it will take time. I am pretty sure the appelation "Atisha" came with him from India. His birth name was Candragarbha (excuse me for leaving out the diacritics). After receiving initiation from Rahulagupta, he was given the secret name "Jnanaguhyavajra", and at ordination received the name "Sri Dipamkarajnana" from Silaraksita. Dipamkara was not an unusual name for a monk, and so it is quite possible that he was nick-named Atisha in order to distinguish him. (20040302 09:04, 4 October 2005 (UTC))

 * I changed to common way of speaking otherwise people get confused. It is used to say Atisha and Dipankara or Dipamkara. Also I moved the literature of "Joyful Path" by Geshe Kelsang Gyatso, because this is no text of Atisha or similar to Atishas root text and put a commentary on the article which is based upon Atishas teaching of Lamrim. Kt66 00:16, 4 October 2005 (UTC)

Arrival in Tibet
I changed the section. Why there was added: "in order to help him raise money to build a large statue of Manjuśri." The point was that King Langdarma destroyed Buddhism and Yeshe O felt to revive the teachings, so he needed a high master, not someone who can raise money and build a statue. Allthough this can be a minor point of that invitation. Kt66 10:02, 6 May 2006 (UTC)

 * I think this portion of the article is one that should perhaps acknowledge that there are differing perspectives on this from one lineage to the next. Specifically, I've seen some Gelugpas assert that Atisha brought Buddhism to Tibet, with no quarter given to Padmasambhava at all. On the other hand, many Nyingma presentations of Buddhist history would never agree that "King Langdarma destroyed Buddhism." Repressed and endangered it, yes, but Nyingmapas are (understandably) very sensitive to the suggestion that Buddhism was entirely corrupted by the time Atisha arrived. Sylvain1972 13:44, 8 May 2006 (UTC)

Suvarnadvipa
Hi Ragib, thank you very much for this nice article on Atisha. Just as a addition I want to mention - but this is perhaps not that important: Suvarnadvipa is known by different names, like "Serlingpa the master from Sumatra" or "Dharmakirti". Kt66 14:49, 4 October 2005 (UTC)

birth place
which source says Atisha was born in the village Vajrayogini? it sounds like added later by tibetan buddhism history or teachers. what is the source for this? Kt66 19:19, 27 October 2005 (UTC)
 * OK I saw at: http://banglapedia.search.com.bd/HT/D_0238.htm ist the note... Kt66 22:23, 29 October 2005 (UTC)

Copyright problem removed
Prior content in this article duplicated one or more previously published sources. The material was copied from: http://www.banglapedia.org/HT/D_0238.HTM. Copied or closely paraphrased material has been rewritten or removed and must not be restored, unless it is duly released under a compatible license. (For more information, please see "using copyrighted works from others" if you are not the copyright holder of this material, or "donating copyrighted materials" if you are.) For legal reasons, we cannot accept copyrighted text or images borrowed from other web sites or published material; such additions will be deleted. Contributors may use copyrighted publications as a source of information, but not as a source of sentences or phrases. Accordingly, the material may be rewritten, but only if it does not infringe on the copyright of the original or plagiarize from that source. Please see our guideline on non-free text for how to properly implement limited quotations of copyrighted text. Wikipedia takes copyright violations very seriously, and persistent violators will be blocked from editing. While we appreciate contributions, we must require all contributors to understand and comply with these policies. Thank you. —Darkwind (talk) 22:33, 9 January 2013 (UTC)

Similar to Gautama Buddha, Atiśa was born into royalty
All Buddhist traditions agree that Gautama Buddha was a Sakya, and Sakya was a sub-Himalayan ethnicity and clan, with an oligarchic government and Buddha's father was probably an elected chieftain or oligarch, not a king. The sutras stating Buddha's royal origin were produced after the end of the first century BC. Mirrordor (talk) 23:15, 2 March 2023 (UTC)

Birthplace
Since, after edit warring here, you refused to start a discussion even after (WP:3RR) I will. Now looking clearly at the article, there is no source in the article which mentions Bikrampur as his birthplace; I added one with better detail from Banglapedia. Moreover the assertion that he was a descendant of Kalyanachandra and Srichandra is completely WP:OR, and I will be removing that. Gotitbro (talk) 10:40, 3 January 2024 (UTC)

 * His birthplace has no speculation in here, his birth date is disputed. Please abstain editing from topics related to Bengal if your not a Bengali or did not research properly upon Bangladesh or West Bengal 2607:FEA8:571E:8E00:4D18:6433:9FDB:5B51 (talk) 01:16, 6 January 2024 (UTC)

 * Your editing is in clear violation of the block. As far as this is concerned - Please abstain editing from topics related to Bengal if your not a Bengali or did not research properly upon Bangladesh or West Bengal, - Anyone can edit nearly any page and improve articles immediately. You cannot make your own rules here. See WP:OWN. - Fylindfotberserk (talk) 10:53, 6 January 2024 (UTC)

title: Talk:Atiśa


text:
Wikipedia talk:Requests for comment/RexJudicata

Proof of sockpuppetery
To make it easier to find later, copying from Administrators' noticeboard/Incidents:

Found it. I knew I had written about it somewhere... It's on the Administrator noticeboard's history. Quoting myself (see the link for the replies and the context):

 * I believe that Agwiii (talk · contributions) and RexJudicata (talk · contributions) are the same person. See and  and . --cesarb 22:16, 10 Apr 2005 (UTC)
 * ...and this shows the beginning of the history; looks like he started as a POV pusher on the Abortion article. SqueakBox (talk · contributions) starts reverting him, and he gets more and more agressive with each reversion. --cesarb 22:21, 10 Apr 2005 (UTC)

--cesarb 00:44, 15 Jun 2005 (UTC)

Legal threats
This looks like one. --cesarb 12:17, 16 Jun 2005 (UTC)

Ideally this talk page should not be deleted. According to Rfc page rules the Rfc against Rex should be deleted, SqueakBox 18:29, July 26, 2005 (UTC)

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


text:
Wikipedia:Articles for deletion/Lin kuei

 This page is an archive of the proposed deletion of the article below. Further comments should be made on the article's talk page, if it exists; or after the end of this archived section. The result of the debate was no consensus. Mackensen (talk) 16:21, 25 Jun 2005 (UTC)

Lin kuei
Fiction masquerading as fact, fancruft from the mortal combat domain -- pcrtalk 00:49, 15 Jun 2005 (UTC)
 * also Lin Kuei which appears to be a duplicate -- pcrtalk 00:54, 15 Jun 2005 (UTC)

 * Delete both as severe fancruft. It was difficult to tell until they mentioned Sub-Zero, et al. Mr Bound 02:00, Jun 15, 2005 (UTC)
 * Delete. Most of it is just fancruft. However, the term Lin Kuei does exist in the Mortal Kombat series. So unless it's trivial, a rewrite is also good. Nestea 03:39, 15 Jun 2005 (UTC)
 * delete. also a copyvio (although the page is not available, this is the google cache). Brighterorange 03:42, 15 Jun 2005 (UTC)
 * Weak Keep. This can be turned from fiction masquerading as fact by simply placing at the beginning, "In the mythology of the Mortal Kombat series of video games, ..." Copyvio is a different problem, but fixable, and not one for vfd. -- BD2412 talk 04:18, 2005 Jun 15 (UTC)
 * Eh, I fixed it a bit - made it clear that it's fiction, and BOLDLY REDIRECTED the original page to the properly capitalized one (since they were duplicates, no harm, no foul). I have no desire to fight to keep this, tho - once the copyvio is scratched out, there may be only enough left to merge into some character article. Cheers. -- BD2412 talk 04:26, 2005 Jun 15 (UTC)
 * Delete non notable fancruft. JamesBurns 06:35, 15 Jun 2005 (UTC)
 * Keep, important to Mortal Combat fans. Kappa 11:21, 15 Jun 2005 (UTC)
 * Keep Lin Kuei, though obviously if it's copyvio then will need a re-write. - Lochaber 11:31, 15 Jun 2005 (UTC)
 * Merge as per WP:FICT. Martg76 21:54, 15 Jun 2005 (UTC)
 * keeep this too please Yuckfoo 18:09, 16 Jun 2005 (UTC)

 * I edited it a LOT. I kept all the previous information (let's call it "BS") in the bottom two sections, with a note that says it's disputed.  If somebody can point to a source (for instance, MK: Defenders of the Realms or some such), then that'd be fine, but as it was, it sucked.  The other sections now come straight from the games, except where noted.  It's very complete, though maybe somebody could find a better word for "roboticization", as it currently links to a site from Sonic the Hedgehog :-) As for keeping, I say Keep if only because of the time I spent on it (cross-referencing as necessary).  While Sub-Zero's page has some similar info, I think focusing on the group has an interesting angle (especially if future games delve into it more).

 * Keep. — J3ff 02:02, 20 Jun 2005 (UTC)
 * Keep. Now that its been made clear that it's about Mortal Kombat. -- Crevaner 04:57, 24 Jun 2005 (UTC)
 * Keep. There's tonnes of this stuff about various computer games, this is no less notable than most of it Stephen 12:14, 25 Jun 2005 (UTC)
 * ''The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be placed on a related article talk page, if one exists; in an undeletion request, if it does not; or below this section.


text: Talk:Ten (Y&T album)

title: Talk:Ten (Y&T album)


text:
Talk:RC circuit

Why there is a phase shift between the current and voltage in a capacitor
(an intuitive explanation by using hydraulic analogy)

IMO it would be interesting to see the correspondence below between me and a curious web reader about the phase shift phenomenon in capacitors driven by AC. Circuit dreamer (talk, contribs, email) 09:38, 26 June 2011 (UTC)

QUESTION: Im having a really hard time trying to understand what the phase shifts mean in real life in a circuit (I know it means current lags source voltage by X amount..but how). I understand them mathematically but not in physicality, mainly because I cant find any explanation.

ANSWER: Let's explain for now the 90 deg phase shift between current and voltage in a capacitor. I recommend to you to think "hydraulically" ("electrical current - water flow" and "voltage - water level") to understand intuitively the phase shift idea.

Well, imagine you fill (sinusoidally) a vessel with water and you picture graphically this process. Choose the half of the maximum water height as a zero level (ground). So, you first open and then close (sinusoidally) the supply faucet. But note no matter you close the faucet (in the second part of the process) the level of the water will continue rising; it is strange that you close the faucet but the water continue rising. Finally, you have completely closed the faucet (zero current), but the level of the water will be maximum (maximum voltage).

Now, at this point, you have to change the flow (current) direction to make the water level decrease. For this purpose, you open and then close another faucet at the bottom to draw the water (now you draw current from the capacitor). But again, no matter you close the faucet the level of water will continue falling; it is strange again that you close the faucet but the water continue falling. Finally, you have completely closed the faucet (zero current), but the level of the water will be maximum negative (maximum negative voltage).

So, the basic idea behind all kind of such storing elements (named integrators) is:

The sign of the output pressure-like quantity (voltage, water level, air pressure, etc.) can be changed only by changing the direction of the input flow-like quantity (current, water flow, air flow, etc.); it cannot be changed by changing the magnitude of the flow-like quantity. At this point, the current is zero but the voltage is maximum; this gives the 90 phase shift on the graph.

Circuit dreamer (talk, contribs, email) 09:38, 26 June 2011 (UTC)

QUESTION. ...However, I full understand the phase shift INSIDE the capacitor. That I understand 110%. At the begining there is max current flowing through the capacitor as there is no opposing voltage built up across it. As time goes on the current charges up the capacitor creating a voltage accross it which will then oppose the current. So at max current theres no voltage and at max voltage across it there is no current through it. And thus 90 degree lag....

BUT, what im trying to understand is something slightly different...the bigger picture....total impedance.

So for example, we have a capacitor with reactance of 10 Ohms and a resistor in series of 2 Ohms and an AC source of 10V. The total impedance in the circuit is going to be - Squareroot(10 squared + 2 squared) = 10.198 Ohms at a phase of - inverse tan(-10/2) = -78 degrees. So total impedance = 10.198 Ohms -78 degrees.

So what im trying to work out is WHAT causes this OVERALL lag in the circuit of 78 degrees.

I understand fully the lag inside the capacitor or inductor but when it comes to the overall lag in the circuit, what analogy can be used to discribe THIS lag. What is causing it to be -78 the physical happening of it.

ANSWER. Be patient:)! We will reach the so desired RC phase-shift expalanation (I managed to do this in the early 90's) but let's first explain this phenomenon in the case of the bare capacitor.

As I can see, you have learned very well your lessons about AC supplied capacitors since this is the classic textbook explanation of the phase shift between current and voltage in a "voltage-supplied capacitor". Maybe, it is repeated hundred of thousands or millions times in textbooks through years but it is not the best explanation since this arrangement (AC voltage source driving a capacitor) is just incorrect... You know why - because the current will be unlimited and we have not such huge voltage sources producing current with infinite magnitude. That is why, I have chosen the dual arrangement - a "current-supplied capacitor", to explain why there is an exactlty 90 degree lag. This is the real situation since even real voltage sources have some internal resistance. And what is more important, we will use this arrangement to explain the overall lag (0 - 90 degree) in an RC circuit. So, I suggest to you to repeat my explanations but only in terms of electricity.

Well, imagine we drive the capacitor by a sinusoidal current source. "Current source" means that it produces and passes a sinusoidal current in spite of all. No matter what the voltage (drop) across the capacitor is - zero (empty capacitor), positive (charged capacitor) or even negative (reverse charged capacitor), our current source will pass the desired current with desired direction through the capacitor. This is the difference with your explanation - here the voltage across the capacitor does not impede the current (it impedes but the current source compensates it).

So, until the input current is positive (imagine the positive half-sine wave) it enters the capacitor and its voltage continously increases in spite of the current's magnitude (only the rate of change varies)... Imagine... the current rapidly increases -> slows down -> rapidly decreases... and finally becomes zero. At this moment there is a maximum voltage (drop) across the capacitor.

So, as you have said, "at max voltage across it there is no current through it"...Now the current changes its direction and begins rapidly increasing again ->  slows down -> rapidly decreases... and becomes zero again... and again and again and again...

So, in this arrangement, the phase shift is constant and exactly 90 degree because of the ideal input current source that compensates somehow the voltage drop (losses) across the capacitor.

If you have nothing against Wikipedia, I would like to place our conversation there again. My idea is to provoke wikipedians to discuss this so interesting topic and then to add some intuitive explanations in the intro of the article... to make it more human friendly...

Circuit dreamer (talk, contribs, email) 20:30, 26 June 2011 (UTC)

 * Wikipedia has an article on the Hydraulic analogy that includes a section about the capacitor. For the example in your question, the reactance of the capacitor depends on ("is a function of") frequency so the RC circuit gives the 78 degree lag only at the particular frequency that you don't mention. This page is about improving the RC circuit article and a conversation about intuitive notions about a capacitor in isolation would not be productive. Cuddlyable3 (talk) 15:56, 28 June 2011 (UTC)

 * Thank you for the participation in this so interesting discussion. You are right but my idea is first to consider a bare AC current-supplied capacitor and to explain by intuition why the phase shift is exactly 90 degree and why it does not depend on frequency (the dialog above). Then, in the next dialog, I will consider the simple RC integrating circuit at varying frequency (or different capacitances) and will explain why the phase shift varies as well (depends on frequency). Finally, I will show how to make it not vary again and to stay exactly 90 degree no matter what the frequency is (the basic idea behind the op-amp inverting integrator). It would be great pleasure for me if you and other wikipedians join the discussion. Circuit dreamer (talk, contribs, email) 17:00, 28 June 2011 (UTC)

 * But there is no phase shift across a bare capacitor with no resistance in the loop. The current is virtually infinite and therefore voltage in the capacitor follows the supply voltage exactly, with any change in supply met by a change in charge and voltage in the capacitor instantly, due to the infinite current adding charge in infinitesimal time. Now consider adding a reasonable resistance in series with the capacitor. It will take time for charge to build in the capacitor, so its voltage will lag the applied voltage. Now consider a sinusoidally varying source voltage.  If it varies very slowly, the capacitor charge has time to almost catch up before the source voltage drops to meet the capacitor voltage and the capacitor charge stalls and then drops. If it varies very quickly, the capacitor charge will not have time to catch up at all and will lag by more relative to the source change.  Thus at low frequencies, the voltage lag is relatively small (near 0°) and at high frequencies the lag is relatively large (near 90°). At the limits of 0 frequency and infinite frequency, the voltage phase difference approaches 0° and 90°, respectively. The 'relatively' is important, here, since at high frequencies the time-lag is actually shorter; it's only the phase-lag relative to the source curve that is larger. Also, look at what happens to amplitude. With more time to build, the charge gets larger and the voltage does, too, so the voltage amplitude across the capacitor is larger, and therefore represents more of the total voltage in the circuit. The sum of the capacitor voltage and the resistor voltage is equal to the supply voltage. In terms of a divider circuit when an element holds a larger portion of the total voltage it means that this element has a higher relative impedance. So at low frequencies the impedance of a capacitor is considered to be high. At high frequencies, there is less time for charge to build, so the voltage amplitude across the capacitor is smaller, and thus the capacitor's impedance is considered to be small. 2605:6000:EC07:A400:CD4E:EADE:2B7D:B003 (talk) 20:52, 28 December 2014 (UTC)

Why there is a variable phase shift of 0 - 90 degree in an RC circuit
Let's now consider the ubiquitous RC circuit. First, let's build it. We have already realized that it is incorrect to drive a capacitor directly by a voltage source; we have to drive it by a current source. For this purpose, let's connect a resistor between the voltage source and the capacitor to convert the input voltage to current; so, the resistor acts as a voltage-to-current converter. From another viewpoint, we have built a current source by the input voltage source and the resistor. Let's now consider the circuit operation (I will do it electrically but the hydraulic analogy of communicating vessels is an impressive way to do it as well).

Imagine how the input voltage VIN changes in a sinusoidal manner. In the beginning, the voltage rapidly increases and a current I = (VIN - VC)/R flows from the input source through the resistor and enters the capacitor; the output voltage begins increasing lazy. After some time, the input voltage approaches the sine peak and then begins decreasing. But until the input voltage is higher than the voltage across the capacitor the current continues flowing in the same direction. As above, it is strange that the input voltage decreases but the capacitor voltage continues increasing. Figuratively speaking, the two voltages move against each other and finally meet. At this instant, the two voltages become equal; the current is zero and the capacitor voltage is maximal. The input voltage continues decreasing and becomes less than the capacitor voltage. The current changes its direction, begins flowing from the capacitor through the resistor and enters the input voltage source. It is very interesting that the capacitor acts as a voltage source that "pushes" a current into the input voltage source acting as a load. Before the source was a source and the capacitor was a load; now, the source is a load and the capacitor is a source...

So, the moment where the two voltages become equal and the current changes its direction is the moment of the maximal output voltage. Note it depends on the rate of changing (the frequency) of the input voltage: as higher the frequency is, as low the maximum voltage across the capacitor is... as later the moment is... as bigger the phase shift between the two voltages is... At the maximal frequency, the voltage across the capacitor cannot move from the ground and the moment of current direction change is when the input voltage crosses the zero (the situation is similar to the arrangement of a current-supplied capacitor).

So, in this arrangement, the phase shift varies from zero to 90 degree when the frequency varies from zero to infinity because of the imperfect input current source that cannot compensate the voltage drop (losses) across the capacitor. Circuit dreamer (talk, contribs, email) 03:29, 5 July 2011 (UTC)

 * CD, the point of the response to your dialog above was that this page is for discussing how to improve the article, not for exercises in creative writing. Dicklyon (talk) 05:08, 5 July 2011 (UTC)

 * I think I show just how to improve the introductory AC part of the article by extracting some intuitive explanations (of course, in a more concise and appropriate form) from this discussion. This phenomenon (lag) is extremely interesting but unexplained. It would be better if you, relying on your prestige, join the discussion and involve others in it; at least, you may encourage instead to dispirit me to continue. Circuit dreamer (talk, contribs, email) 05:37, 5 July 2011 (UTC)
 * Prestige is in no way relevant in WP editing. And there's no discussion here.  If you have an idea for something to add to the article, say it, or just add it, and we can discuss when we see it.  Dicklyon (talk) 06:16, 5 July 2011 (UTC)

 * Theoretically, prestige is (should be) no relevant in WP but practically it is pretty substantial... I have known from my bitter WP experience that the most important things for wikipedians are where you are from, where you graduated from and where you work...
 * With this exposition I prepare the ground for adding a material. The problem is that the article is so formal, sterile and remote from real life (written only for PhD or EE:) so that it is difficult to make a smooth transition from such intuitive explanations to the next theory. Circuit dreamer (talk, contribs, email) 10:42, 5 July 2011 (UTC)

We can draw a final conclusion about the AC supplied RC circuit:

Until the input voltage is higher than the voltage across the capacitor the current flows from the input source to the capacitor and the voltage across the capacitor continuosly increases no matter if the input voltage increases or decreases.

Now we can use the acquired here knowledge to explain in such an intuitive way the odd RC "amplifying" circuit above. Circuit dreamer (talk, contribs, email) 10:55, 5 July 2011 (UTC)

How to make the phase shift in an RC circuit exactly 90 degree
Circuit dreamer (talk, contribs, email) 15:00, 5 July 2011 (UTC)

I assume you mean the phast shift from input to output in a series RC circuit with the output taken from across the capacitor. You can have a phase shift of exactly -90 degrees in theory only because it would take one value (w, R, or C) to be infinite. You can get close with a large value for C. For example, with w=1, R=1 and C=1000 the phase shift is -89.94 approximately. In this example the larger the value of C the closer the phase fhit will be to -90 degrees. You can also make either R and/or w large to get the same effect. The problem however is that as C, w, or R gets larger the amplitude gets closer to zero so it may do no good to get close to -90 degrees. Oscillator circuits use RC networks that have phase shifts very different than -90 degrees, for example -45 degees. The phase shift can be calculated from ph=-atan(w*R*C), where w=2*pi*f with f in Hertz, R in Ohms, and C in Farads. MrAL Gx (talk) 17:43, 21 March 2021 (UTC)

PWM averaging
I've removed the following section from the article. It's inserted without context and has a lot of stylistic and editorializing issues, but more than that, it is only tangentially related to the article topic.

SpinningSpark 17:27, 3 August 2021 (UTC)

title: Talk:RC circuit


text:
Cantons of the Ille-et-Vilaine department

The following is a list of the 27 cantons of the Ille-et-Vilaine department, in France, following the French canton reorganisation which came into effect in March 2015:

 * Bain-de-Bretagne
 * Betton
 * Bruz
 * Châteaugiron
 * Combourg
 * Dol-de-Bretagne
 * Fougères-1
 * Fougères-2
 * La Guerche-de-Bretagne
 * Guichen
 * Janzé
 * Liffré
 * Melesse
 * Montauban-de-Bretagne
 * Montfort-sur-Meu
 * Redon
 * Rennes-1
 * Rennes-2
 * Rennes-3
 * Rennes-4
 * Rennes-5
 * Rennes-6
 * Le Rheu
 * Saint-Malo-1
 * Saint-Malo-2
 * Val-Couesnon
 * Vitré


text:
Wikipedia:Articles for deletion/Starfox movie

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was DELETE. jni 08:12, 21 Jun 2005 (UTC)

Starfox movie
Not notable. Vanity. It is a fan made video game movie that hasn't been released yet. It has no relations with Nintendo. The website is quite amateurish with default image manipulation effects. Chill Pill Bill 00:49, 15 Jun 2005 (UTC)
 * Delete Non-canonical. Gotta applaud this level of fan dedication, but an encyclopedia really is not the place for it. Andrew Lenahan - St ar bli nd  01:19, Jun 15, 2005 (UTC)
 * Delete for fanon and WP:NOT crystal ball (just a little bit, though). Mr Bound 01:55, Jun 15, 2005 (UTC)
 * Delete. I agree with Bill. Adun 02:18, Jun 15, 2005 (UTC)
 * Delete. Thunderbrand 04:12, Jun 15, 2005 (UTC)
 * Delete, NN K1Bond007 05:34, Jun 15, 2005 (UTC)
 * Delete wikipedia is not a crystal ball. JamesBurns 06:35, 15 Jun 2005 (UTC)
 * Delete NN, fancruft Lectonar 12:51, 15 Jun 2005 (UTC)
 * Yet another delete. StopTheFiling 18:25, Jun 15, 2005 (UTC)
 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages.  Please do not edit this page .


text:
User talk:BTTNext

Orphaned non-free image File:FM logo colour Med.png
Thanks for uploading File:FM logo colour Med.png. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

Note that any non-free images not used in any articles will be deleted after seven days, as described in section F5 of the criteria for speedy deletion. Thank you. --B-bot (talk) 18:34, 7 December 2017 (UTC)

Orphaned non-free image File:TanenbaumCHAT.jpg
Thanks for uploading File:TanenbaumCHAT.jpg. The image description page currently specifies that the image is non-free and may only be used on Wikipedia under a claim of fair use. However, the image is currently not used in any articles on Wikipedia. If the image was previously in an article, please go to the article and see why it was removed. You may add it back if you think that that will be useful. However, please note that images for which a replacement could be created are not acceptable for use on Wikipedia (see our policy for non-free media).

Note that any non-free images not used in any articles will be deleted after seven days, as described in section F5 of the criteria for speedy deletion. Thank you. --B-bot (talk) 03:42, 15 November 2018 (UTC)

title: User talk:BTTNext


text:
User:Pyrobob

|\/|`/ |\|4|\/|3 15 |>`/120808
To see my blacklist go to gcawley.junker.org click on Pyrobob's blacklist

Started Articles
bug zapper

ceti eel

title: User:Pyrobob


text:
Chiniot

Chiniot  (Punjabi, Urdu: چنیوٹ) is a city and the administrative headquarters of Chiniot District in the province of Punjab, Pakistan. Located on the bank of the river Chenab, it is the 28th largest city of Pakistan. It is also known for its intricate wooden furniture, architecture, and mosques, and is home to the Omar Hayat Mahal.

Early
The origins of Chiniot are obscure, and historical records accurately detailing its founding are unavailable. According to some accounts, the city was founded by an ancient king's daughter named Chandan, who while on a hunting expedition, was charmed by the surrounding area, and ordered the construction of the settlement of Chandaniot, alternatively spelt Chandniot, which was named in her honour. The name Chiniot, a contracted version of the original name, eventually gained favour, though the older name had been used up until at least the 1860s.

Mughal
During Mughal rule, Chiniot was governed as part of the subah, or province, of Lahore. The city reached its zenith during the reign of Mughal Emperor Shah Jahan, and his governor of the area, Nawab Sadullah Khan of the Thahim tribe, who served between 1640 and 1656. Under Sadullah Khan's governorship, Chiniot's famous Shahi Mosque was built. Chiniot's artisans were renowned for their skill during the Mughal era, and were employed in the decoration of the Taj Mahal, and Lahore's Wazir Khan Mosque.

Mughal decline and Sial rule
Following the collapse of Mughal authority after the death of Emperor Aurangzeb in 1707, the local Sial tribe, a tribe of Zamindar status, under the rule of Walidad Khan was officially granted governorship of the area on account of Khan's loyalty to the Delhi throne. Though nominally a part of the declining Mughal realm, Walidad Khan forged a largely independent state in western Punjab that controlled the region between Mankera and Kamalia. Chiniot suffered heavily during the Durrani invasion of the late 1748.

Sikh
The Sial state around Chiniot was encroached upon by Sikh chieftains in the north, and by Multani chiefs in the south, before coming under the control of the Bhangi Misl Sikhs by 1765. The Sikhs imposed an annual tribute on the Sial chief, Inayatullah Khan, which he ceased paying in 1778 before also capturing Chiniot. He died in 1787, though the city had reverted to Bhangi Sikh rule before his death.

The city suffered during the Sikh Misl states period in which the city region's Bhangis battled the Sukerchakia Misl. Chiniot was captured by Ranjit Singh in 1803, and thereafter became part of the Sikh Empire. The city was invested in Sial chief Ahmad Khan, who promised to pay tribute to Ranjit Singh's kingdom. Khan stopped paying tribute, and briefly seized full control of the region in 1808, but was decisively defeated by Ranjit Singh's forces in 1810.

British
The city came under British rule by 1849, and the city was constituted as a municipality in 1862. In 1875, the city's population was 11,999. During the British period, a vast network of canals was laid to irrigate Punjab, resulting in the creation of many new "canal colonies" around Chiniot. Chiniot's famous Omar Hayat Mahal was built between 1923 and 1935 for a businessman who made his fortune in Calcutta.

Location
Chiniot is at the intersection of the Faisalabad-Sargodha and Lahore-Jhang roads. It is 158 km northwest of Lahore and 38 km north of Faisalabad. Chiniot city is spread over an area of 10 sqkm with an average elevation of 179 m.

Rabwah city, the headquarters of the Ahmadiyya Community is on the other side of the Chenab River. In the center of river a worship center (or Chilla Gah) of the Sufi Bu Ali Shah Qalandar is located.

Topography
Chiniot city lies on left bank of the Chenab River, and is located on a small rocky hill. Much of the surrounding area consists of alluvial plains, interspersed with rocky outcroppings of slate and sandstone that reach up to 400 feet in height around Chiniot.

Climate
Chiniot has a hot semi-arid climate (Köppen climate classification BSh). The weather in Chiniot is variable.

Demographics
According to the 1998 census, the population of Chiniot Tehsil was 965,124 (included urban 172,522). According to the 2017 Census of Pakistan, the city has the population of 278,747. The language spoken is Punjabi.

Economy
The important products of Chiniot includes silk, cotton, wheat, sugar, rice, milk, pottery, wooden furniture, etc. The city's agricultural economy is largely derived from "canal colonies" established during British rule when a vast network of canals were laid to irrigate Punjab.

Chiniot is famous for his wooden furniture, and developed as a centre of woodworking given its close proximity to the Chenab River - as timber from Kashmir would be floated down the river towards Chiniot. Chiniot's artisans are renowned for their skill, and were employed in the construction of both the Taj Mahal and Wazir Khan Mosque. The city's metalworkers, along with those of Lahore, were considered the best in Punjab during the British period, and Chinioti designs and were considered superior to those of Hoshiarpur or Jalandhar. Ramzan Sugar Mills is located at Faisalabad Road.

Education

Educational institutions in Chiniot include
 * Allama Iqbal Model School, Chiniot
 * Chenab College, Chiniot
 * Govt Al Islah High School, Chiniot
 * Govt High School Inayatpur, Chiniot
 * Govt High School Salara, Chiniot
 * Govt Islamia College, Chiniot
 * Govt Islamia High School, Chiniot
 * Govt Primary School, Shareen Awan Chiniot
 * Govt Mudrassa-tul-Banat High School, Chiniot
 * Khatam e Nabuwat Institute of Modern Sciences (KIMS) College, Chiniot
 * Masoomeen Foundation High School, Chiniot
 * Masoomeen School and College, Chiniot
 * National University of Computer and Emerging Sciences (NUCES)
 * Punjab College, Chiniot
 * Superior College, Chiniot
 * Tips College, Chiniot
 * Unified P/G Science College, Chiniot

Libraries
After his death, Sheikh Omar Hayat's palace Omar Hayat Mahal was converted into a library by the Government of Pakistan.

Transport and communication
Chiniot is connected with the rest of Pakistan by a main highway and rail line. The nearest international airport is Faisalabad International Airport, which is 48.5 km from Chiniot.

Islamic occasions
In Chiniot people celebrate Islamic occasions with great arrangements. On 12 Rabi' al-awwal, 1440th birthday celebration of the Islamic Prophet Muhammad, people of Chiniot arranged a 63-maund cake, one of the largest cakes in the world.

Furniture
Chiniot is known for its furniture. Chinioti craftsmen and artisans have for centuries carved flowers and geometric patterns onto cellulose fibres. Masons from Chiniot are thought to have been employed during the construction of the Taj Mahal and Golden Temple.

Sport
Cricket is the most popular sport in Chiniot. Football is also played here. Other popular sports include hockey, volleyball, basketball, badminton, tennis, kabbadi, and horse racing.

Notable people

 * Ilyas Chinioti, Politician (Member of Provincial Assembly, Punjab)
 * Manzoor Ahmad Chinioti, father of Ilyas Chinioti
 * Nasir Chinyoti, a famous stage drama comedy actor
 * Saadullah Khan, Mughal Grand Vizier
 * Wazir Khan, a court physician in Mughal Empire, famous for the Wazir Khan Mosque, Lahore
 * Muhammad Masood Lali, Politician (Member of Provincial Assembly, Punjab)
 * Mian Muhammad Mansha, Prominent Businessman, owner of the MCB Bank Limited and Nishat Group
 * Syed Hassan Murtaza, Politician (Member of Provincial Assembly, Punjab)
 * Muhammad Nawaz, Former Director General of Pakistan Rangers (Punjab)
 * Syed Anayat Ali Shah, politician (MNA)
 * Qaiser Ahmed Sheikh, politician and former President of Karachi Chamber of Commerce and Industry
 * Saqlain Anwar Sipra, politician in Bhawana

title: Chiniot


text:
Oklahoma Bankers Association

The Oklahoma Bankers Association (OBA) is a trade association based in Oklahoma City, representing more than 220 member banks. It has been running for over one hundred years. It assists its members with government relations, educational programs, and other products and services. Roger M. Beverage serves as the president and CEO.

title: Oklahoma Bankers Association


text:
Wikipedia:Articles for deletion/Naruto.no

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was keep due to no consensus. There are nine delete votes, and eight keep votes, but one of those is from an entirely new user who's first edit was to vote on this VFD, and it is discounted. Still 9-7 is not a sufficient consensus to delete. Sjakkalle (Check!)  14:52, 21 Jun 2005 (UTC)

Naruto.no
Non-notable website — J3ff 00:52, 15 Jun 2005 (UTC)
 * Delete. wikipedia is not a website directory. Website has alexa ranking of 576,606. Frankchn 02:09, 15 Jun 2005 (UTC)
 * Delete website advertising. JamesBurns 06:36, 15 Jun 2005 (UTC)
 * Delete nn, spam. the wub (talk) 09:52, 15 Jun 2005 (UTC)
 * Delete. Website vanity. Sarg 14:43, 15 Jun 2005 (UTC)
 * Keep. Naruto.no is probably the biggest Norwegian anime-related community to date, and consists of more than the web site in itself. At any rate, the article seems no less relevant than the one concerning the Something Awful forums. Ninuor 21:37, 16 Jun 2005 (UTC)
 * Keep good enough for me, Ninuor. SchmuckyTheCat 03:58, 17 Jun 2005 (UTC)
 * Keep as per Ninuor. — Instantnood 04:14, Jun 17, 2005 (UTC)
 * Keep What Ninuor said. Besides if you follow Alexa, naruto.no has gone up 2,054,508. Havok 07:46, 17 Jun 2005 (UTC)
 * Isn't that, like, down instead?  Grue   17:28, 18 Jun 2005 (UTC)
 * It's ranked 600,261 right now. To put it in perspective, Norway's biggest gaming store is ranked 858,772. I'm just saying that Alexa shouldn't have anything to do with this. Havok 17:33, 18 Jun 2005 (UTC)
 * Delete Alexa ranking is ridiculously low for that kind of site.  Grue   17:45, 17 Jun 2005 (UTC)
 * Keep I agree with Ninuor. Sketchu 22:07, 17 Jun 2005 (UTC)
 * Weak keep. Pavel Vozenilek 23:41, 17 Jun 2005 (UTC)
 * Keep NSR 14:47, 18 Jun 2005 (UTC)
 * Delete per trivially low Alexa rank. This says something about the other Norwegian anime-related communities. Radiant_ >|< 21:57, Jun 18, 2005 (UTC)
 * "The traffic rank is based on three months of aggregated historical traffic data from millions of Alexa Toolbar users and is a combined measure of page views and users (reach)." I just find it hilarious that you guys find it a problem with this article being on Wiki. Also that you so blindly follow Alexa. It's not saying much about the anime community in Norway, since I really doubt many norwegians use the Alexa Toolbar. Havok 00:50, 19 Jun 2005 (UTC)
 * Delete Per Radiant. Andrew Lenahan - St ar bli nd 01:31, Jun 19, 2005 (UTC)
 * Delete. -Sean Curtin 20:12, Jun 19, 2005 (UTC)
 * Keep. -- Jerry Crimson Mann 15:25, 20 Jun 2005 (UTC)
 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages.  Please do not edit this page .


text:
Phillip DeFreitas

Phillip Anthony Jason "Daffy" DeFreitas (born 18 February 1966) is an English former cricketer. He played county cricket for Leicestershire, Lancashire and Derbyshire, as well as appearing in 44 Test matches and 103 ODIs. Cricket writer Colin Bateman noted that "DeFreitas was an explosive hitter when the mood took him, an aggressive pace bowler, inclined to pitch everything short and a spectacular fielder". He was a part of the English squad which finished as runners-up at the 1987 Cricket World Cup and as runners-up at the 1992 Cricket World Cup.

DeFreitas is the only player in the history of the County Championship to take a five-wicket haul against each of the 18 first-class counties.

Early career
DeFreitas went to Willesden High School, in Willesden, London, where he played football and cricket. He had trials at Luton Town F.C., but although offered an apprenticeship, wanted to play cricket.

Domestic career
DeFreitas made his first-class debut for Leicestershire in 1985 against Oxford University and recorded the startling bowling analysis of 3.4–2–3–3 as the students collapsed to a humiliating 24 all out. The following year he had a wonderful season, taking what was to remain a career high of 94 wickets and scoring his maiden century (at number 9) against Kent, and he was selected for the successful Ashes tour in 1986/87.

In the course of his 21 seasons in first-class cricket, DeFreitas had a somewhat nomadic county career, playing for Leicestershire from his debut in 1985 until 1988, then Lancashire from 1989 to 1993, and Derbyshire from 1994 to 1999. In 2000, he returned to Leicestershire, averaging over 45 with the bat that season, and captained the side in 2003 and part of 2004. He also played for the South African side, Boland, in 1993/94 and 1994/95.

With Lancashire he was part of the team that won both the Benson and Hedges Cup and the NatWest Bank Trophy in 1990, and he was man of the match in the final of the latter.

DeFreitas announced in April 2005 that he would retire from cricket at the end of that season. This meant that had England not beaten the Australians that summer, there would be no remaining Englishmen in first-class cricket who had played in a victorious Ashes side, but this did not happen. On hearing the news, Mike Gatting, who had captained that 1986/87 team, told the BBC: "He's one of those guys you want in the game. It's sad he's going to retire but he's been good for the game."

Before retiring DeFreitas achieved the increasingly rare milestone of scoring first-class 10,000 runs and taking 1,000 first-class wickets in his career.

International career
Making his Test debut in the 1st Test of the 1986–87 Ashes at Brisbane. He made an immediate impact in an important partnership with Ian Botham. England went onto win the series against Australia, and DeFreitas was also the top wicket taker as England won the World Series Cup later that winter. He would later play in four more Ashes series, but never again finished on the winning side in an Ashes series.

He remained part of England's Test plans until the advent of Dominic Cork in the mid-1990s, but was generally much less successful abroad than at home. His two best Test series were in 1991 against West Indies and, in 1994, against New Zealand, when he took 22 and 21 wickets respectively. DeFreitas was the first victim of Shane Warne's 1994 hat trick at the MCG. His top Test score of 88 was achieved during the same tour, during which he hammered Craig McDermott for 42 runs off three overs with the new ball, helped England to a win against Australia in Adelaide, and earned him the Man of the Match award.

DeFreitas was named as a Wisden Cricketer of the Year in 1992. This followed that 1991 series against the West Indies, when he had taken match figures of 8–93 in England's first victory in a home Test against the West Indies for 22 years (at Leeds), made his first Test half century, and a test at Lord's against Sri Lanka in which he recorded his best figures in a Test match innings, 7-70. He recorded his best match figures in a Test match in 1994, 9–165, against New Zealand (also making 51 not out in the same match at Trent Bridge).

DeFreitas also played in the 1987 Cricket World Cup. During his first match in the tournament against West Indies played in Pakistan, while attempting to bowl DeFreitas had to stop in the middle of his run-up in order to vomit. He had not been feeling well and the searing heat had made the affliction worse. Anxious not to lose his place, he had not mentioned his illness to the captain, preferring to try and see the day through instead. He managed this without compromising his teammates. DeFreitas went onto play for England in the final against Australia, taking England close to victory with some late hitting before falling short.

DeFreitas had the honour of being the 100th player in test cricket to take 100 wickets. He played his 44 Tests over nine years, and was hampered in fulfilling his early promise by injury, inconsistency, and varied selection policies; in 1988, for instance, he was dropped from the England test team three times in a single summer. In one-day internationals, DeFreitas seldom let England down – but bowled more economically than penetratively until his second Australian tour. In the World Series Cup that season, DeFreitas was often punished by the powerful Australian top order particularly Dean Jones. He performed creditably despite a persistent groin strain in the Cricket World Cup of 1992 but form was beginning to desert him by this stage. He was notoriously thrashed all over the ground by Sanath Jayasuriya in the 1996 World Cup quarter final – by no means alone – in a game where England were thrashed and ended up making their tournament exit. As of 2022, DeFreitas remains one of only four England players – along with Botham, Graham Gooch and Allan Lamb – to have played in more than one Cricket World Cup final.

He played his last full international for England, a one-day international, in 1997 against Australia.

Personal life
As well as making irregular television appearances, DeFreitas became a cricket master at Oakham School in January 2009, under the school's director of cricket, Frank Hayes. he taught at Magdalen College School, Oxford.

DeFreitas sought and in October 1995 obtained legal redress when a July 1995 article appearing in the Wisden Cricket Monthly questioned the commitment of players of foreign origin to the England cricket team. DeFreitas, England and then Derbyshire colleague Devon Malcolm, and others, the writer opined, were not "unequivocal Englishmen". According to subsequent recollection this recalled typecasting of Malcolm and Gladstone Small by politician Norman Tebbit in 1990. DeFreitas recalled that the writer "suggested [we] were interlopers. That was so out of order, so wrong". DeFreitas and Malcolm, issued writs for defamation; DeFreitas settled outside of court while Malcolm accepted libel damages through the High Court.

His autobiography, "Daffy: My Life in Cricket", was published on 16 June 2012. DeFreitas is also a fan of English football side Manchester City.

title: Phillip DeFreitas


text: User talk:69.209.211.203

title: User talk:69.209.211.203


text:
User talk:Havok

 [ Click here to leave me a message]

Wikipedia:Game guide listed at Redirects for discussion
An editor has asked for a discussion to address the redirect Game guide. Since you had some involvement with the Wikipedia:Game guide redirect, you might want to participate in the redirect discussion if you have not already done so. — SMcCandlish ☏ ¢ 😼  05:56, 4 February 2018 (UTC)

Shahram Dabiri listed at Redirects for discussion
An editor has asked for a discussion to address the redirect Shahram Dabiri. Since you had some involvement with the Shahram Dabiri redirect, you might want to participate in the redirect discussion if you have not already done so. ZXCVBNM (TALK) 12:12, 12 February 2018 (UTC)

Your access to AWB may be temporarily removed
Hello Havok! This message is to inform you that due to editing inactivity, your access to AutoWikiBrowser may be temporarily removed. If you do not resume editing within the next week, your username will be removed from the CheckPage. This is purely for routine maintenance and is not indicative of wrongdoing on your part. You may regain access at any time by simply requesting it at WP:PERM/AWB. Thank you! — MusikBot II  talk  22:54, 13 February 2018 (UTC)

Proposed deletion of MoSys

The article MoSys has been proposed for deletion because of the following concern: "No evidence this company passes WP:GNG/WP:NCOMPANY. Sources/coverage seem limited to pess releases and like, no awards, etc. Just business as usual. WP:NOTYELLOWPAGES"

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

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

Please consider improving the page to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Piotr Konieczny aka Prokonsul Piotrus| reply here 10:27, 9 January 2020 (UTC)

title: User talk:Havok


text:
Talk:Canon AE-1

Photo replacement
I replaced what looked like a stock image of the AE-1 with a photo of my very own baby. The other was very small (200px or so) and grainy, so I felt this was an okay change. --PhilipNeustrom 00:58, 15 Jun 2005 (UTC)
 * I noticed my change was reverted. I will attempt to take a clear, head-on, no background shot of my AE-1 with the 50mm lens on it. --67.112.109.53 22:32, 24 July 2005 (UTC)

Production Dates
I know that the common wisdom is that the original AE-1 was discontinued with the introduction of the AE-1 Program in 1981. However, Canon continued to produce—and advertise the AE-1 beyond this date. I contacted Canon for confirmation of this fact, and was informed that the original AE-1 was produced until 1984. Unschool 03:32, 7 December 2005 (UTC)

 * Good work, but it would be better if you could find a cite for this. If you received this confirmation in paper mail or email, would you be able to post this online somewhere? —Matthew Brown (T:C) 04:05, 7 December 2005 (UTC)

 * I have the email, but have no idea how to go about posting it (or even where—this discussion page, I suppose?). Seeking advice. Unschool 04:11, 7 December 2005 (UTC)

 * Go ahead and post it here. It's definitely better than nothing.  A shame Canon's Camera Museum doesn't list end dates. —Matthew Brown (T:C) 04:55, 7 December 2005 (UTC)

 * Oops. I forgot all about this.  Anyway, this is just cut and pasted from my actual email exchange with Cannon.  [I have deleted my name.]  This doesn't seem like a very effective way to document this, but I don't know what else to do. Unschool

Name = [deleted]

E-mail = unschool@bellsouth.net

Resident Country/ Region = Florida, USA

Message =

''I have a question about the AE-1. I know it was introduced'' '' in 1976, as your excellent website makes clear. But I have an'' acquaintance who tells me that production on the AE-1 was halted in 1981, when the AE-1 Program was introduced.

Now I purchased a brand-new AE-1 (non-Program) in ''April of 1984, in Bloomington, Illinois. Is it'' possible that that camera had been setting on a store shelf for 3 years, or is it possible (as I think) that AE-1 production was not halted in 1981, as my friend asserts?

I look forward to, and thank you for your answer.

Dear [deleted],

'''Thank you for contacting Canon regarding your Canon AE-1. I am responding on behalf of the Canon, Inc. offices in Japan.  Production of the Canon AE-1 continued until 1984. '''

I hope that this information is helpful, and that you will contact me directly at the toll free number below if you have any other questions.

'''Sincerely, Paul Slater Canon Corporate Customer Relations '''(757) 222-9000, ext. 2290'''

Unschool 02:48, 12 April 2006 (UTC)

Quality?
The article makes the AE-1 seem like a cheap, problematic design heavily marketed to people who though they bought a quality camera. Is this (or something less exaggerated, maybe) really the accepted view?

I used and abused two of these fairly heavily through the 1980s and well into the 1990s, and I had the impression that they were robust, quality cameras. JöG 23:59, 22 December 2006 (UTC)

I agree - the article makes the camera look really cheap when it is actually one of the most durable and reliable amateur-priced SLRs ever made. There are hundreds of thousands of these things in use 30 years later; there is not much of a market due to the obsolete lens mount but many people still use this as their daily camera.

As a professional photographer I carry an AE-1 as a last resort backup camera on every important shoot I do. It is my security blanket, if my digitals fail, if my old film camera's fail, I have total faith that the AE-1 will get me through almost any event I encounter. It's been my experience that the AE-1 is one of the most reliable 35mm cameras ever designed. This article does not do it justice. The amount of abuse I've seen people dish out on the AE-1 is legendary in scope & yet nearly every time the camera can be picked up, dusted off, and used again without a second thought. (67.184.109.172 (talk) 18:06, 23 June 2008 (UTC))

I also agree - this article is not only a distortion of the durability of this fine quality amateur camera, it's written with an almost condescending tone. It's almost as if the author had some sort of stake in Nikon, Olympus or Minolta's future and resented the AE-1's popularity. My original AE-1 is still going, as is one I bought for a girlfriend well over twenty years ago. A fine example of the failed objectivity of Wikipedia. —Preceding unsigned comment added by 67.243.142.103 (talk) 01:19, 22 August 2008 (UTC)

I think that section of the article should be editted. While true that many of these issues exist, the tone of the paragraph almost makes it seem like the AE-1 is a horrifically flawed camera. —Preceding unsigned comment added by 137.207.232.53 (talk) 20:01, 4 July 2009 (UTC)

No doubt, the AE-1 is legendary in it's reliability. Most of the photographers I know, myself included, have one in their gadget bag because, when everything else fails, the AE-1 won't. — Preceding unsigned comment added by 50.202.40.232 (talk) 21:24, 15 October 2013 (UTC)
 * Seems to me that if you compare to the Canon F-1, then it is probably considered a cheap design. The F-1, competition for the Nikon F, has interchangeable everything: viewfinder, view screen, back (including for 250 exposures), (a few) motor drives, and more things that I never saw. Most of those were left out of the AE-1, allowing for a reduced price. Then the reduced price allowed more sales, and more economy of scale.  But yes, compared to much of the competition, it was not a cheap design. Gah4 (talk) 20:59, 2 March 2022 (UTC)
 * Seems to me that if you compare to the Canon F-1, then it is probably considered a cheap design. The F-1, competition for the Nikon F, has interchangeable everything: viewfinder, view screen, back (including for 250 exposures), (a few) motor drives, and more things that I never saw. Most of those were left out of the AE-1, allowing for a reduced price. Then the reduced price allowed more sales, and more economy of scale.  But yes, compared to much of the competition, it was not a cheap design. Gah4 (talk) 20:59, 2 March 2022 (UTC)

Under/overexposure on the AE-1
Article asserts that there was no way to properly expose due to using only one needle indicator. "The AE-1 had only one pointer needle used to indicate the light meter recommended f-stop, and neither a follower needle to indicate the actual lens set f-stop, nor plus/minus indicators for over/underexposure." Read the manual. The needle had a circle at the end. The circle was exactly 1 stop wide. Bisecting the indicator (circle in half) gave you the exact aperture being metered. Resting the circle on top of the indicator gave you a half-stop over, resting it below gave you a half-stop under. And most shooters quickly learned where to position the circle to under or overexpose pretty accurately. Since you turned the f-stop ring (one click per half stop) to set the aperture, and the indicator moved as you did so, the idea that there was no way to know what f-stop you had is either a false claim, or a poorly written sentence attempting to make a different claim. As well, the following sentences are I think in violation of NPOV; it is the writer's opinion that the shutter was poorly adapted for sports use, etc., but the claim would only be worth making if you could show that it was a commented upon failing of the design. As it stands, it's just an opinion, unsupported by any citations, for example, numerous reviews of the product. Theonemacduff (talk) 07:35, 1 September 2016 (UTC)

Canon F-1
As far as I know, the Canon F-1 was reasonable competition for the Nikon F, and the AE-1 was not meant to be competition for either of them. The article seems to indicate that Canon couldn't compete with Nikon. Gah4 (talk) 21:04, 2 March 2022 (UTC)

- I agree, the article over emphasizes Nikon's domination. Nikon definitely had the upper hand in the professional market, but the F-1 was quite competitive wit the Nikon F2. The Canon SLRs prior to the AE-1 were very competitive with Nikon's consumer cameras - Nikkormat etc. --Kevin Murray (talk) 18:00, 29 July 2023 (UTC)

title: Talk:Canon AE-1


text:
List of Microsoft server technologies

The following is a list of Microsoft server technology.

Backup

 * Data Protection Manager (Beta product)

Administration

 * Terminal Services
 * Active Directory (AD)
 * Primary Domain Controller (PDC)
 * Domain Controller
 * Windows Server domain
 * Windows Internet Naming Service (WINS)
 * Remote Desktop Protocol (RDP)
 * Systems Management Server

Internet services

 * Active Server Pages (ASP)
 * Application Center Test (ACT)
 * ASP.NET
 * Internet Information Services (IIS)
 * Microsoft Exchange Server
 * Microsoft Forefront Threat Management Gateway (Forefront TMG)
 * Microsoft Project Server
 * Office Web Apps Server
 * SharePoint
 * Skype for Business Server

Databases

 * Microsoft SQL Server
 * Microsoft Desktop Engine

Developer Services

 * Team Foundation Server
 * Visual Studio Team Services

Virtualization

 * Hyper-V

title: List of Microsoft server technologies


text: User talk:69.140.100.114

title: User talk:69.140.100.114


text:
Saint-Méen-le-Grand

Saint-Méen-le-Grand (Sant-Meven; Gallo: Saent-Men) is a commune in the Ille-et-Vilaine department in Brittany in northwestern France.

It is located west of Rennes between Montauban-de-Bretagne and Gaël.

The town was the birthplace of the 3-time Tour de France winner Louison Bobet and it hosted the start of Stage 8 of the 2006 Tour.

Population
Inhabitants of Saint-Méen-le-Grand are called mévennais in French.

title: Saint-Méen-le-Grand


text:
Fully polynomial-time approximation scheme

A fully polynomial-time approximation scheme (FPTAS) is an algorithm for finding approximate solutions to function problems, especially optimization problems. An FPTAS takes as input an instance of the problem and a parameter ε > 0. It returns as output a value which is at least $$1-\varepsilon$$ times the correct value, and at most $$1 + \varepsilon$$ times the correct value.

In the context of optimization problems, the correct value is understood to be the value of the optimal solution, and it is often implied that an FPTAS should produce a valid solution (and not just the value of the solution). Returning a value and finding a solution with that value are equivalent assuming that the problem possesses self reducibility.

Importantly, the run-time of an FPTAS is polynomial in the problem size and in 1/ε. This is in contrast to a general polynomial-time approximation scheme (PTAS). The run-time of a general PTAS is polynomial in the problem size for each specific ε, but might be exponential in 1/ε.

The term FPTAS may also be used to refer to the class of problems that have an FPTAS. FPTAS is a subset of PTAS, and unless P = NP, it is a strict subset.

Relation to other complexity classes
All problems in FPTAS are fixed-parameter tractable with respect to the standard parameterization.

Any strongly NP-hard optimization problem with a polynomially bounded objective function cannot have an FPTAS unless P=NP. However, the converse fails: e.g. if P does not equal NP, knapsack with two constraints is not strongly NP-hard, but has no FPTAS even when the optimal objective is polynomially bounded.

Converting a dynamic program to an FPTAS
Woeginger presented a general scheme for converting a certain class of dynamic programs to an FPTAS.

Input
The scheme handles optimization problems in which the input is defined as follows:
 * The input is made of n vectors, x1,...,xn.
 * Each input vector is made of some $$a$$ non-negative integers, where $$a$$ may depend on the input.
 * All components of the input vectors are encoded in binary. So the size of the problem is O(n+log(X)), where X is the sum of all components in all vectors.

Extremely-simple dynamic program
It is assumed that the problem has a dynamic-programming (DP) algorithm using states. Each state is a vector made of some $$b$$ non-negative integers, where $$b$$ is independent of the input. The DP works in n steps. At each step i, it processes the input xi, and constructs a set of states Si. Each state encodes a partial solution to the problem, using inputs x1,...,xi. The components of the DP are:

 * A set S0 of initial states.
 * A set F of transition functions. Each function f in F maps a pair (state,input) to a new state.
 * An objective function g, mapping a state to its value.

The algorithm of the DP is:

The run-time of the DP is linear in the number of possible states. In general, this number can be exponential in the size of the input problem: it can be in O(n Vb), where V is the largest integer than can appear in a state. If V is in O(X), then the run-time is in O(n Xb), which is only pseudo-polynomial time, since it is exponential in the problem size which is in O(log X).
 * Let S0 := the set of initial states.
 * For k = 1 to n do:
 * Let Sk := {f(s,xk) | f in F, s in Sk−1}
 * Output min/max {g(s) | s in Sn}.

The way to make it polynomial is to trim the state-space: instead of keeping all possible states in each step, keep only a subset of the states; remove states that are "sufficiently close" to other states. Under certain conditions, this trimming can be done in a way that does not change the objective value by too much.

To formalize this, we assume that the problem at hand has a non-negative integer vector d = (d1,...,db), called the degree vector of the problem. For every real number r>1, we say that two state-vectors s1,s2 are (d,r)-close if, for each coordinate j in 1,...,b: $$r^{-d_j} \cdot s_{1,j} \leq s_{2,j} \leq r^{d_j} \cdot s_{1,j}$$ (in particular, if dj=0 for some j, then $$s_{1,j} = s_{2,j}$$).

A problem is called extremely-benevolent if it satisfies the following three conditions:

For every extremely-benevolent problem, the dynamic program can be converted into an FPTAS. Define:
 * 1) Proximity is preserved by the transition functions: For any r>1, for any transition function f in F, for any input-vector x, and for any two state-vectors s1,s2, the following holds: if s1 is (d,r)-close to s2, then f(s1,x) is (d,r)-close to f(s2,x).
 * 2) *A sufficient condition for this can be checked as follows. For every function f(s,x) in F, and for every coordinate j in 1,...,b, denote by fj(s,x) the j-th coordinate of f. This fj can be seen as an integer function in b+a variables. Suppose that every such fj is a polynomial with non-negative coefficients. Convert it to a polynomial of a single variable z, by substituting s=(zd1,...,zdb) and x=(1,...,1). If the degree of the resulting polynomial in z is at most dj, then condition 1 is satisfied.
 * 3) Proximity is preserved by the value function: There exists an integer G ≥ 0 (which is a function of the value function g and the degree vector d), such that for any r>1, and for any two state-vectors s1,s2, the following holds: if s1 is (d,r)-close to s2, then: g(s1) ≤ rG · g(s2) (in minimization problems); g(s1) ≥ r(-G) · g(s2) (in maximization problems).
 * 4) *A sufficient condition for this is that the function g is a polynomial function (of b variables) with non-negative coefficients.
 * 5) Technical conditions:
 * 6) *All transition functions f in F and the value function g can be evaluated in polytime.
 * 7) *The number |F| of transition functions is polynomial in n and log(X).
 * 8) *The set S0 of initial states can be computed in time polynomial in n and log(X).
 * 9) *Let Vj be the set of all values that can appear in coordinate j in a state. Then, the ln of every value in Vj is at most a polynomial P1(n,log(X)).
 * 10) *If dj=0, the cardinality of Vj is at most a polynomial P2(n,log(X)).

 * $$\epsilon$$ := the required approximation ratio.
 * $$r := 1 + \frac{\epsilon}{2 G n}$$, where G is the constant from condition 2. Note that $$\frac{1}{\ln{r}} \leq 1 + \frac{2Gn}{\epsilon}$$.
 * $$L := \left\lceil \frac{P_1(n,\log(X))}{\ln(r)} \right\rceil$$, where P1 is the polynomial from condition 3 (an upper bound on the ln of every value that can appear in a state vector). Note that $$L\leq \left\lceil \left(1 + \frac{2 G n}{\epsilon}\right) P_1(n, \log{X}) \right\rceil$$, so it is polynomial in the size of the input and in $$1/\epsilon$$. Also, $$r^L = e^{\ln{r}}\cdot L \geq e^{P_1(n,\log{x})}$$, so by definition of P1, every integer that can appear in a state-vector is in the range [0,rL].
 * Partition the range [0,rL] into L+1 r-intervals: $$I_0 = [0]; I_1 = [1,r); I_2 = [r,r^2); \ldots ; I_L = [r^{L-1}, r^L]$$.
 * Partition the state space into r-boxes: each coordinate k with degree dk ≥ 1 is partitioned into the L+1 intervals above; each coordinate with dk = 0 is partitioned into P2(n,log(X)) singleton intervals - an interval for each possible value of coordinate k (where P2 is the polynomial from condition 3 above).
 * Note that every possible state is contained in exactly one r-box; if two states are in the same r-box, then they are (d,r)-close.
 * $$R := (L + 1 + P_2(n,\log{X}))^b$$.
 * Note that the number of r-boxes is at most R. Since b is a fixed constant, this R is polynomial in the size of the input and in $$1/\epsilon$$.

The FPTAS runs similarly to the DP, but in each step, it trims the state set into a smaller set Tk, that contains exactly one state in each r-box. The algorithm of the FPTAS is: The run-time of the FPTAS is polynomial in the total number of possible states in each Ti, which is at most the total number of r-boxes, which is at most R, which is polynomial in n, log(X), and $$1/\epsilon$$.
 * Let T0 := S0 = the set of initial states.
 * For k = 1 to n do:
 * Let Uk := {f(s,xk) | f in F, s in Tk−1}
 * Let Tk := a trimmed copy of Uk: for each r-box that contains one or more states of Uk, keep exactly one state in Tk.
 * Output min/max {g(s) | s in Tn}.

Note that, for each state su in Uk, its subset Tk contains at least one state st that is (d,r)-close to su. Also, each Uk is a subset of the Sk in the original (untrimmed) DP. The main lemma for proving the correctness of the FPTAS is:

For every step k in 0,...,n, for every state ss in Sk, there is a state st in Tk that is (d,rk)-close to ss.

The proof is by induction on k. For k=0 we have Tk=Sk; every state is (d,1)-close to itself. Suppose the lemma holds for k-1. For every state ss in Sk, let ss- be one of its predecessors in Sk-1, so that f(ss−,x)=ss. By the induction assumption, there is a state st- in Tk-1, that is (d,rk-1)-close to ss−. Since proximity is preserved by transitions (Condition 1 above), f(st−,x) is (d,rk-1)-close to f(ss−,x)=ss. This f(st−,x) is in Uk. After the trimming, there is a state st in Tk that is (d,r)-close to f(st-,x). This st is (d,rk)-close to ss.

Consider now the state s* in Sn, which corresponds to the optimal solution (that is, g(s*)=OPT). By the lemma above, there is a state t* in Tn, which is (d,rn)-close to s*. Since proximity is preserved by the value function, g(t*) ≥ r(-Gn) · g(s*) for a maximization problem. By definition of r, $$r^{-Gn}\geq (1-\epsilon)$$. So $$g(t^*)\geq (1-\epsilon)\cdot OPT$$. A similar argument works for a minimization problem.

Examples
Here are some examples of extremely-benevolent problems, that have an FPTAS by the above theorem.

1. Multiway number partitioning (equivalently, Identical-machines scheduling) with the goal of minimizing the largest sum is extremely-benevolent. Here, we have a = 1 (the inputs are integers) and b = the number of bins (which is considered fixed). Each state is a vector of b integers representing the sums of the b bins. There are b functions: each function j represents inserting the next input into bin j. The function g(s) picks the largest element of s. S0 = {(0,...,0)}. The conditions for extreme-benevolence are satisfied with degree-vector d=(1,...,1) and G=1. The result extends to Uniform-machines scheduling and Unrelated-machines scheduling whenever the number of machines is fixed (this is required because R - the number of r-boxes - is exponential in b). Denoted Pm||$$\max C_j$$ or Qm||$$\max C_j$$ or Rm||$$\max C_j$$.

 * Note: consider the special case b=2, where the goal is to minimize the square of the difference between the two part sums. The same DP can be used, but this time with value function g(s) = (s1-s2)2. Now, condition 2 is violated: the states (s1,s1) and (s1,s2) may be (d,r)-close, but g(s1,s1) = 0 while g(s1,s2) > 0. so the above theorem cannot be applied. Indeed, the problem does not have an FPTAS unless P=NP, since an FPTAS could be used to decide in polytime whether the optimal value is 0.

2. Sum of cubed job completion time on any fixed number of identical or uniform machines - the latter denoted by Qm||$$\sum C_j^3$$ - is ex-benevolent with a=1, b=3, d=(1,1,3). It can be extended to any fixed power of the completion time.

3. Sum of weighted completion time on any fixed number of identical or uniform machines - the latter denoted by Qm||$$\sum w_j C_j$$.

4. Sum of completion time on any fixed number of identical or uniform machines, with time-dependent processing times: Qm|time-dep|$$\sum C_j$$. This holds even for weighted sum of completion time.

5. Weighted earliness-tardiness about a common due-date on any fixed number of machines: m||$$\sum w_j|C_j|$$.

Simple dynamic program
Simple dynamic programs add to the above formulation the following components:

The original DP is modified as follows: A problem is called benevolent if it satisfies the following conditions (which extend conditions 1, 2, 3 above):
 * A set H of filtering functions, of the same cardinality as F. Each function hi in H maps a pair (state,input) to a Boolean value. The value should be "true" if and only if activating the transition fi on this pair would lead to a valid state.
 * A dominance relation, which is a partial order on states (no indifferences, not all pairs are comparable), and a quasi-dominance relation which is a total preorder on states (indifferences allowed, all pairs are comparable).
 * Let S0 := the set of initial states.
 * For k = 1 to n do:
 * Let Sk := {fj(s,xk) | fj in F, s in Sk−1, hj(s,xk)=True }, where hj is the filter function corresponding to the transition function fj.
 * Output min/max {g(s) | s in Sn}.

 * 1) Proximity is preserved by the transition functions: For any r>1, for any transition function f in F, for any input-vector x, and for any two state-vectors s1,s2, the following holds:
 * 2) * if s1 is (d,r)-close to s2, and s1 quasi-dominates s2, then either (a) f(s1,x) is (d,r)-close to f(s2,x), and f(s1,x) quasi-dominates f(s2,x), or (b) f(s1,x) dominates f(s2,x).
 * 3) * if s1 dominates s2, then f(s1,x) dominates f(s2,x).
 * 4) Proximity is preserved by the value function: There exists an integer G ≥ 0 (a function of the value function g and the degree vector d), such that for any r>1, and for any two state-vectors s1,s2, the following holds:
 * 5) * if s1 is (d,r)-close to s2, and s1 quasi-dominates s2 , then: g(s1) ≤ rG · g(s2) (in minimization problems); g(s1) ≥ r(-G) · g(s2) (in maximization problems).
 * 6) * if s1 dominates s2, then g(s1) ≤ g(s2) (in minimization problems); g(s1) ≥ g(s2) (in maximization problems).
 * 7) Technical conditions (in addition to the above):
 * 8) * The quasi-dominance relation can be decided in polynomial time.
 * 9) Conditions on the filter functions: For any r>1, for any filter function h in H, for any input-vector x, and for any two state-vectors s1,s2, the following holds:
 * 10) * if s1 is (d,r)-close to s2, and s1 quasi-dominates s2, then h(s1,x) ≥ h(s2,x).
 * 11) * if s1 dominates s2, then h(s1,x) ≥ h(s2,x).

For every benevolent problem, the dynamic program can be converted into an FPTAS similarly to the one above, with two changes (boldfaced):
 * Let T0 := S0 = the set of initial states.
 * For k = 1 to n do:
 * Let Uk := {fj(s,xk) | fj in F, s in Tk−1, hj(s,xk)=True }, where hj is the filter function corresponding to the transition function fj.
 * Let Tk := a trimmed copy of Uk: for each r-box that contains one or more states of Uk, choose a single element that quasi-dominates all other elements in Uk, and insert it into Tk.
 * Output min/max {g(s) | s in Tn}.

Examples
Here are some examples of benevolent problems, that have an FPTAS by the above theorem.

1. The 0-1 knapsack problem is benevolent. Here, we have a=2: each input is a 2-vector (weight, value). There is a DP with b=2: each state encodes (current weight, current value). There are two transition functions: f1 corresponds to adding the next input item, and f2 corresponds to not adding it. The corresponding filter functions are: h1 verifies that the weight with the next input item is at most the knapsack capacity; h2 always returns True. The value function g(s) returns s2. The initial state-set is {(0,0)}. The degree vector is (1,1). The dominance relation is trivial. The quasi-dominance relation compares only the weight coordinate: s quasi-dominates t iff s1 ≤ t1. The implication of this is that, if state t has a higher weight than state s, then the transition functions are allowed to not preserve the proximity between t and s (it is possible, for example, that s has a successor and t does not have a corresponding successor). A similar algorithm was presented earlier by Ibarra and Kim. The run-time of this FPTAS can be improved to $$O(n \log{1/\epsilon} + 1/\epsilon^4)$$ operations on integers. The exponent was later improved to 2.5.

 * Note: consider In the 2-weighted knapsack problem, where each item has two weights and a value, and the goal is to maximize the value such that the sum of squares of the total weights is at most the knapsack capacity: $$\left(\sum_{k\in K} w_{1,k}\right)^2 + \left(\sum_{k\in K} w_{2,k}\right)^2 \leq W$$. We could solve it using a similar DP, where each state is (current weight 1, current weight 2, value). The quasi-dominance relation should be modified to: s quasi-dominates t iff (s12 + s22) ≤ (t12 + t22). But it violates Condition 1 above: quasi-dominance is not preserved by transition functions [for example, the state (2,2,..) quasi-dominates (1,3,..); but after adding the input (2,0,..) to both states, the result (4,2,..) does not quasi-dominate (3,3,..)]. So the theorem cannot be used. Indeed, this problem does not have an FPTAS unless P=NP. The same is true for the two-dimensional knapsack problem. The same is true for the multiple subset sum problem: the quasi-dominance relation should be: s quasi-dominates t iff max(s1,s2) ≤ max(t1,t2), but it is not preserved by transitions, by the same example as above.

2. Minimizing the weighted number of tardy jobs, or maximizing the weighted number of early jobs, on a single machine; denoted 1||$$\sum w_j U_j$$.

3. Batch scheduling for minimizing the weighted number of tardy jobs: 1|batch|$$\sum w_j U_j$$.

4. Makespan of deteriorating jobs on a single machine: 1|deteriorate|$$\max C_j$$.

5. Total late work on a single machine: 1||$$\sum V_j$$.

6. Total weighted late work on a single machine: 1||$$\sum w_j V_j$$.

Non-examples
Despite the generality of the above result, there are cases in which it cannot be used.

1. In the total tardiness problem 1||$$\sum T_j$$, the dynamic programming formulation of Lawler requires to update all states in the old state space some B times, where B is of the order of X (the maximum input size). The same is true for a DP for economic lot-sizing. In these cases, the number of transition functions in F is B, which is exponential in the log(X), so the second technical condition is violated. The state-trimming technique is not useful, but another technique - input-rounding - has been used to design an FPTAS.

2. In the variance minimization problem 1||$$CTV$$, the objective function is $$g(s) = s_5 - (s_4-s_3)^2/n$$, which violates Condition 2, so the theorem cannot be used. But different techniques have been used to design an FPTAS.

FPTAS for approximating real numbers
A different kind of problems in which FPTAS may be useful is finding rational numbers that approximate some real numbers. For example, consider the infinite series $$\sum_{i=1}^\infty \frac{1}{i^3}$$. The sum is an irrational number. To approximate it by a rational number, we can compute the sum of the first k elements, for some finite k. One can show that the error in approximation is about $$\frac{1}{2 k^2}$$. Therefore, to get an error of ε, we need about $$\sqrt{\frac{1}{2 \epsilon}}$$ elements, so this is an FPTAS. Note that this particular sum can be represented by another sum in which only O(log(ε)) elements are needed, so the sum can actually be approximated in polynomial time in the encoding length of ε.

Some other problems that have an FPTAS

 * The knapsack problem, as well as some of its variants:
 * 0-1 knapsack problem.
 * Unbounded knapsack problem.
 * Multi-dimensional knapsack problem with Delta-modular constraints.
 * Multi-objective 0-1 knapsack problem.
 * Parametric knapsack problem.
 * Symmetric quadratic knapsack problem.
 * Count-subset-sum (#SubsetSum) - finding the number of distinct subsets with a sum of at most C.
 * Restricted shortest path: finding a minimum-cost path between two nodes in a graph, subject to a delay constraint.
 * Shortest paths and non-linear objectives.
 * Counting edge-covers.
 * Vector subset search problem where the dimension is fixed.


text:
Canton of Saint-Méen-le-Grand

The Canton of Saint-Méen-le-Grand is a former canton of France, in the Ille-et-Vilaine département, located southwest of Rennes. It had 11,135 inhabitants (2012). It was disbanded following the French canton reorganisation which came into effect in March 2015. It consisted of 9 communes, which joined the canton of Montauban-de-Bretagne in 2015. It is located between Rennes and Brest.

The canton comprised the following communes:

 * Bléruais
 * Le Crouais
 * Gaël
 * Muel
 * Quédillac
 * Saint-Malon-sur-Mel
 * Saint-Maugan
 * Saint-Méen-le-Grand
 * Saint-Onen-la-Chapelle

title: Canton of Saint-Méen-le-Grand


text: User talk:71.5.75.18

title: User talk:71.5.75.18