text:
Baron Churston

Baron Churston, of Churston Ferrers and Lupton in the County of Devon, is a title in the Peerage of the United Kingdom. It was created in 1858 for the former Conservative Member of Parliament, Sir John Yarde, 3rd Baronet. He had earlier represented South Devon in the House of Commons. Two years later, in 1860, he assumed by Royal licence the additional surname of Buller. the titles are held by his great-great-great-great-grandson, the sixth Baron, who succeeded his father in that year.

The baronetcy, of Lupton House in the County of Devon, was created in the Baronetage of Great Britain on 13 January 1790 for the lawyer Sir Francis Buller. He was the son of James Buller. The first Baronet's son, the second Baronet, represented Totnes in the House of Commons. In 1800, he assumed by Royal licence the surname of Yarde. He was succeeded by his eldest son, the aforementioned third Baronet, who was elevated to the peerage in 1858.

The Barons Churston are related to the Viscounts Dilhorne and the Aga Khans. Sir Edward Manningham-Buller, 1st Baronet, of Dilhorne, third son of Sir Francis Yarde, 2nd Baronet, of Churston Court, was the great-grandfather of Reginald Manningham-Buller, 1st Viscount Dilhorne. The Hon. Joan Yarde-Buller, daughter of the third Baron Churston, married Prince Aly Khan and became Princess Tajuddawlah Aga Khan. The fifth Baron was a first cousin of her son Aga Khan IV.

The family seat is Yowlestone House, near Tiverton, Devon.

Buller, Yarde-Buller baronets, of Lupton House (1790)

 * Sir Francis Buller, 1st Baronet (1746–1800)
 * Sir Francis Buller-Yarde-Buller, 2nd Baronet (1767–1833)
 * John Yarde-Buller, 3rd Baronet (1799–1871) (created Baron Churston in 1858)

Barons Churston (1858)

 * John Yarde-Buller, 1st Baron Churston (1799–1871)
 * John Yarde-Buller, 2nd Baron Churston (1846–1910)
 * John Reginald Lopes Yarde-Buller, 3rd Baron Churston (1873–1930)
 * Richard Francis Roger Yarde-Buller, 4th Baron Churston (1910–1991)
 * John Francis Yarde-Buller, 5th Baron Churston (1934–2023)
 * Benjamin Francis Anthony Yarde-Buller, 6th Baron Churston (born 1974)

The heir apparent is the present holder's son, Hon. Joseph Francis Yarde-Buller (born 2004).

title: Baron Churston


text:
Daggett Brook

Daggett Brook is a stream in southern Crow Wing County in the U.S. state of Minnesota. It is a tributary of the Nokasippi River.

Daggett Brook was named for Benjamin F. Daggett, a lumberjack who felled trees there.

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

title: Daggett Brook


text:
User:Sj/worldofideas

Quibs
Ecopolitical:  Distributism (The problem with capitalism is, there are not enough capitalists -Chesterton) Capitalist:   freedom! invisibility. commoditisation. people valuing things more according to their price rather than their usefulness

Theories
... of value ... of efficiency

title: User:Sj/worldofideas


text:
Talk:Imperial College London

Opening of CGLI
"The Central Institution of the City and Guilds of London Institute was opened as a technical education school on Exhibition Road by the Prince of Wales in early 1885."

"Prince of Wales" is wikilinked to George V, which certainly means that something is incorrect in the sentence as it stands. The future Geprge V's title at this time was not "Prince of Wales" but "Prince George of Wales". If, on the other hand, the Institution was opened by the Prince of Wales of that time, the phrase should be wikilinked to Edward VII. Harfarhs (talk) 23:47, 2 September 2023 (UTC)

 * The source says "Prince of Wales", so I've changed the link to Edward VII. Robminchin (talk) 00:52, 3 September 2023 (UTC)

Entrepreneurship and innovation
Rather than discuss this through edit comments, I thought it would be better to open a topic here :)

Thanks for adding the additional citation. While this does support the entreprenurial culture, it is based on what Imperial's president said in his speech rather than being an independent source. It would be much better if this was backed up by a third-party source as I'm not sure that this is within WP:ABOUTSELF, in particular whether the claim to have an entreprenurial culture is "neither unduly self-serving nor an exceptional claim". While facts given by the president are almost certainly accurate, we must assume that opinions are influenced by his position. I've left it in for now, but if there is a third party source that would make it much stronger.

There should also be some discussion in the body for it to be in the lead (which is a summary of the body). The current 'Innovation' subsection falls under Rankings in Academic Profile – it would actually be good to change this to 'Reputation and rankings' (in keeping with other universities), and to discuss Imperial's reputation for innovation and entrepreneurship in this section. Robminchin (talk) 21:21, 14 March 2024 (UTC)
 * Yes, that sounds good. This is a better idea to discuss on the talk page then over edit comments.

 * Yes, I agreed with you, additional sources would be good. My first citation - wasnt clear at all, I agree.  The new citation by the university president describing the school simply, i thought was better and likely accurate, I should find additional sources that are third-party as you said, so the source appears less Wp:aboutself.

 * Yes, your point makes sense to me, and I agree too, it should be in the body more as well. I will work on incorporating that to rename the section 'Reputation and Rankings'.  Hopefully we can find something we both like and think is an improvement.  I agreed with all your points. :) I'll try to write something brief about Imperial's reputation from third party sources.  I'll ping you when i incorporate something, and hopefully we can edit that towards something that would be an improvement.Mikecurry1 (talk)

 * I just incorporated the section 'Reputation and Rankings' as per your idea. It was a good one.  It can be edited further, and I am sure editors will want to as it is not perfect yet, and will get better.  It was a good idea to incorporate that section though. Mikecurry1 (talk)

 * Looks like a good start. I tracked down some expert opinion sources when doing edits to the reputation and rankings sections of the Cambridge and Durham articles, some of which mention Imperial (quite a few older sources just talk about 'London'), you might want to take a look at those. It's normally better to base reputation statements on reports of expert opinion (c.f. WP:REPUTATIONS) rather than on rankings, which show how an institution performed in the measures used by that ranking rather than what their reputation is. Robminchin (talk) 15:43, 18 March 2024 (UTC)
 * I checked out the Cambridge and Durham articles reputation sections for their edits, they looked good. For anyone wanting to update the new reputation section it is always appreciated, especially improving the expert opinion citations re:WP:REPUTATIONS.   Yes, it makes sense to base it on expert opinions instead of relying on only rankings.   I am glad you thought it looked good at your initial review.  I am sure editors will want to improve it over time. Great idea for the new reputation section!  Cheers, Mikecurry1 (talk) 17:43, 18 March 2024 (UTC)

Update Logo
Should the new logo be updated to the new Imperial one?  example outside of buildings:

Mikecurry1 (talk) 17:46, 17 March 2024 (UTC)

New Ranking Section (writing instead of bullet points)
I thought it was a really well written new ranking section. I thought the last version you wrote was better before my edit was reverted. I will go back to the last version you wrote and then we can add from there.

In terms of the Europe part, I do understand about not refactoring rankings. there are many other wikis that write about its rank within europe as i think some of these qs and the have that. Is it that you like the sound of it better just as one international ranking? I do understand about some of the specialty rankings not being meant for europe.

I think the reason I always liked the european rankings, is because it gives context as many of the other rankings base their rankings around the US schools, so you can see a context outside of the US how schools are ranked, such as in Europe or the UK. For example, on the US News most of their top 50 global rankings are from US schools. I do truly understand about the refractory rankings though, which I think is a fair point. I think that was the only edit I had off of yours which was possibly contenous. Otherwise I liked your last version and am happy using that.

I thought it was nicely written up how you wrote about the most salient contextual points without going into too much outside detail, which I thought was similar to how oxfords ranking section was written. Mikecurry1 (talk) 00:51, 3 July 2024 (UTC)

 * Thanks. There are a couple of reasons behind not refactoring the rankings. The first, from a logical viewpoint, is that specific rankings for regions will use different information and will weight factors that might be more or less relevant in that region differently. Basically, the global rankings aim to do the best job at comparing universities globally, while a European ranking aims to do the best job at comparing universities in Europe and a British ranking aims to do the best job at comparing universities in the UK. The second, from a Wikipedia use-of-sources point of view (which may well be what is behind the advice in WP:UNIGUIDE), is that rankings are WP:PRIMARY sources for the outcome of the ranking analysis, so should have only minimal, if any, interpretation. I.e., they should be presented in the context in which they were derived. Robminchin (talk) 01:37, 3 July 2024 (UTC)
 * Indeed, those are all good reasons you listed. I do understand that rankings should have minimal interpretation, and that rankings are specific to regions in terms of how they were meant to be used.  I agree with your points, so I am glad you explained it here.  I think that was the main source of the editing back and forth, was over that.  I am good with that.
 * It sounds like from what you were saying if there were one or two rankings specifically meant for the European region that would be appropriate there, then we can both have the points we were trying to make with my region specific rankings to add context, and your not extrapolating from the rankings into a European context when the ranking was meant for that. Then we both can have what are interest was in those edits, so I can add a broader European context, and you can have only rankings with minimal interpretation.  I will aim for that then.
 * The rest of your writing of the section I liked, so was good with using it as it well written. I may do small edits around it, but I do not think there will be any source of contention between edits, and any possible contentious edits I will discuss here.  Thanks for the nice explanation and well written section.  ::I will also continue to revert back some of the changes I made on other pages that had extrapolated rankings from an international context with interpretation into a more regional or local context, to aim for using rankings with only minimal interpretations.  Mikecurry1 (talk)
 * Excellent. Yes, if there are actual Europe-specific rankings (like the European Teaching ranking THE published briefly, or the Reuter's Europe's Most Innovative Universities, which also seems to have been dropped) those would be absolutely fine. Robminchin (talk) 20:50, 3 July 2024 (UTC)

title: Talk:Imperial College London


text:
Baron Coleridge

Baron Coleridge, of Ottery St Mary in the County of Devon, is a title in the Peerage of the United Kingdom. It was created in 1874 for the prominent lawyer, judge and Liberal politician Sir John Coleridge. He served as Lord Chief Justice of England from 1880 to 1894. His son, the second Baron, represented Attercliffe in the House of Commons and served as a Judge of the High Court of Justice. the title is held by the latter's great-grandson, the fifth Baron, who succeeded in 1984.

The first Baron was the son of Sir John Taylor Coleridge and the great-nephew of the poet Samuel Taylor Coleridge.

The ancestral home of the Coleridge family is The Chanter's House in Ottery St Mary. In October 2006 the increasing costs of maintaining the property caused the family trust to put the property up for sale and auction the contents.

Barons Coleridge (1874 onwards)

 * John Duke Coleridge, 1st Baron Coleridge (1821–1894)
 * Bernard John Seymour Coleridge, 2nd Baron Coleridge (1851–1927)
 * Geoffrey Duke Coleridge, 3rd Baron Coleridge (1877–1955)
 * Richard Duke Coleridge, 4th Baron Coleridge (1905–1984)
 * William Duke Coleridge, 5th Baron Coleridge (b. 1937)

The heir apparent is the present holder's only son The Hon. James Duke Coleridge (b. 1967) The heir apparent's heir presumptive is his uncle Hon. Samuel John Taylor Coleridge (b. 1942) Next in line is the present holder's cousin Syndercombe James Duke Coleridge (b. 1941), a grandson of the 3rd Baron. He has two sons, Robert James Duke (b. 1979) and Nicholas John (b. 1981).

title: Baron Coleridge


text:
Latin school

The Latin school was the grammar school of 14th- to 19th-century Europe, though the latter term was much more common in England. Other terms used include Lateinschule in Germany, or later Gymnasium. Latin schools were also established in Colonial America.

Emphasis was placed on learning Latin, initially in its Medieval Latin form. Grammar was the most basic part of the trivium and the Liberal arts. Latin schools aimed to prepare students for university, as well as seeking to enable those of middle-class status to rise above their station. It was therefore not unusual for children of commoners to attend Latin schools, especially if they were expected to pursue a career within the church. Although Latin schools existed in many parts of Europe in the 14th-century and were more open to the laity, prior to that the Church allowed for Latin schools for the sole purpose of training those who would one day become clergymen. Latin schools began to develop to reflect Renaissance humanism around the 1450s. In some countries, but not England, they later lost their popularity as universities and some Catholic orders began to prefer the vernacular.

Medieval background
Medieval Europe thought of grammar as a foundation from which all forms of scholarship should originate. Grammar schools otherwise known as Latin schools taught Latin by using Latin. Latin was the language used in nearly all academic and most legal and administrative matters, as well as the language of the liturgy. Some of the laity, though not instructed formally, spoke and wrote some Latin. Courts, especially church courts, used Latin in their proceedings, although this was even less accessible than the vernacular to the lower classes, who often could not read at all, let alone Latin.

Students often studied in Latin school for about five years, but by their third year, students would be deemed as "knowledgeable enough" in Latin grammar to assist the master teacher in teaching the younger or less skilled pupils. Most boys began at the age of seven but older men who wanted to study were not discouraged as long as they could pay the fees. Students usually finished their schooling during their late teens, but those who desired to join the priesthood had to wait until they were twenty-four in order to get accepted. There was usually a limit to how long a student could stay in school, although if a relative was one of the school's founders then an extended stay was possible.

Schools were managed by appointing a committee who then employed a teacher and paid their salary. These schools usually had limited supervision from the town authorities. Freelance Latin masters opened up their own schools quite frequently and would provide Latin education to anyone willing to pay. These freelance schools usually taught students in the master's home. Others taught as a tutor in a student's household by either living there or making daily visits to teach. Students ranged from those who were members of the peasantry to those of the elite. If a serf's child wanted to go to school, payment given to the lord was required (to replace the value of his labour) as well as his consent.

Renaissance and Early Modern perceptions
As Europeans experienced the intellectual, political, economic and social innovations of the Renaissance so did their attitudes towards Medieval Latin schools. Renaissance humanists criticized Medieval Latin calling it "barbaric jargon". Scholars like the Dutch humanist, Desiderius Erasmus (1466–1536), denounced the church and the way it taught. He desired that a Renaissance in the Roman Catholic Church should accompany the study of the classics. Humanist ideas became so influential that residents in Italian states began to call for a new kind of education in Latin. Schools and academies that centred on instructing classical literature, history, rhetoric, dialectic, natural philosophy, arithmetic, medieval texts, the Greek language, as well as modern foreign languages, emerged. They called this new curriculum the Studia Humanitatis. Latin school formed the basis of education in the elite Italian city-states. Positions such as headmaster of grammar schools or professor of Latin grammar, rhetoric and dialect, were filled in by erudite humanists. Guarino da Verona, another humanist, devised three stages for humanistic learning: the elementary, the grammatical and the rhetorical. Humanists held the belief that by being a learned individual they were contributing to society. Hence, humanistic education constituted the intermediate and advanced levels for most of the urban population. It created an opportunity to advance an individual's social status since more institutions intellectual, political and economic sought workers who possessed a background in classical Latin as well as training in humanistic scripts.

Still considered as the language of the learned, Latin was esteemed and used frequently in the academic field. However, at the start of the 14th century, writers started writing in the vernacular. Due to this event and the common practice of interweaving Latin with a dialect even at advanced stages in learning, the precedence of Latin schools from other pedagogical institutions diminished.

Latin church schools
Clergy often funded ecclesiastical schools where clerics taught. Many historians argue that up until 1300 the Church had a monopoly on education in Medieval Italy. Latin church schools seemed to appear around the 12th century, however very few remained after the 14th century as a vernacular, more definite form of Latin school emerged in Italy. In some areas in Spain during the late 15th century, the church encouraged priests and sacristans to train others in reading and writing.

After the Protestant Reformation, the Catholic Church tried to deal with the surfacing of Protestant Latin schools that involved itself with orienting church authorities and pastors. John Calvin, a reformer, taught Latin grammar along with the Geneva catechism. Nevertheless, there were some reformers who wanted to cease using Latin in worship, finding the vernacular a more efficient language to use. In the latter part of the 16th century, the Catholic Counter-Reformation supported the establishment of municipal schools. Jesuits founded their own schools and offered free training in Latin grammar, Philosophy, Theology, Geography, Religious Doctrine and History for boys. It was important for Jesuits as well as the Catholic Reformation to instruct clergymen as well as laymen in this type of education. The Jesuits pursued the significance of education to their order and took over the teaching responsibilities in Latin schools and secondary schools along with other Catholic orders in several Catholic areas.

Latin school curriculum
The Latin school curriculum was based mainly on reading Classical and some Medieval authors. Students had to learn the principles of Ars Dictaminis in order to learn how to write formal letters. Authors often had lists of books that were supposed to be used in the curriculum that would teach students grammar. These texts however, were often not the original texts, as more often than not, texts were changed to include moral stories or to display rules of grammar. These were usually in the form of fables or poems. New students generally started off with easy basic grammar, and steadily moved into harder Latin readings such as the Donatus (Ars Minor stage), which was a syntax manual that was memorized, or even more advanced with glossaries and dictionaries. Although many teachers used many books that varied from person to person, the most popular textbook would have been the Doctrinale. The Doctrinale was a long verse of Latin grammar. This textbook dealt with parts of speech, syntax, quantity and meter, as well as figures of speech. The Doctrinale as well as a large sum of other books (though not nearly as popular) was often referred to as the "canon of textbooks". Similarly, as the student advanced into the Ars Dictaminis stage more theory and practice writing formal or prose letters were focused on. Poetry was often a teachers favorite as it taught not only Latin, but mnemonic value and "truth". Poetry was not chiefly studied during the medieval times, although some classic poems were taken into the curriculum. However, during the Renaissance, pupils greatly studied poetry in order to learn metrics and style. As well, it was viewed as a broader study of Latin grammar and rhetoric, which often included concepts, and analysis of words

Ars Dictaminis
Ars Dictaminis was an area of study that was created in the latter part of the Middle Ages as a response to the demand for social communication as offices for religious and political leaders increased. Rhetoric was seen as a method of persuasion and so there were five distinct aspects of Ars Dictaminis that assured this. These five elements were: "how to word a question; how to dispose material; how to find the right words and effective stylistic devices; how to commit everything to memory; how to find the right intonation and suitable gestures". During the Renaissance however, rhetoric developed into the study of how to write official and private letters as well as records. The revised Ars Dictaminis took its guidelines from one of Cicero's works, the de inventione and pseudo-Ciceronian Rhetorica ad Herennium. There were five main parts: the salutatio (salutation), benevolentiae (winning the agreement of the recipient through the arrangement of words), narratio (the point of the discussion), petitio (petition), and conclusio (conclusion). This systematic presentation was attributed to the Medieval preference for hierarchal organization.

Studia Humanitatis
Studia Humanitatis was the new curriculum founded in the Early Modern Era by humanists. In order to be able to move forward academically, a firm foundation in Studia Humanitatis starting from elementary school was necessary. Those who studied under Ars Dictaminis but did not have this background found it difficult to get accepted into chanceries following the year 1450. Those who did study under this discipline were taught classical literature, history, rhetoric, dialectic, natural philosophy, arithmetic, some medieval texts, Greek as well as modern foreign languages. The use of pagan authors became more common as the church became less involved with the humanistic method used in academic institutions before university. Colloquies (1518), a book containing dialogues written for the study of Latin grammar, was written by Erasmus and became one of the most popular books of its time. Students of Studia Humanitatis were seen as well prepared for occupations pertaining to politics or business. Learning the classics and other subjects in this curriculum enabled the individual to speak, argue and write with eloquence and relevance.

Other institutions
Early Modern children were first taught to read and write the vernacular and were then sent to Latin schools. If the parents were financially able, the child went even before he learned to read or write if the opportunity was present. Men were the usual students since women were either taught at home or in nunneries. Subsequent to the Council of Trent's decision to cloister all female religious, female orders such as Ursulines and Angelicals conducted their own schools within their convents. University was the final stage of academic learning and within its walls Latin was the language of lectures and scholarly debates. Jews however, including those who were converted into Christianity, were not allowed to teach so they developed their own schools which taught Doctrine, Hebrew and Latin.

Latin schools in colonial North America and the US
Latin schools, on the same model, were founded in North America, importing the European methods of education. The first of these was Boston Latin School, founded in 1635. These fed early universities such as Harvard, with students capable of speaking, reading and debating in Latin. The challenge to the Latin, Greek and "classical" domination of education came earlier than in Europe, but the tradition continued at a diminished level through the twentieth century. A number of "Latin Schools" still exist in the US, some of which teach Latin, while others do not.

title: Latin school


text:
User:TakuyaMurata/Symbiotic algorithm

Symbiotic Algorithm

Keywords
Computer Science, Algorithms, Neural Networks, Multiple Agent Systems (MAS), Brain Research, Connectionism, Neuro-philosophy, Consiouseness, Emergence

Preface
Symbiotic Algorithm research is a new topic, first discussed here on Wikipedia.

In grade-school arithmetic we are taught that 1000 + 1  =   1 + 1000    =    1001

This is true, unless the numbers represent money which you are being paid,  and the arithmetic is time dependant. In which case if you get $1000 this week and $1 the next, it is NOT the same as getting $1 this week and $1000 the next. Especially if you need those $1000 to buy something important this week.

In algorithm research there is a similar paradigm. Much thought has been put into finding the order of time it can take an algorithm to complete. Then more thought was given to qualifying and categorizing algorithms which can never be completed, those which should take forever to complete etc.

Algorithm theory shows that time vs. space domain are interchangeable, and an algorithm which takes forever to complete sequencially will take up infinite space to complete in parallel, even if we give each bit of information or processing a space of molecular scale.

As can be seen on the Wikipedia entry for Parallel Algorithms, creating algorithms of this kind is highly complex, planning them - even harder, and hardest of all is finding converging patterns of behavior and proving that these parallel systems will in fact solve the problem, and in what order of time and space.

As opposed to other Parallel Algortithms, Symbiotic Algorithms can be understood, are quite simple in their construction, can be automatically evolved or emergent, and most importantly, can be shown to converge to a solution in restricted time and space.

Symbiotic Algorithms
Symbiotic Algorithms are Parallel Algorithms which resolve in time, building on temporary knowledge available at the time, and constructing multiple versions of solutions. Chosen actions or selected solutions can be time dependant and time constricted.

Various different Multiple Symbiotic Algorithms running concurrently, may congregate automatically or be grouped together manually, either statically at design time or dynamically during run time, to create Symbiotic Clusters.

Similar to Multiple Agent Systems, these clusters communicate between each other in a Challenge-Response-Contract communication scheme, or in an Event Driven scheme. When an event driven communication scheme is used, an additional interupt level is utilized by the recieving components. This interupt level may vary in time or may be set to correspond to the level of processed information, allowing less interuption as time proceeds or as enough information becomes available.

Characteristics
Symbiotic Algorithms are NOT necessarily Emergent Algorithms.

A Symbiotic algorithm is an algorithm that has the following characteristics:

 * works in parallel and independently of any other clusters and algorithms running in the system.
 * it can work on partial information, or gives partial information during its process to other Symbiotic algorithms.
 * it can vary with time or with amount of information accumalated.
 * it is constrained in time and/or in conjunction with activity of other Symbiotic algorithms.
 * is expected to run in redundant multiplicity, so that several Symbiotic Clusters will be working to achieve the same result at the same time.
 * These clusters are NOT necessarily the same, but may be so.

Symbiotic Cluster Types

 * Symbiotic Meta-Clusters
 * Emerging Symbiotic Clusters (Evolving Symbiosis)
 * Symbiotic Cluster Structures
 * Multiple Agent Symbiotic Clusters
 * Neural Network Symbiotic Clusters
 * Symbiotic Embedded Clusters

"pet dog" Paradigm
A classic example explaining this is the "pet dog" OCR, pattern recognition and neural network problem, where there are two words. The first is: pet and the second word is: dog.

But in both cases the middle letter (e or o), presented to the subjects, (whether people or machines trying to "read" the message), is the same image, something between an o and an e, similar to an upside down G.

The "pet dog" Processing Problems
There are several different processes happening:

1. Edge detection: Where are the edges of the image. The p for example is built of: one verticle left long line : | two short horizontal lines : = and one short right verticle line. 2. Letter recognition: Where, for example, a letter which goes under the printed line, can be: p, g, j or q '''3. Word recognition by letters:''' Word starting with d and ending with g...  dug dig dag dsg dog? 4. Word recognition by context  (of other word) pet d_g Now thats easy: pet animal. Animal thats in home.... cat or dog...

'''5. Sentence recognition.... '''

'''6. Phonetic recognition: "'d_g', hmm, that sounds to my ears like dog..." '''

etc.

To Be Completed
Stay tuned!

Personal Rapid Transportation

 * http://www.maitint.org
 * http://www.transportationet.com
 * http://www.skytran.net

Multiple Agent Systems

 * Prof. Sarit Kraus - on emergent shortest path algorithms

Graph Theory

 * The Minimum spanning tree problem and other graph theory algorithms explained.

Neural Networks Explained by Component

 * You can look into a Neural Network and understand it!

title: User:TakuyaMurata/Symbiotic algorithm


text:
Baron Cottesloe

Baron Cottesloe, of Swanbourne and Hardwick in the County of Buckingham, is a title in the Peerage of the United Kingdom. It was created on 2 March 1874 for the Conservative politician and former Chief Secretary for Ireland, Sir Thomas Fremantle, 1st Baronet (1798–1890). He was the son of Admiral Sir Thomas Fremantle (1765–1819). Lord Cottesloe had already been created a Baronet, of Swanbourne in the County of Buckingham, on 14 August 1821, chiefly in recognition of his father's services, and with remainder to the latter's heirs. His father Sir Thomas Fremantle was created Baron Fremantle, of the Austrian Empire, which Lord Cottesloe inherited in 1819 with the death of his father. Subsequently, in 1822 he was given a Royal licence, which authorized him and his successors to use the title in Britain. However, a warrant issued on 27 April 1932 withdrew all the royal licences, only allowing the use of the title to the then current holders, their heir (if any was born) and their heir's heir (if any was born). The fifth baron was the last holder being allowed to use the Austrian title in the United Kingdom.

History
The 1st Baron Cottesloe was succeeded by his eldest son, Thomas Fremantle, 2nd Baron Cottesloe. He represented Buckinghamshire in the House of Commons as a Conservative. His son, the 3rd Baron, served as Lord Lieutenant of Buckinghamshire. The latter's grandson, the fifth Baron, who succeeded his father in 1994, also served as Lord Lieutenant of Buckinghamshire between 1984 and 1997. , the title is held by his son, the sixth baron, who succeeded in that year.

Several other members of the Fremantle family have also gained distinction. William Henry Fremantle, uncle of the first Baron, was a politician. John Fremantle, son of Colonel Stephen Fremantle, uncle of the first Baron, was a major-general in the army. He was the father of 1) General Sir Arthur Fremantle and of 2) FitzRoy William Fremantle, a major-general in the Coldstream Guards. Sir Charles Fremantle, brother of the first Baron, was a naval commander. The town of Fremantle, Western Australia, is named after him. The Very Reverend the Hon. William Robert Fremantle, brother of the first Baron, was Dean of Ripon. The Very Reverend the Hon. William Henry Fremantle, second son of the first Baron, was Dean of Ripon and Canon of Canterbury. His second son Sir Francis Edward Fremantle was a Conservative politician. The Hon. Sir Charles Fremantle (1834–1915), third son of the first Baron, was an administrator with the Suez Canal Company. The Hon. Sir Edmund Fremantle, fourth son of the first Baron, was an admiral in the Royal Navy. He was the father of 1) Admiral Sir Sydney Fremantle and 2) Sir Selwyn Fremantle, an administrator in India.

Baron Fremantle of the Austrian Empire (1816–2018)

 * Admiral Thomas Francis Fremantle, 1st Baron Fremantle (1765–1818)

Fremantle Baronets (1821–1874)

 * Sir Thomas Francis Fremantle, 1st Baronet, 2nd Baron Fremantle (1798–1890), created Baron Cottesloe in 1874

Barons Cottesloe (1874–present)
The heir presumptive is the present holder's half uncle Hon. Edward Walgrave Fremantle (born 1961)
 * Thomas Francis Fremantle, 1st Baron Cottesloe, 2nd Baron Fremantle (1798–1890)
 * Thomas Francis Fremantle, 2nd Baron Cottesloe, 3rd Baron Fremantle (1830–1918)
 * Thomas Francis Fremantle, 3rd Baron Cottesloe, 4th Baron Fremantle (1862–1956)
 * John Walgrave Halford Fremantle, 4th Baron Cottesloe, 5th Baron Fremantle (1900–1994)
 * John Tapling Fremantle, 5th Baron Cottesloe, 6th Baron Fremantle (1927–2018)
 * Thomas Henry Fremantle, 6th Baron Cottesloe (born 1966)

The heir presumptive's heir apparent is his son Henry John Fremantle (born 1996)

title: Baron Cottesloe


text:
RSA numbers

In mathematics, the RSA numbers are a set of large semiprimes (numbers with exactly two prime factors) that were part of the RSA Factoring Challenge. The challenge was to find the prime factors of each number. It was created by RSA Laboratories in March 1991 to encourage research into computational number theory and the practical difficulty of factoring large integers. The challenge was ended in 2007.

RSA Laboratories (which is an initialism of the creators of the technique; Rivest, Shamir and Adleman) published a number of semiprimes with 100 to 617 decimal digits. Cash prizes of varying size, up to US$200,000 (and prizes up to $20,000 awarded), were offered for factorization of some of them. The smallest RSA number was factored in a few days. Most of the numbers have still not been factored and many of them are expected to remain unfactored for many years to come. , the smallest 23 of the 54 listed numbers have been factored.

While the RSA challenge officially ended in 2007, people are still attempting to find the factorizations. According to RSA Laboratories, "Now that the industry has a considerably more advanced understanding of the cryptanalytic strength of common symmetric-key and public-key algorithms, these challenges are no longer active." Some of the smaller prizes had been awarded at the time. The remaining prizes were retracted.

The first RSA numbers generated, from RSA-100 to RSA-500, were labeled according to their number of decimal digits. Later, beginning with RSA-576, binary digits are counted instead. An exception to this is RSA-617, which was created before the change in the numbering scheme. The numbers are listed in increasing order below.

Note: until work on this article is finished, please check both the table and the list, since they include different values and different information.

RSA-100
RSA-100 has 100 decimal digits (330 bits). Its factorization was announced on April 1, 1991, by Arjen K. Lenstra. Reportedly, the factorization took a few days using the multiple-polynomial quadratic sieve algorithm on a MasPar parallel computer.

The value and factorization of RSA-100 are as follows:

RSA-100 = 1522605027922533360535618378132637429718068114961380688657908494580122963258952897654000350692006139

RSA-100 = 37975227936943673922808872755445627854565536638199 × 40094690950920881030683735292761468389214899724061

It takes four hours to repeat this factorization using the program Msieve on a 2200 MHz Athlon 64 processor.

The number can be factorized in 72 minutes on overclocked to 3.5 GHz Intel Core2 Quad q9300, using GGNFS and Msieve binaries running by distributed version of the factmsieve Perl script.

RSA-110
RSA-110 has 110 decimal digits (364 bits), and was factored in April 1992 by Arjen K. Lenstra and Mark S. Manasse in approximately one month.

The number can be factorized in less than four hours on overclocked to 3.5 GHz Intel Core2 Quad q9300, using GGNFS and Msieve binaries running by distributed version of the factmsieve Perl script.

The value and factorization are as follows:

RSA-110 = 35794234179725868774991807832568455403003778024228226193532908190484670252364677411513516111204504060317568667

RSA-110 = 6122421090493547576937037317561418841225758554253106999 × 5846418214406154678836553182979162384198610505601062333

RSA-120
RSA-120 has 120 decimal digits (397 bits), and was factored in June 1993 by Thomas Denny, Bruce Dodson, Arjen K. Lenstra, and Mark S. Manasse. The computation took under three months of actual computer time.

The value and factorization are as follows:

RSA-120 = 227010481295437363334259960947493668895875336466084780038173258247009162675779735389791151574049166747880487470296548479

RSA-120 = 327414555693498015751146303749141488063642403240171463406883 × 693342667110830181197325401899700641361965863127336680673013

RSA-129
RSA-129, having 129 decimal digits (426 bits), was not part of the 1991 RSA Factoring Challenge, but rather related to Martin Gardner's Mathematical Games column in the August 1977 issue of Scientific American.

RSA-129 was factored in April 1994 by a team led by Derek Atkins, Michael Graff, Arjen K. Lenstra and Paul Leyland, using approximately 1600 computers from around 600 volunteers connected over the Internet. A US$100 token prize was awarded by RSA Security for the factorization, which was donated to the Free Software Foundation.

The value and factorization are as follows:

RSA-129 = 114381625757888867669235779976146612010218296721242362562561842935706935245733897830597123563958705058989075147599290026879543541

RSA-129 = 3490529510847650949147849619903898133417764638493387843990820577 × 32769132993266709549961988190834461413177642967992942539798288533

The factorization was found using the Multiple Polynomial Quadratic Sieve algorithm.

The factoring challenge included a message encrypted with RSA-129. When decrypted using the factorization the message was revealed to be "The Magic Words are Squeamish Ossifrage".

In 2015, RSA-129 was factored in about one day, with the CADO-NFS open source implementation of number field sieve, using a commercial cloud computing service for about $30.

RSA-130
RSA-130 has 130 decimal digits (430 bits), and was factored on April 10, 1996, by a team led by Arjen K. Lenstra and composed of Jim Cowie, Marije Elkenbracht-Huizing, Wojtek Furmanski, Peter L. Montgomery, Damian Weber and Joerg Zayer.

The value and factorization are as follows:

RSA-130 = 1807082088687404805951656164405905566278102516769401349170127021450056662540244048387341127590812303371781887966563182013214880557

RSA-130 = 39685999459597454290161126162883786067576449112810064832555157243 × 45534498646735972188403686897274408864356301263205069600999044599

The factorization was found using the Number Field Sieve algorithm and the polynomial

5748302248738405200 x5 + 9882261917482286102 x4 - 13392499389128176685 x3 + 16875252458877684989 x2 +  3759900174855208738 x1 - 46769930553931905995

which has a root of 12574411168418005980468 modulo RSA-130.

RSA-140
RSA-140 has 140 decimal digits (463 bits), and was factored on February 2, 1999, by a team led by Herman te Riele and composed of Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Paul Leyland, Walter Lioen, Peter L. Montgomery, Brian Murphy and Paul Zimmermann.

The value and factorization are as follows:

RSA-140 = 21290246318258757547497882016271517497806703963277216278233383215381949984056495911366573853021918316783107387995317230889569230873441936471

RSA-140 = 3398717423028438554530123627613875835633986495969597423490929302771479 × 6264200187401285096151654948264442219302037178623509019111660653946049

The factorization was found using the Number Field Sieve algorithm and an estimated 2000 MIPS-years of computing time.

RSA-150
RSA-150 has 150 decimal digits (496 bits), and was withdrawn from the challenge by RSA Security. RSA-150 was eventually factored into two 75-digit primes by Aoki et al. in 2004 using the general number field sieve (GNFS), years after bigger RSA numbers that were still part of the challenge had been solved.

The value and factorization are as follows:

RSA-150 = 155089812478348440509606754370011861770654545830995430655466945774312632703463465954363335027577729025391453996787414027003501631772186840890795964683

RSA-150 = 348009867102283695483970451047593424831012817350385456889559637548278410717 × 445647744903640741533241125787086176005442536297766153493419724532460296199

RSA-155
RSA-155 has 155 decimal digits (512 bits), and was factored on August 22, 1999, in a span of six months, by a team led by Herman te Riele and composed of Stefania Cavallar, Bruce Dodson, Arjen K. Lenstra, Walter Lioen, Peter L. Montgomery, Brian Murphy, Karen Aardal, Jeff Gilchrist, Gerard Guillerm, Paul Leyland, Joel Marchand, François Morain, Alec Muffett, Craig Putnam, Chris Putnam and Paul Zimmermann.

The value and factorization are as follows:

RSA-155 = 10941738641570527421809707322040357612003732945449205990913842131476349984288934784717997257891267332497625752899781833797076537244027146743531593354333897

RSA-155 = 1026395928297411057720541965739916759007165678080380668033419335217907113077 79        × 1066034883801684548209272203600128786792079585759892915222706082371930628086           43

The factorization was found using the general number field sieve algorithm and an estimated 8000 MIPS-years of computing time.

RSA-160
RSA-160 has 160 decimal digits (530 bits), and was factored on April 1, 2003, by a team from the University of Bonn and the German Federal Office for Information Security (BSI). The team contained J. Franke, F. Bahr, T. Kleinjung, M. Lochter, and M. Böhm.

The value and factorization are as follows:

RSA-160 = 2152741102718889701896015201312825429257773588845675980170497676778133145218859135673011059773491059602497907111585214302079314665202840140619946994927570407753

RSA-160 = 4542789285848139407168619064973883165613714577846979325095998470925000415733 5359        × 4738809060383201619663383230378895197326892292104095794474135464881202849390           9367

The factorization was found using the general number field sieve algorithm.

RSA-170
RSA-170 has 170 decimal digits (563 bits) and was first factored on December 29, 2009, by D. Bonenberger and M. Krone from Fachhochschule Braunschweig/Wolfenbüttel. An independent factorization was completed by S. A. Danilov and I. A. Popovyan two days later.

The value and factorization are as follows:

RSA-170 = 26062623684139844921529879266674432197085925380486406416164785191859999628542069361450283931914514618683512198164805919882053057222974116478065095809832377336510711545759

RSA-170 = 3586420730428501486799804587268520423291459681059978161140231860633948450858 040593963        × 7267029064107019078863797763923946264136137803856996670313708936002281582249           587494493

The factorization was found using the general number field sieve algorithm.

RSA-576
RSA-576 has 174 decimal digits (576 bits), and was factored on December 3, 2003, by J. Franke and T. Kleinjung from the University of Bonn. A cash prize of $10,000 was offered by RSA Security for a successful factorization.

The value and factorization are as follows:

RSA-576 = 188198812920607963838697239461650439807163563379417382700763356422988859715234665485319060606504743045317388011303396716199692321205734031879550656996221305168759307650257059

RSA-576 = 3980750864240649373971255005503864911990643623425267084063851895759463889572 61768583317        × 4727721461074353025362230719730482246329146953020971164598521711305207112563           63590397527

The factorization was found using the general number field sieve algorithm.

RSA-180
RSA-180 has 180 decimal digits (596 bits), and was factored on May 8, 2010, by S. A. Danilov and I. A. Popovyan from Moscow State University, Russia.

RSA-180 = 1911479277189866096892294666314546498129862462766673548641885036388072607034 3679905877620136513516127813425829612810920004670291298456875280033022177775          2773957404540495707851421041

RSA-180 = 4007800823297508779525813391041005725268293178158071765648821789984975727719 50624613470377        × 4769396887386118369955354773570708579399020760277882320319897758246062255957           73435668861833

The factorization was found using the general number field sieve algorithm implementation running on three Intel Core i7 PCs.

RSA-190
RSA-190 has 190 decimal digits (629 bits), and was factored on November 8, 2010, by I. A. Popovyan from Moscow State University, Russia, and A. Timofeev from CWI, Netherlands.

RSA-190 = 1907556405060696491061450432646028861081179759533184460647975622318915025587 1841757540549761551215932934922604641526300932385092466032074171247261215808          58185985938946945490481721756401423481

RSA-190 = 3171195257690152709485171289740475929805147316029450327784761927832793642798 1256542415724309619        × 6015260020444561641587641685526676183243543359471811072599763828083615704046           0481625355619404899

RSA-640
RSA-640 has 193 decimal digits (640 bits). A cash prize of US$20,000 was offered by RSA Security for a successful factorization. On November 2, 2005, F. Bahr, M. Boehm, J. Franke and T. Kleinjung of the German Federal Office for Information Security announced that they had factorized the number using GNFS as follows:

RSA-640 = 3107418240490043721350750035888567930037346022842727545720161948823206440518 0815045563468296717232867824379162728380334154710731085019195485290073377248          22783525742386454014691736602477652346609

RSA-640 = 1634733645809253848443133883865090859841783670033092312181110852389333100104 508151212118167511579        × 1900871281664822113126851573935413975471896789968515493666638539088027103802           104498957191261465571

The computation took five months on 80 2.2 GHz AMD Opteron CPUs.

The slightly larger RSA-200 was factored in May 2005 by the same team.

RSA-200
RSA-200 has 200 decimal digits (663 bits), and factors into the two 100-digit primes given below.

On May 9, 2005, F. Bahr, M. Boehm, J. Franke, and T. Kleinjung announced that they had factorized the number using GNFS as follows:

RSA-200 = 2799783391122132787082946763872260162107044678695542853756000992932612840010 7609345671052955360856061822351910951365788637105954482006576775098580557613          579098734950144178863178946295187237869221823983

RSA-200 = 3532461934402770121272604978198464368671197400197625023649303468776121253679 423200058547956528088349        × 7925869954478333033347085841480059687737975857364219960734330341455767872818           152135381409304740185467

The CPU time spent on finding these factors by a collection of parallel computers amounted – very approximately – to the equivalent of 75 years work for a single 2.2 GHz Opteron-based computer. Note that while this approximation serves to suggest the scale of the effort, it leaves out many complicating factors; the announcement states it more precisely.

RSA-210
RSA-210 has 210 decimal digits (696 bits) and was factored in September 2013 by Ryan Propper:

RSA-210 = 2452466449002782119765176635730880184670267876783327597434144517150616008300 3858721695220839933207154910362682719167986407977672324300560059203563124656          1218465817904100131859299619933817012149335034875870551067

RSA-210 = 4359585683259407917999519653872144063854709102652201963187054821445240853452 75999740244625255428455944579        × 5625457617268841037562770073044474817438769440075105451049468510945483965774           79473472146228550799322939273

RSA-704
RSA-704 has 212 decimal digits (704 bits), and was factored by Shi Bai, Emmanuel Thomé and Paul Zimmermann. The factorization was announced July 2, 2012. A cash prize of US$30,000 was previously offered for a successful factorization.

RSA-704 = 7403756347956171282804679609742957314259318888923128908493623263897276503402 8266276891996419625117843995894330502127585370118968098286733173273108930900          552505116877063299072396380786710086096962537934650563796359

RSA-704 = 9091213529597818878440658302600437485892608310328358720428512168960411528640 933367824950788367956756806141        × 8143859259110045265727809126284429335877899002167627883200914172429324360133           004116702003240828777970252499

RSA-220
RSA-220 has 220 decimal digits (729 bits), and was factored by S. Bai, P. Gaudry, A. Kruppa, E. Thomé and P. Zimmermann. The factorization was announced on May 13, 2016.

RSA-220 = 2260138526203405784941654048610197513508038915719776718321197768109445641817 9666766085931213065825772506315628866769704480700018111497118630021124879281          99487482066070131066586646083327982803560379205391980139946496955261

RSA-220 = 6863656412267566274382371499288437800130842239979164844621244993321541061441 4642667938213644208420192054999687        × 3292907439486349812049301549212935291916455196536233952462686051169290349309           4652463337824866390738191765712603

RSA-230
RSA-230 has 230 decimal digits (762 bits), and was factored by Samuel S. Gross on August 15, 2018.

RSA-230 = 1796949159794106673291612844957324615636756180801260007088891883553172646034 1490933493372247868650755230855864199929221814436684722874052065257937495694          3483892631711525225256544109808191706117425097024407180103648316382885188526           89

RSA-230 = 4528450358010492026612439739120166758911246047493700040073956759261590397250 033699357694507193523000343088601688589        × 3968132623150957588532394439049887341769533966621957829426966084093049516953           598120833228447171744337427374763106901

RSA-232
RSA-232 has 232 decimal digits (768 bits), and was factored on February 17, 2020, by N. L. Zamarashkin, D. A. Zheltkov and S. A. Matveev.

RSA-232 = 1009881397871923546909564894309468582818233821955573955141120516205831021338 5285453743661097571543636649133800849170651699217015247332943892702802343809          6090980497644054071120196541074755382494867277137407501157718230539834060616           2079

RSA-232 = 2966909333208360660361779924242630634742946262521852394401857157419437019472 3262390744910112571804274494074452751891        × 3403816175197563438006609498491521420547121760734723172735163413276050706174           8526506443144325148088881115083863017669

RSA-768
RSA-768 has 232 decimal digits (768 bits), and was factored on December 12, 2009, over the span of two years, by Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Pierrick Gaudry, Alexander Kruppa, Peter Montgomery, Joppe W. Bos, Dag Arne Osvik, Herman te Riele, Andrey Timofeev, and Paul Zimmermann.

RSA-768 = 1230186684530117755130494958384962720772853569595334792197322452151726400507 2636575187452021997864693899564749427740638459251925573263034537315482685079          1702612214291346167042921431160222124047927473779408066535141959745985690214           3413

RSA-768 = 3347807169895689878604416984821269081770479498371376856891243138898288379387 8002287614711652531743087737814467999489        × 3674604366679959042824463379962795263227915816434308764267603228381573966651           1279233373417143396810270092798736308917

The CPU time spent on finding these factors by a collection of parallel computers amounted approximately to the equivalent of almost 2000 years of computing on a single-core 2.2 GHz AMD Opteron-based computer.

RSA-240
RSA-240 has 240 decimal digits (795 bits), and was factored in November 2019 by Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé and Paul Zimmermann.

RSA-240 = 1246203667817187840658350446081065904348203746516788057548187888832896668011 8821085503603957027250874750986476843845862105486553797025393057189121768431          8286362846948405301614416430468066875699415246993185704183030512549594371372           159029236099

RSA-240 = 5094359522858399145550510235808437141326483820241114731866602965218212064697 46700620316443478873837606252372049619334517        × 2446242088383181505678131390240028966538020925789314014520412213365584770951           78155258218897735030590669041302045908071447

The CPU time spent on finding these factors amounted to approximately 900 core-years on a 2.1 GHz Intel Xeon Gold 6130 CPU. Compared to the factorization of RSA-768, the authors estimate that better algorithms sped their calculations by a factor of 3–4 and faster computers sped their calculation by a factor of 1.25–1.67.

RSA-250
RSA-250 has 250 decimal digits (829 bits), and was factored in February 2020 by Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, and Paul Zimmermann. The announcement of the factorization occurred on February 28.

RSA-250 = 2140324650240744961264423072839333563008614715144755017797754920881418023447 1401366433455190958046796109928518724709145876873962619215573630474547705208          0511905649310668769159001975940569345745223058932597669747168173806936489469           9871578494975937497937

RSA-250 = 6413528947707158027879019017057738908482501474294344720811685963202453234463 0238623598752668347708737661925585694639798853367        × 3337202759497815655622601060535511422794076034476755466678452098702384172921           0037080257448673296881877565718986258036932062711 The factorisation of RSA-250 utilised approximately 2700 CPU core-years, using a 2.1 GHz Intel Xeon Gold 6130 CPU as a reference. The computation was performed with the Number Field Sieve algorithm, using the open source CADO-NFS software.

The team dedicated the computation to Peter Montgomery, an American mathematician known for his contributions to computational number theory and cryptography who died on February 18, 2020, and had contributed to factoring RSA-768.

RSA-260
RSA-260 has 260 decimal digits (862 bits), and has not been factored so far.

RSA-260 = 2211282552952966643528108525502623092761208950247001539441374831912882294140 2001986512729726569746599085900330031400051170742204560859276357953757185954          2988389587092292384910067030341246205457845664136645406842143612930176940208           46391065875914794251435144458199

RSA-270
RSA-270 has 270 decimal digits (895 bits), and has not been factored so far.

RSA-270 = 2331085303444075445276376569106805241456198124803054490429486119684959182451 3578286788836931857711641821391926857265831491306067262691135402760979316634          1626693946596196427744273886601876896313468704059066746903123910748277606548           649151920812699309766587514735456594993207

RSA-896
RSA-896 has 270 decimal digits (896 bits), and has not been factored so far. A cash prize of $75,000 was previously offered for a successful factorization.

RSA-896 = 4120234369866595438555313653325759481798116998443279828454556264338764455652 4842619809887042316184187926142024718886949256093177637503342113098239748515          0944909106910269861031862704114880866970564902903653658867433731720813104105           190864254793282601391257624033946373269391

RSA-280
RSA-280 has 280 decimal digits (928 bits), and has not been factored so far.

RSA-280 = 1790707753365795418841729699379193276395981524363782327873718589639655966058 5783742549640396449103593468573113599487089842785784500698716853446786525536          5503525160280656363736307175332772875499505341538927978510751699922197178159           7724733184279534477239566789173532366357270583106789

RSA-290
RSA-290 has 290 decimal digits (962 bits), and has not been factored so far.

RSA-290 = 3050235186294003157769199519894966400298217959748768348671526618673316087694 3419156362946151249328917515864630224371171221716993844781534383325603218163          2549201100649908073932858897185243836002511996505765970769029474322210394327           60575157628357292075495937664206199565578681309135044121854119

RSA-300
RSA-300 has 300 decimal digits (995 bits), and has not been factored so far.

RSA-300 = 2769315567803442139028689061647233092237608363983953254005036722809375824714 9473946190060218756255124317186573105075074546238828817121274630072161346956          4396741836389979086904304472476001839015983033451909174663464663867829125664           459895575157178816900228792711267471958357574416714366499722090015674047

RSA-309
RSA-309 has 309 decimal digits (1,024 bits), and has not been factored so far.

RSA-309 = 1332943998825757583801437794588036586217112243226684602854588261917276276670 5425540467426933349195015527349334314071822840746357352800368666521274057591          1870128339157499072351179666739658503429931021985160714113146720277365006623           6927218079163559142755190653347914002967258537889160429597714204365647842739           10949

RSA-1024
RSA-1024 has 309 decimal digits (1,024 bits), and has not been factored so far. $100,000 was previously offered for factorization.

RSA-1024 = 135066410865995223349603216278805969938881475605667027524485143851526510604 859533833940287150571909441798207282164471551373680419703964191743046496589           274256239341020864383202110372958725762358509643110564073501508187510676594            629205563685529475213500852879416377328533906109750544334999811150056977236            890927563

RSA-310
RSA-310 has 310 decimal digits (1,028 bits), and has not been factored so far.

RSA-310 = 1848210397825850670380148517702559371400899745254512521925707445580334710601 4125276757082979328578439013881047668984294331264191394626965245834649837246          5163148188847336415136873623631778358751846501708714541673402642461569061162           0116380982484120857688483676576094865930188367141388795454378671343386258291           687641

RSA-320
RSA-320 has 320 decimal digits (1,061 bits), and has not been factored so far.

RSA-320 = 2136810696410071796012087414500377295863767938372793352315068620363196552357 8837094085435000951700943373838321997220564166302488321590128061531285010636          8571638978998117122840139210685346167726847173232244364004850978371121744321           8270343654835754061017503137136489303437996367224915212044704472299799616089           2591129924218437

RSA-330
RSA-330 has 330 decimal digits (1,094 bits), and has not been factored so far.

RSA-330 = 1218708633106058693138173980143325249157710686226055220408666600017481383238 1352456802425903555880722805261111079089882303717632638856140900933377863089          0634828167900405006112727432172179976427017137792606951424995281839383708354           6364684839261149319768449396541020909665209789862312609604983709923779304217           01862444655244698696759267

RSA-340
RSA-340 has 340 decimal digits (1,128 bits), and has not been factored so far.

RSA-340 = 2690987062294695111996484658008361875931308730357496490239672429933215694995 2758588771223263308836649715112756731997946779608413232406934433532048898585          9176676580752231563884394807622076177586625973975236127522811136600110415063           0004691128152106812042872285697735145105026966830649540003659922618399694276           990464815739966698956947129133275233

RSA-350
RSA-350 has 350 decimal digits (1,161 bits), and has not been factored so far.

RSA-350 = 2650719995173539473449812097373681101529786464211583162467454548229344585504 3495841191504413349124560193160478146528433707807716865391982823061751419151          6068496555750496764686447379170711424873128631468168019548127029171231892127           2886825928263239383444398948209649800021987837742009498347263667908976501360           3382322972552204068806061829535529820731640151

RSA-360
RSA-360 has 360 decimal digits (1,194 bits), and has not been factored so far.

RSA-360 = 2186820202343172631466406372285792654649158564828384065217121866374227745448 7764963889680817334211643637752157994969516984539482486678141304751672197524          0052350576247238785129338002757406892629970748212734663781952170745916609168           9358372359962787832802257421757011302526265184263565623426823456522539874717           61591019113926725623095606566457918240614767013806590649

RSA-370
RSA-370 has 370 decimal digits (1,227 bits), and has not been factored so far.

RSA-370 = 1888287707234383972842703127997127272470910519387718062380985523004987076701 7212819937261952549039800018961122586712624661442288502745681454363170484690          7379449525034797494321694352146271320296579623726631094822493455672541491544           2700993152879235272779266578292207161032746297546080025793864030543617862620           878802244305286292772467355603044265985905970622730682658082529621

RSA-380
RSA-380 has 380 decimal digits (1,261 bits), and has not been factored so far.

RSA-380 = 3013500443120211600356586024101276992492167997795839203528363236610578565791 8270750937407901898070219843622821090980641477056850056514799336625349678549          2187941807116344787358312651772858878058620717489800725333606564197363165358           2237779263423501952646847579678711825720733732734169866406145425286581665755           6977260763553328252421574633011335112031733393397168350585519524478541747311

RSA-390
RSA-390 has 390 decimal digits (1,294 bits), and has not been factored so far.

RSA-390 = 2680401941182388454501037079346656065366941749082852678729822424397709178250 4623002472848967604282562331676313645413672467684996118812899734451228212989          1630084759485063423604911639099585186833094019957687550377834977803400653628           6955344904367437281870253414058414063152368812498486005056223028285341898040           0795447435865033046248751475297412398697088084321037176392288312785544402209           1083492089

RSA-400
RSA-400 has 400 decimal digits (1,327 bits), and has not been factored so far.

RSA-400 = 2014096878945207511726700485783442547915321782072704356103039129009966793396 1419850865094551022604032086955587930913903404388675137661234189428453016032          6191193056768564862615321256630010268346471747836597131398943140685464051631           7519403149294308737302321684840956395183222117468443578509847947119995373645           3607109795994713287610750434646825511120586422993705980787028106033008907158           74500584758146849481

RSA-410
RSA-410 has 410 decimal digits (1,360 bits), and has not been factored so far.

RSA-410 = 1965360147993876141423945274178745707926269294439880746827971120992517421770 1079138139324539033381077755540830342989643633394137538983355218902490897764          4412968474332754608531823550599154905901691559098706892516477785203855688127           0635069372091564594333528156501293924133186705141485137856845741766150159437           6063244163040088180887087028771717321932252992567756075264441680858665410918           431223215368025334985424358839

RSA-420
RSA-420 has 420 decimal digits (1,393 bits), and has not been factored so far.

RSA-420 = 2091366302476510731652556423163330737009653626605245054798522959941292730258 1898373570076188752609749648953525484925466394800509169219344906273145413634          2427186266197097846022969248579454916155633686388106962365337549155747268356           4666583846809964354191550136023170105917441056517493690125545320242581503730           3405952887826925813912683942756431114820292313193705352716165790132673270514           3817744164107601735413785886836578207979

RSA-430
RSA-430 has 430 decimal digits (1,427 bits), and has not been factored so far.

RSA-430 = 3534635645620271361541209209607897224734887106182307093292005188843884213420 6950355315163258889704268733101305820000124678051064321160104990089741386777          2424190744453885127173046498565488221441242210687945185565975582458031351338           2070785777831859308900851761495284515874808406228585310317964648830289141496           3289966226854692560410075067278840383808716608668377947047236323168904650235           70092246473915442026549955865931709542468648109541

RSA-440
RSA-440 has 440 decimal digits (1,460 bits), and has not been factored so far.

RSA-440 = 2601428211955602590070788487371320550539810804595235289423508589663391270837 4310252674800592426746319007978890065337573160541942868114065643853327229484          5029942332226171123926606357523257736893667452341192247905168387893684524818           0307729497304959710847337973805145673263119916483529703607405432752966630781           2234597766390750441445314408171802070904072739275930410299359006059619305590           701939627725296116299946059898442103959412221518213407370491

RSA-450
RSA-450 has 450 decimal digits (1,493 bits), and has not been factored so far.

RSA-450 = 1984634237142836623497230721861131427789462869258862089878538009871598692569 0078791591684242367262529704652673686711493985446003494265587358393155378115          8032447061155145160770580926824366573211993981662614635734812647448360573856           3132247491715526997278115514905618953253443957435881503593414842367096046182           7643434794849824315251510662855699269624207451365738384255497823390996283918           3287667419172988072221996532403300258906083211160744508191024837057033

RSA-460
RSA-460 has 460 decimal digits (1,526 bits), and has not been factored so far.

RSA-460 = 1786856020404004433262103789212844585886400086993882955081051578507634807524 1464078819812169681394445771476334608488687746254318292828603396149562623036          3564554675355258128655971003201417831521222464468666642766044146641933788836           8932452217321354860484353296131403821175862890998598653858373835628654351880           4806362231643082386848731052350115776715521149453708868428108303016983133390           0416365515466857004900847501644808076825638918266848964153626486460448430073           4909

RSA-1536
RSA-1536 has 463 decimal digits (1,536 bits), and has not been factored so far. $150,000 was previously offered for successful factorization.

RSA-1536 = 184769970321174147430683562020016440301854933866341017147178577491065169671 116124985933768430543574458561606154457179405222971773252466096064694607124           962372044202226975675668737842756238950876467844093328515749657884341508847            552829818672645133986336493190808467199043187438128336350279547028265329780            293491615581188104984490831954500984839377522725705257859194499387007369575            568843693381277961308923039256969525326162082367649031603655137144791393234            7169566988069

RSA-470
RSA-470 has 470 decimal digits (1,559 bits), and has not been factored so far.

RSA-470 = 1705147378468118520908159923888702802518325585214915968358891836980967539803 6897711442383602526314519192366612270595815510311970886116763177669964411814          0957486602388713064698304619191359016382379244440741228665455229545368837485           5874455212895044521809620818878887632439504936237680657994105330538621759598           4047709603954312447692725276887594590658792939924609261264788572032212334726           8553025718835659126454325220771380103576695555550710440908570895393205649635           76770285413369

RSA-480
RSA-480 has 480 decimal digits (1,593 bits), and has not been factored so far.

RSA-480 = 3026570752950908697397302503155918035891122835769398583955296326343059761445 7144169659817040125185215913853345598217234371231338324773210726853524776378          4105186549246199888070331088462855743520880671299302895546822695492968577380           7067958428022008294111984222973260208233693152589211629901686973933487362360           8129660418514569063995282978176790149760521395548532814196534676974259747930           6858645849268328985687423881853632604706175564461719396117318298679820785491           875674946700413680932103

RSA-490
RSA-490 has 490 decimal digits (1,626 bits), and has not been factored so far.

RSA-490 = 1860239127076846517198369354026076875269515930592839150201028353837031025971 3738522164743327949206433999068225531855072554606782138800841162866037393324          6578171804201717222449954030315293547871401362961501065002486552688663415745           9758925793594165651020789220067311416926076949777767604906107061937873540601           5942747316176193775374190713071154900658503269465516496828568654377183190586           9537640698044932638893492457914750855858980849190488385315076922453755527481           1376719096144119390052199027715691

RSA-500
RSA-500 has 500 decimal digits (1,659 bits) and has not been factored so far.

RSA-500 = 1897194133748626656330534743317202527237183591953428303184581123062450458870 7687605943212347625766427494554764419515427586743205659317254669946604982419          7301601038125215285400688031516401611623963128370629793265939405081077581694           4786041721411024641038040278701109808664214800025560454687625137745393418221           5494821277335671735153472656328448001134940926442438440198910908603252678814           7850601132077287172819942445113232019492229554237898606631074891074722425617           39680319169243814676235712934292299974411361

RSA-617
RSA-617 has 617 decimal digits (2,048 bits) and has not been factored so far.

RSA-617 = 2270180129378501419358040512020458674106123596276658390709402187921517148311 9139894870133091111044901683400949483846818299518041763507948922590774925466          0881718792594659210265970467004498198990968620394600177430944738110569912941           2854289188085536270740767072259373777266697344097736124333639730805176309150           6836310795312607239520365290032105848839507981452307299417185715796297454995           0235053160409198591937180233074148804462179228008317660409386563445710347785           5345712108053073639453592393265186603051504106096643731332367283153932350006           7937107541955437362433248361242525945868802353916766181532375855504886901432           221349733

RSA-2048
RSA-2048 has 617 decimal digits (2,048 bits). It is the largest of the RSA numbers and carried the largest cash prize for its factorization, $200,000.

RSA-2048 = 2519590847565789349402718324004839857142928212620403202777713783604366202070 7595556264018525880784406918290641249515082189298559149176184502808489120072           8449926873928072877767359714183472702618963750149718246911650776133798590957            0009733045974880842840179742910064245869181719511874612151517265463228221686            9987549182422433637259085141865462043576798423387184774447920739934236584823            8242811981638150106748104516603773060562016196762561338441436038339044149526            3443219011465754445417842402092461651572335077870774981712577246796292638635            6373289912154831438167899885040445364023527381951378636564391212010397122822            120720357

title: RSA numbers


text:
Talk:Lake Annecy

Image
is a nice annotated image of the lake on the French wiki, it's GNU FDL, so I'd like to include it on the Lake Annecy page when I know whether to link direct or download and upload. Wikibob 22:27, 2004 Mar 7 (UTC)
 * I've now fetched it from the french wiki and uploaded it to the Lake Annecy page.-Wikibob 21:24, 2004 Mar 16 (UTC)

Merge

 * YES merge them (Stpaul 11:01, 18 April 2006 (UTC))
 * Agree. Of course, it's a duplication. -- Slowmover 20:36, 17 August 2006 (UTC)

WikiProject class rating
This article was automatically assessed because at least one article was rated and this bot brought all the other ratings up to at least that level. BetacommandBot 04:36, 27 August 2007 (UTC)

title: Talk:Lake Annecy


text:
Gascogne

Gascogne may refer to:

Geography

 * Gascony (French Gascogne), a region and former province of France
 * Côtes de Gascogne, a wine-growing area of Gascony
 * Golfe de Gascogne, an alternative name for the Bay of Biscay

People

 * Matthias Gascogne, a 16th-century French composer
 * Severus de Gascogne, a suggested Duke of Aquitaine

Other

 * French battleship Gascogne (1914), a Normandie-class battleship of the French Navy.
 * Basset Bleu de Gascogne, a breed of dog
 * Grand Bleu de Gascogne, a breed of dog
 * Petit Bleu de Gascogne, a breed of dog
 * Griffon Bleu de Gascogne, a breed of dog
 * Floc de Gascogne, an apéritif

title: Gascogne


text:
User:Abscissa

My interests are philosophy, religion, ethnobotany, and environmental science.

I have been a member of Wikipedia since July 2003. That's probably longer than you!!

Maxim of the day: It is a necessary truth that those who have the most time to edit Wikipedia are the least qualified to edit it.

title: User:Abscissa


text:
Western Reserve Academy

Western Reserve Academy (WRA), or simply Reserve, is a private, midsized, coeducational boarding and day college preparatory school located in Hudson, Ohio, United States. A boarding school, Western Reserve Academy is largely a residential campus, with 280 of 390 students living on campus and the remainder attending as day students. Students from over 20 states and 15 countries attend.

History
Western Reserve Academy was established on February 7, 1826, as the Western Reserve College and Preparatory School in Hudson, Ohio, on a 190 acre plot of land set aside by charter by the Ohio legislature. Reserve is the 27th oldest preparatory boarding school in the United States, and the oldest outside of the Northeast.

The institution's name comes from the area in which it was built, the Connecticut Western Reserve, as it was the first of its kind in Northern Ohio. The settlers from Connecticut wanted to build a school of the same caliber as Yale College. They selected the same architectural design, with brick buildings and the same motto, Lux et Veritas. People called it "the Yale of the West." The first cohort included eleven students at the college level and eight at the preparatory level. In 1882, the college section moved north to Cleveland and became Western Reserve University, later merging with the Case Institute of Technology to become Case Western Reserve University. Western Reserve Academy remained open for another twenty-one years until 1903, when it closed due to financial problems.

In 1916, however, the school reopened with the support of James Ellsworth, a former student and Hudson resident who had returned after becoming wealthy in the coal industry. The "Ellsworth Era" was marked by significant construction: Seymour Hall (the newly appointed academic building), the Bicknell Gymnasium, and Ellsworth Hall, a dormitory and dining hall. In 1922, Western Reserve Academy became an all-boys institution, staying this way for fifty years, until 1972, when girls were introduced into the junior class, once again becoming a co-ed institution.

In 2001, Western Reserve Academy was recognized by U.S. News & World Report as one of the top boarding schools in the country.

Athletics
The school offers various sports, including soccer, golf, cross country, field hockey, volleyball, swimming and diving, basketball, wrestling, riflery, baseball, softball, track and field, tennis, and lacrosse.

Western Reserve Academy has become one of the top high school lacrosse teams in the United States. In 2006 and 2009, WRA won the Midwest Scholastic Lacrosse Championship and respectively finished ranked 27th and 28th nationally according to LaxPower.com. Only three different teams have won the Midwest Championships since 1992: Brother Rice High School, Western Reserve Academy, and Upper Arlington High School. Inside Lacrosse ranked the 2009 WRA lacrosse team number one in the Midwest.

The track and cross-country teams achieved success from the 1940s through the 1980s, winning many Interstate League championships, with the cross-country team once boasting a streak of 179–1. The WRA track is named after track and cross country coach Frank Longstreth and hosts the annual Frank Longstreth Relays.

In 2012, the girls' and boys' soccer teams achieved a state ranking, with the boys experiencing an undefeated season and the girls' teams, both JV and varsity, breaking the record for most season wins. The boys tied top Ohio Division I team St. Ignatius High School and finishing the year atop the Ohio Division III rankings.

Traditionally, a rivalry with University School has existed, having first played each other in 1895. Other notable rivalries include The Kiski School, Linsly School, and Hawken School.

Arts
Reserve offers over 20 different classes catering to students interested in the arts. Courses are available through the school's music, dance, theater, and visual arts programs. 2D and 3D art rooms are always available to students, and a Graphic Design computer lab and a workshop for Woodworking. Most fine arts occur in the Knight Fine Arts Center (KFAC), with the music program headquartered in Hayden Hall. KFAC contains several classrooms, a theater, and a dance studio. The Moos Gallery, also in KFAC, features students' work and exhibits from established artists.

KFAC is also home to the Wang Innovation Center (WIC), allowing students to take classes as part of WRA's interdisciplinary curriculum.

Traditions
Western Reserve Academy has several traditions. One of the most popular is Vespers, a Christmas Concert and sit-down meal right before students leave for winter break. Another is sit-down meals. The entire faculty and student body have a sit-down lunch each Wednesday. The meal is family-style, and students sit with their academic advisors in an intimate setting. Another frequent tradition is the victory bell. Almost lost after the construction of the Murdough Athletic Center, this tradition was rekindled when the bell was reinstalled in 2012. After each Reserve athletic victory, the players on the winning team take turns ringing the bell loud enough for the entire campus to hear. Reserve students also participate in artistic and musical traditions, including the annual "Messiah Sing" concert. The Academy String Orchestra and Academy Choir perform Handel's Messiah and invite the audience to join in for many songs.

Finally, the last tradition Reserve students experience, Commencement, is set just outside the historic chapel. The graduating men wear Reserve green and white pants while the women wear white dresses. They are led through campus by bagpipers and followed by the faculty. As each student is called up, they receive their diploma and the alum tie (for men) or pin (for women).

Dress code
Western Reserve Academy enforces a relatively strict dress code daily. Boys must wear a coat and tie all week, with special "Reserve Green" (consisting of a green jacket with the Academy crest and a green striped tie) mandatory on Monday and Friday. On some Tuesdays, Wednesdays, and Thursdays, wearing coats are not strictly enforced. Likewise, girls on "Reserve Green" days must wear a green blazer and a green kilt.

Chapel and Loomis Observatory
WRA's campus houses many old buildings. However, two, in particular, stand out: the Loomis Observatory and the chapel, both listed in the National Register of Historic Places. Initially built in 1836 and most recently updated in 2021, the chapel is still used today for Morning meetings twice weekly. In addition, marriages, concerts, and gatherings take place inside the chapel. The Commencement ceremony at the end of the year takes place outside the chapel. Even though the school itself is nondenominational, the chapel has a cross hanging front and center, which used to hang in the Spanish monastery Santa Maria de La Rabida (La Rábida Friary). It is said that Christopher Columbus prayed before that cross before he voyaged to the New World.

The Loomis Observatory, initially named The Observatory, was built in 1838. It was the third observatory built in the country and is currently the second oldest observatory in the United States, only behind the Hopkins Observatory at Williams College. The Hudson building was named for astronomer Elias Loomis. This three-room observatory still stands, sitting close to the edge of the campus near the music building, Hayden Hall. The building itself is closed from public view, as well as the telescope housed in the observatory, which is no longer used (in favor of a newer and more secluded observatory on Cross Country Hill).

Ong Library
Named after Ambassador John D. Ong, the Ong Library is a 21,000 sq ft. building located on the south end of campus. It contains nearly 23,000 books, 3,000 DVDs and CDs, and 110 periodicals. Open to students all day through study hours, the library features two computer labs and a dozen group study rooms. The basement also contains the Western Reserve Academy Archives Collection, which follows the 200-year-old school and town history.

Dormitories
There are ten dormitories in which the over 200 boarding students reside during the school year. The oldest is North Hall, erected in 1838, and the newest is Bicknell House. Each dorm houses students in a single, double, triple, or quad, with shared bathrooms.

Each dorm has 2-3 faculty residents, one serving as Dorm Head, all living in connected apartments. Approximately 85% of the faculty members reside on campus in either faculty homes or dormitory apartments.

Notable alumni
Individuals with a † next to their name were enrolled in either or both institutions before Western Reserve College moved from the Hudson campus to Cleveland in 1882 and became Western Reserve University. The degree to which they were affiliated with both institutions may vary. Individuals with a * next to their name did not complete their studies.

Politics, government and law
• William B. Allison† — U.S. senator from Iowa

• David R. Paige† — U.S. representative from Ohio

• Mark Hanna*† — U.S. senator from Ohio, campaign manager for President William McKinley, chairman of Republican National Committee

• Louis P. Harvey† — 7th governor of Wisconsin

• William H. Upson† 1842 — U.S. representative from Ohio, lawyer

• George Hoadly† — 36th governor of Ohio

• James W. Dawes† — sixth Governor of Nebraska

• George K. Nash† 1860 — 41st governor of Ohio

• John Hessin Clarke† — Associate justice of the U.S. Supreme Court

• Walter Folger Brown 1888 — U.S. postmaster general

• William R. Hopkins 1892 — Politician, first city manager of Cleveland, Ohio, namesake of Cleveland Hopkins International Airport

• David S. Dennison '36 — U.S. representative from Ohio, member of Federal Trade Commission

• Ronald B. Cameron '45 — U.S. representative from California

• James Robertson '55 — Federal District Court judge; former Foreign Intelligence Surveillance Court judge; presided over Hamdan v. Rumsfeld

• Daniel W. Christman '61 — Former assistant to the chairman of the Joint Chiefs of Staff, former superintendent of the U.S. Military Academy at West Point; current senior vice president for international affairs for the U.S. Chamber of Commerce

• Oliver Everett '62 — Royal librarian to Elizabeth II of the United Kingdom

• Thomas C. Sawyer* '63 — U.S. Representative from Ohio, former member of the Ohio State Senate

• Martin R. Hoke '69 — U.S. Representative from Ohio

• Neel Kashkari '91 — Head of the U.S. Office of Financial Stability, assistant secretary of the Treasury, candidate for Governor of California in 2014

Literature and journalism
• Rupert Hughes 1888 — Novelist, film director, historian, composer

• Lucien Price 1901 — Journalist for The Boston Globe, author

• R. W. Apple Jr. '52 — Associate editor for The New York Times

• Martin Perlich '55 — Radio broadcaster and writer

• Ted Gup '68 — Author of A Secret Gift

• Chris Gulker '69 — Photojournalist, writer, two-time Pulitzer Prize nominee

• Ian Frazier '69 — Nonfiction author and essayist

• Andrew Meldrum '70 — Senior editor at GlobalPost; former Zimbabwe correspondent for The Economist, The Guardian

• John Yang '75 — PBS Newshour correspondent, former NBC News and ABC News correspondent, Peabody Award winner, former writer for The Washington Post and The Wall Street Journal

• Kevin Prufer '88 — Essayist and poet

Arts and entertainment

 * D.M. Marshman Jr. '41 — Academy Award-winning screenplay writer for Sunset Boulevard.
 * Frederick Coffin '61 — Film and television actor
 * Jeff Schaffer '87 — Film director, TV show writer (Seinfeld, Curb Your Enthusiasm, The League)
 * Richard Brake '83 — Film actor (Batman Begins)
 * Macy Gray* '84 — Grammy Award-winning musician/singer
 * Ted Humphrey '87 — Emmy Award-nominated television and film writer and producer

Business

 * James Ellsworth† 1868 — Coal mine owner, banker
 * James L. Knight '29 — Newspaperman and philanthropist, founder of Knight Ridder newspaper group
 * William D. Perez '65 — CEO of Wm. Wrigley Jr. Company, former CEO of Nike, Inc.

Sports

 * Keith Carter '48 — Olympic swimmer; silver medalist at 1948 Summer Olympic Games
 * Joel Dalgarno '05 — Professional lacrosse player for the Colorado Mammoth; all-time scoring leader for Ohio State Buckeyes
 * Chris Livingston, professional basketball player

Miscellaneous
• John Strong Newberry — Geologist, physician, explorer

• Frederic de Forest Allen — Philologist, classics scholar

• Lincoln Ellsworth — U.S. explorer; first undisputed sighting of North Pole; Two-time recipient of the Congressional Gold Medal

• Scott E. Forbush '20 — Physicist, discoverer of the Forbush decrease, member of the National Academy of Sciences

• George Kubler '29 — Art historian

• Lee Morin '70 — NASA astronaut

• Thomas Day Seymour 1870 - educator

Notable faculty

 * Beriah Green, taught at Western Reserve College and Prefatory Academy
 * Edward Morley, taught at Western Reserve College and Prefatory Academy
 * Joseph Frederick Waring, taught at Western Reserve Academy for 32 years; had an award named in his honor

title: Western Reserve Academy


text:
Eagle Pass (British Columbia)

Eagle Pass (elevation 550 m) is a mountain pass through the Gold Range of the Monashee Mountains in British Columbia, Canada. It divides the Columbia River drainage basin from that of the Fraser River (via the Shuswap Lakes and the Thompson River).

Eagle Pass was chosen as the route of the Canadian Pacific Railway (CPR), and later the Trans-Canada Highway, over the Monashees. The line over the Eagle Pass was the last section of the CPR to be completed; the last spike was driven at a location known as Craigellachie in 1885.

The pass was discovered by Walter Moberly in his role as Assistant Surveyor General of British Columbia in 1865.

The nearest city to Eagle Pass is Revelstoke, 20 kilometres to the east.

title: Eagle Pass (British Columbia)