text:
Pradesh Congress Committee

Pradesh Congress Committee (PCC) is the state-level unit of the Indian National Congress. It is responsible for the organization and management of the party's activities in a particular state of India. The PCC is made up of a president and several other office-bearers who are responsible for overseeing the party's activities in the state.

The PCC is responsible for coordinating the activities of the Congress party at the district and block levels, and for organizing campaigns and events to mobilize public support for the party. It also works to build alliances with other political parties and social groups to enhance the party's electoral prospects.

It is elected by card-holding members of the Congress and in turn elects state president and delegates to the All India Congress Committee. Each PCC has a working committee of twenty members, most of whom are appointed by the party president, the leader of the state party, who is chosen by the national president. Those elected as members of the states' legislative assemblies form the Congress Legislature Parties in the various state assemblies; guy only

List of Pradesh Congress Committees
This is a list of the official state, territorial and regional committees of the Indian National Congress.

title: Pradesh Congress Committee


text:
Jessica Hsuan

Jessica Hester Hsuan ([IPA: syn hyn]; born 18 August 1970), also known as Suen Huen, is a Hong Kong actress.

Early life
Hsuan's father gave her the name Jessica, while her mother gave her the middle name Hester. She was educated in Hong Kong at Maryknoll Convent School for primary education and at Pooi To Middle School. She later boarded at Roedean School in Britain.

Hsuan graduated with a bachelor's degree in materials science and engineering from Imperial College London in 1992.

Career
Hsuan started her career in late 1992 and early 1993. Along with Maggie Cheung Ho Yee, Ada Choi, Flora Chan and Kenix Kwok, she was known as one of the top five "Fa Dans" (a term borrowed from Peking Opera for roles depicting young maidens, and used for actresses with high popularity) of TVB from the mid-1990s to mid-2000s. She has collaborated with many TVB leading actors including Louis Koo, Wong He, Chilam Cheung, Nick Cheung, Gallen Lo, Roger Kwok, Sunny Chan, Joe Ma and Bobby Au-yeung. She won the 1999 TVB Anniversary Award for Best Actress for her role in Detective Investigation Files IV.

She changed her contract to a "per-series" in late 2006, after it was disclosed that she had not renewed her current contract.

In 2017, Hsuan played a leading role in TVB series My Unfair Lady (Chinese: 不懂撒嬌的女人). She won the My Favorite TVB Actress (also known as Malaysia's TV Queen) at the TVB Star Awards in Malaysia in 2017 for her performance in this series, her first leading actress award since 1999.

Louis Koo's film production company, One Cool Film Production, was able to acquire the rights of the series A Step into the Past in 2015 and adapt to the big screen - Back to the Past. Production for the film officially wrapped on 7 July 2019. Hsuan will play a role in the movie.

Frequently acting as hostage in television series and films
Among the TV drama and films Hsuan starred in, she was frequently "kidnapped" in the stories. This has drawn the attention of internet users in Hong Kong. Occasionally she was known as the "Queen of hostage" (人質王). Nevertheless, she always survived in the end.

Awards and nominations
Hsuan is one of the most honored actresses in Hong Kong, with 13 Best Actress awards.

 * 1995: Next Magazine TV Award: Top 10 Artists - Ranked #8
 * 1999: TVB 32nd Anniversary: My Favorite Actress In A Leading Role (Detective Investigation Files IV)
 * 2000: TVB 33rd Anniversary: My Top 10 Favorite Television Characters - Ranked #7 (A Matter of Customs)
 * 2000: Next Magazine TV Award: Top 10 Artists - Ranked #2
 * 2001: TVB 34th Anniversary: My Top 13 Favorite Television Characters - Ranked #9 (A Step Into The Past)
 * 2002: TVB 35th Anniversary: My Top 12 Favorite Television Characters - Ranked #2 (Golden Faith)
 * 2002: Next Magazine TV Award: Top 10 Artists - Ranked #2
 * 2003: TVB 36th Anniversary: My Favorite On-Screen Partners (Jessica Hsuan & Roger Kwok - Square Pegs)
 * 2003: TVB 36th Anniversary: My Top 12 Favorite Television Characters - Ranked #5 (Square Pegs)
 * 2003: Next Magazine TV Award: Top 10 Artists - Ranked #1
 * 2004: TVB 37th Anniversary: My Top 12 Favorite Television Characters - Ranked #1 (Lady Fan)
 * 2005: Next Magazine TV Award: Top 10 Artists - Ranked #3
 * 2005: Next Magazine TV Award: Most Elegant Artiste Award
 * 2006: Next Magazine TV Award: Top 10 Artists - Ranked #2
 * 2006: Next Magazine TV Award: Most Feminine Beautiful Award
 * 2007: Asian Television Award: Best Comedy Performance by an Actress (Nominated)
 * 2008: I Weekly Magazine Awards Top 10 Female Artists - Ranked #1
 * 2008: Next Magazine TV Award: Top 10 Artists - Ranked #2
 * 2008: Sina Awards: Best Style Actress
 * 2008: Astro Wah Lai Toi Drama Awards 2008: My Favorite Character - Ranked #6 (Dicey Business)
 * 2015: 7th Macau International Movie Festival: Golden Lotus Award for Best Supporting Actress (The Kid from the Big Apple)
 * 2017: TVB Star Awards Malaysia: My Favorite TVB Actress in a Leading Role (My Unfair Lady)
 * 2017: People's Choice Television Awards: People's Choice Best Actress (My Unfair Lady)
 * 2017: Hong Kong Television Awards: Best Leading Actress in Drama Series (My Unfair Lady)

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

title: Jessica Hsuan


text:
RT-2

The RT-2 was an intercontinental ballistic missile deployed by the Soviet Union, which was in service from December 1968 until 1976. It was assigned the NATO reporting name SS-13 Savage and carried the GRAU index 8K98. Designed by OKB-1, about 60 were built by 1972.

History
The RT-2 was the first solid-propellant ICBM in Soviet service, and was a development of the earlier RT-1 series. It was a three-stage inertially-guided missile comparable to the American Minuteman missile. It was armed with a single 600 kiloton warhead and was silo-launched, although a rail-based version was contemplated by Soviet planners. It was deployed in the Yoshkar-Ola missile field.

The Soviets used the two upper stages of the RT-2 to develop the RT-15 mobile IRBM system. The RT-2PM Topol is supposedly a modernized version of the RT-2

Operations
The RT-2 was capable of delivering a 1200 lb class payload to a maximum operational range of approximately 10,000 km (5,500 nautical miles)

Command and Control
A single launch control center (LCC) monitored numbers of launchers. The hardened and dispersed silo concept increased system survivability and provided steady environmental controls from the solid-propellant motors. Headquarters RVSN exercised normal control of the RT-2 missile force, through an intermediate RVSN Army and launch complex headquarters (HCC). A launch complex consisted of an HCC and several LCCs, monitoring numerous underground launchers.

General Characteristics

 * Length: 20,000 mm (65.6 ft)
 * Diameter: 1,700 mm (5.57 ft)
 * Launch Weight: 34,000 kg (33.46 tons)
 * Guidance: inertial guidance
 * Propulsion: solid, three-stage
 * Warhead: 600kt nuclear
 * Range: 10000 km

Operators

 * : The Strategic Rocket Forces were the only operator of the RT-2.

Photo gallery
 File:RT-2 maximum range coverage of United States.PNG|RT-2 coverage of United States File:RT-2 possible launch facility configuration.PNG|RT-2 launch facility configuration File:RT-2 typical deployment complex.PNG|RT-2 missile complex configuration

title: RT-2


text:
Talk:UMAC

Untitled
I should drop the intro -- Nroets 23:31, 8 Jun 2005 (UTC)

Explaining an edit that I made: hashing (for instance, by evaluating a polynomial over a finite field) followed by one-time pad is not a secure MAC. For instance, the attacker might twiddle the lowest-order bit of the input. This will add (or subtract) 1 to the output, which has a 50% chance of just twiddling the low-order bit there. That would commute with the one-time pad, so the attacker can just twiddle the low-order bit of the MAC also, and he forges a message with probability 1/2. To make the MAC secure, you need a pseudorandom function. -- bitwiseshiftleft
 * If the attacker twiddle the lowest bit of the plaintext (or input as you call it), it will change roughly half the bits in the output of the dot product (what you call a polynomial). For example if your finite field is MOD 7 and your secret hash function is f(x)=x * 5 MOD 7 and the next value from your OTP is Y, then f(0) XOR Y and f(1) XOR Y will differ in 2 bits. -- Nic Roets 18:30, 7 May 2007 (UTC)

The original publication
This is the original publication by Carter & Wegman :  —Preceding unsigned comment added by Nroets (talk • contribs) 11:12, 28 April 2009 (UTC)

Article confuses universal-hash-function-based MACS and the RFC 4418 UMAC algorithm
This page is wrong; no one in cryptography calls all universal-hash-function-based MACS "UMAC." UMAC is a specify one of these: http://fastcrypto.org/umac/ 128.138.242.57 (talk) 05:16, 29 April 2010 (UTC)

 * I was fooled at first (UMAC is good), but this looked to simple. This is broken! But having this using the UMAC name can be dangerous. --RogerJL (talk) 10:50, 8 March 2011 (UTC)

Reviewing the source - for short messages the complete key won't be used. For example a three byte message will only use the first three bytes of the key - effectively limiting the keyspace to 24 bits... My gut feeling is that all bytes in the key should always be used. Padding message with zeroes will not help as the r1, r2, r3 will never be modified -> i.e. same output will be produced. Article should mention padding (to same size as key) and its pitfalls (do not use only zeroes) --RogerJL (talk) 23:57, 7 March 2011 (UTC)

 * You are right in the sense that an attacker can take any message, append zeros at the end and use the old MAC. However, since most message formats either contain a length field, or are the serialization of some structure / object, this is not a concern.
 * If you want to pad, then zeros will work perfectly well. The guarantee still holds: The probability of an attacker correctly guessing the MAC is one in 224. -- Nic Roets (talk) 01:41, 8 March 2011 (UTC)

That was not my concern! My concern is that if you can intercept a short message (<=3 bytes). You can find the tree first letters of the true password by brute force. Once you have found them wait for slightly longer message (4..6 bytes). Break the next tree letters... repeat... If you can intercept two short messages then NO padding will help, nor will any nonce. As they only contributes to xoring with a constants. After the key is broken any message can be forged... --RogerJL (talk) 09:08, 8 March 2011 (UTC)

It is even worse! If you can intercept two messages that only differ in one triplet. Then all the other triplets can be viewed as a constant. And you can break the secret key for the differing section. --RogerJL (talk) 10:50, 8 March 2011 (UTC)
 * Did you consider the "nonce" ? The caller must initialize result[0], result[1] and result[2] with 3 secret bytes. Ideally those 3 bytes should come from a one time pad. If they come from an OTP, then an attacker observing every message and every MAC will learn absolutely nothing about "secret". -- Nic Roets (talk) 21:05, 8 March 2011 (UTC)

Unless you change nonce for EVERY (different) message this crypto will easily broken. I have source that breaks it. To break it you do not need to know the start values for the result array. You have to ensure that atleast two things differ for EVERY message - start value is one, each block that differs is another. With two differences you have 2^24*2^24=2^48 values to work through using brute force. To process all 2^24 takes less than 4 s on my computer - and I see lots of optimization potential in the code. One second per group of 2^24 is not at all unrealistic, you can probably do a lot better. — Preceding unsigned comment added by RogerJL (talk • contribs) 08:14, 9 March 2011 (UTC)

 * I change the nonce every time. In fact I use up 24 bits of my OTP for every message I send. So 24 MB of flash will only last one million messages. The message are numbered and the OTP index is calculated from them. The message number need not be included in the UMAC calculation. It is good practice to check that the message numbers from the sender will always increase, but this requirement can be relaxed if the messages contain a secure timestamp.
 * XORing with f(nonce) is effectively "encrypting the hash". If the encryption is good, then an attacker can learn nothing about the hash. -- Nic Roets (talk) 01:13, 11 March 2011 (UTC)

title: Talk:UMAC


text: Portal talk:Poland/Featured

title: Portal talk:Poland/Featured


text: Portal talk:Poland/Polish paintings

title: Portal talk:Poland/Polish paintings


text:
Korsør Municipality

Until 1 January 2007 Korsør Municipality was a municipality (Danish: kommune) in the former West Zealand County, on the southwestern coast of the island of Zealand, in eastern Denmark. The municipality covered an area of 74.25 km2, and had a total population of 20,873 (2006). Its last mayor was Flemming Erichsen, a member of the Social Democrats.

Korsør Municipality bordered Skælskør Municipality to the south, Hashøj Municipality to the east and Slagelse Municipality to the north. It connected to Nyborg Municipality through the Great Belt ferries. To the west was the Great Belt (Storebælt), the strait that separates Zealand and the island of Funen peninsula.

The municipality ceased to exist as the result of Kommunalreformen 2007 (the Municipality Reform of 2007). It was merged with Slagelse, Hashøj and Skælskør municipalities to form a new Slagelse municipality. The new municipality belongs to Region Zealand.

History
Korsør was likely built in the 1100-1300s, and was granted the status of a market town (Danish: Købstad) in 1425 - possibly earlier. Korsør became a prominent transit town between Zealand, Funen and Langeland.

In the Middle Ages, when Denmark was divided into hundreds, the area of Korsør Municipality was under Slagelse Hundred. Slagelse Hundred came under Korsør County when it was established in 1662. In 1798 Korsør County was merged with Sorø County and Antvorskov County. This county lasted until the 1970 Danish Municipal Reform where it merged with Holbæk County to create West Zealand County (Danish: Vestsjællands Amt). After the 2007 municipal reform this changed to Region Zealand.

From 1842, where parish municipalities were created, and until 1970 consisted of two parish municipalities. From 1875 it also consisted of Korsør Market Town Municipality.

In the Municipality Reform of 2007 Skælskør Municipality was merged with Hashøj, Slagelse and Korsør Municipality to form a new Slagelse Municipality.

Mayors
Since the creation of the municipality in 1970 and until it was dissolved in 2007, the mayors of Korsør Municipality were:

Towns
The largest town of the municipality was Korsør, where more than two thirds of the municipality's population lived. The remaining population lived in rural areas, as well as the two larger settlements of Forlev and Svenstrup. Notable villages in the municipality include Frølunde Fed.

Korsør was located in the western part of the municipality. Until the construction of the Great Belt Bridge Korsør was largely a transit town.

Below are the populations from 2006 of the three larger settlements of the municipality.

Municipal council
Below are the municipal council elected from the municipality's creation in 1970 and until 2001, which was the last election before the municipality was dissolved.

Parishes
The municipality consisted of five parishes and five churches.
 * Halskov Parish (Halskov Church)
 * Hemmeshøj Parish (Hemmeshøj Church)
 * Saint Paul's Parish (Danish: Sankt Povls Sogn) (Saint Paul's Church)
 * Tårnborg Parish (Tårnborg Church)
 * Vemmelev Parish (Vemmelev Church)

Symbols
The coat of arms of Korsør is a blue cross on golden background.

title: Korsør Municipality


text: Portal talk:Poland/Picture

title: Portal talk:Poland/Picture


text:
Legislative Party

In India, the members of Parliament or State Legislative Assemblies that belong to a particular political party are known as the Legislative Party. For example, the Congress Party's legislators are known as the Congress Legislative Party or CLP. Traditionally, the head of the majority Legislative Party in Parliament is chosen as Prime Minister, and that of the majority Legislative Party in a State, the Chief Minister.

title: Legislative Party


text:
Talk:Civil Aviation Administration of China

This article has lots of accidents with no citations. For example the 1985 DC-9 crash from Beijing to Xian, there is absolutely no mention of it anywhere. I think these ones should be deleted unless someone can come up with the sources.

http://www.planecrashinfo.com/Airline/AL%20Ca-Ch.htm

http://www.airdisaster.com/cgi-bin/airline_detail.cgi?airline=CAAC Malcolmyang (talk) 04:43, 23 June 2008 (UTC)

This article does not begin like a typical encyclopedia article. --68.194.108.16 23:34, 8 Jun 2005 (UTC)

Jurisdiction of the CAAC
The jurisdiction of the CAAC is mainland China, in other words, PRC-administered territories excluding Hong Kong and Macao. This article previous had no category, and I added it to category:Mainland China. User:SchmuckyTheCat moved it to category:People's Republic of China in his edit. — Instantnood July 3, 2005 09:27 (UTC)
 * It's an agency of the PRC government. I don't care if it's jurisdiction is a km² of the gobi desert. SchmuckyTheCat 3 July 2005 15:59 (UTC)

Questions
HI! I heard the CAAC is a flight school. 90% of all pilots flying in China learned flying there. Is that true? If not, please explain how to become a pilot in China (especially china eastern Airlines). Dagadt

Redirect request
Would someone like to create a redirect here from General Administration of Civil Aviation of China. If this the official name, it should have a redirect, and it already has one redlink Chunyun. I have have GFW issues. 79.73.45.86 08:21, 16 August 2007 (UTC)

WikiProject class rating
This article was automatically assessed because at least one WikiProject had rated the article as start, and the rating on other projects was brought up to start class. BetacommandBot 14:42, 9 November 2007 (UTC)

Korean name
중국 민간항공총국 WhisperToMe (talk) 21:52, 15 February 2012 (UTC)
 * http://araib.mltm.go.kr/USR/WPGE0201/m_34502/DTL.jsp / http://www.webcitation.org/65TpBlT9b uses the following Korean name:

CAAC incident reports
A Sichuan airlines incident regarding Flight 3U8949 in Wuxi: WhisperToMe (talk) 04:30, 3 December 2013 (UTC)
 * "Report No.:20100914YFZQ CSC A319/B-6054 Stall During Approach Investigation Report of Serious Flight Incident" (Archive) Civil Aviation Administration of China. May 4, 2011.

External links modified
Hello fellow Wikipedians,

I have just modified 2 one external links on Civil Aviation Administration of China. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20120306122345/http://www.chinacfi.net/ to http://www.chinacfi.net/
 * Added archive https://web.archive.org/web/20100310161805/http://www.camic.cn:80/ to http://www.camic.cn/

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.— InternetArchiveBot  (Report bug) 13:40, 25 November 2016 (UTC)


text:
One-pass compiler

In computer programming, a one-pass compiler is a compiler that passes through the parts of each compilation unit only once, immediately translating each part into its final machine code. This is in contrast to a multi-pass compiler which converts the program into one or more intermediate representations in steps between source code and machine code, and which reprocesses the entire compilation unit in each sequential pass.

This refers to the logical functioning of the compiler, not to the actual reading of the source file once only. For instance, the source file could be read once into temporary storage but that copy could then be scanned many times. The IBM 1130 Fortran compiler stored the source in memory and used many passes; by contrast the assembler, on systems lacking a disc storage unit, required that the source deck of cards be presented twice to the card reader/punch.

Properties
One-pass compilers are smaller and faster than multi-pass compilers.

One-pass compilers are unable to generate as efficient programs as multi-pass compilers due to the limited scope of available information. Many effective compiler optimizations require multiple passes over a basic block, loop (especially nested loops), subroutine, or entire module. Some require passes over an entire program. Some programming languages simply cannot be compiled in a single pass, as a result of their design. For example PL/I allows data declarations to be placed anywhere within a program, specifically, after some references to the not-yet-declared items, so no code can be generated until the entire program has been scanned. The language definition also includes pre-processor statements that generate source code to be compiled: multiple passes are certain. In contrast, many programming languages have been designed specifically to be compiled with one-pass compilers, and include special constructs to allow one-pass compilation.

Difficulties
The basic problem is of forward references. The correct interpretation of a symbol at some point in the source file may be dependent on the presence or absence of other symbols further on in the source file and until they are encountered, correct code for the current symbol cannot be produced. This is the problem of context dependence, and the span can be anywhere from adjacent symbols to arbitrarily large amounts of source text.

Local context
Suppose that the symbol < is recognized as being for a "less than" comparison, as opposed to "greater than" for example. Because of character coding limitations, the glyph ≤ may not be available in a standard encoding, so a compound representation is to be allowed, "<=". Even though this context is determined by the very next symbol, it is unknown when "<" is encountered. Similarly, the symbol "=" does not always mean "=", as when it is a part of a compound symbol. Other compound symbols might include ".lt." for the case when the special character "<" is unavailable. Yet another possibility where a character code for the glyph ¬ ("not") is unavailable is "<>" for "¬=" or "not equal" - some systems employ ~ or ! for ¬ as still further variation. One approach is to advance the scan after "<" and on encountering the "=", backtrack. This of course means that there will be two passes over that portion of text, which is to be avoided. For that matter, the source file may come from a device not supporting a go-back-and-reread operation, such as a card reader. Instead of making an early decision that may later have to be undone, the lexical analyser can maintain multiple interpretations rather like the notion of Quantum Superposition, collapsing to a specific choice only on later observing the determining symbol. Notably, COBOL compilers devote a pass to distinguishing between full stops appearing in decimal constants and the full stops that appear at the end of statements. Such a scheme is unavailable to a single-pass compiler.

Similarly with the names of items. Few languages restrict themselves to single-character names, so the character "x" as a single-character name is quite different from the character "x" within a name such as "text" - now the context extends beyond the immediately adjacent characters. It is the task of the lexical analyser to separate the items of the sequential source stream into the tokens of the language. Not just words, because "<" and "<=" are tokens also. Names typically start with a letter and continue with letters and digits, and perhaps a few additional symbols such as "_". The syntax allowed for specifying numbers is surprisingly complex, for example +3.14159E+0 can be valid. It is usual to allow an arbitrary number of space characters between tokens, and Fortran is unusual in allowing (and ignoring) spaces within apparent tokens also so that "GO TO" and "GOTO" are equivalent as are "<=" and "< =". However, some systems may require spaces to delimit certain tokens, and others, such as Python, use leading spaces to indicate the scope of program blocks that otherwise might be indicated by Begin ... End or similar markers.

Context within expressions
Languages that allow arithmetic expressions typically follow the syntax of infix notation with precedence rules. This means that the generation of code for an expression's evaluation does not proceed smoothly as the expression's tokens are elicited from the source text. For example, the expression x + y*(u - v) does not lead to the equivalent of load x, add y, because x is not added to y. If a stack scheme is used for arithmetic, the code may start with a Load x, but the code that corresponds to the following + token does not then follow. Instead, code for (u - v) is generated, followed by multiplication by y, and only then is x added. The parser of arithmetic expressions does not move back and forth along the source during its analysis, it employs a local stack of deferred operations driven by the precedence rules. This dance can be avoided by requiring that arithmetic expressions be presented in Reverse Polish notation or similar; for the above example something like u v - y * x + and which would be scanned strictly left-to-right.

An optimising compiler may analyse the form of an arithmetic expression, to identify and remove repetition or make other potential improvements. Consider a*sin(x) + b*sin(x) Some languages allow assignments within an arithmetic expression, so the programmer could have written something like a*(t:=sin(x)) + b*t but aside from the exertion required to do so, the resulting statement's form is messy and will no longer be easily compared to the mathematical expression being coded for. Mistakes would be easily made. Instead, the compiler could represent the entire expression's form (typically using a tree structure), analyse and modify that structure, and then emit the code for the improved form, perhaps something like. There would be an obvious extension to blocks of successive assignment statements. This does not involve a second pass through the source text, as such.

Middle range context
Although the lexical analyser has split the input stream into a stream of tokens (and discarded any commentary), the interpretation of these tokens according to the language's syntax may yet depend on the context. Consider the following statements in fortran pseudo code: if (expression) = etc. if (expression) label1,label2,label3 if (expression) x = .true. if (expression) then The first is the assignment of the value of some arithmetic expression (the etc) to an element of a one-dimensional array called "if". Fortran is unusual in that it contains no reserved words, so a token "write" does not necessarily mean that there is a write-statement in progress. The other statements are indeed if-statements - the second is an arithmetic-if that examines the sign of the result of the expression and based on it being negative, zero, or positive jumps to label 1, 2, or 3; the third is a logical-if, and requires that the result of its expression be boolean ("logical" in fortran's terminology) which, if true means that the following statement part will be executed (here, assigning true to x, and "true" not being a reserved word, the special meaning is indicated by the periods marking it off); and the fourth is the start of an if ... then ... else ... end if sequence which also requires that the expression yield a boolean result.

Thus, the correct interpretation of the token "if" emerging from the lexical analyser cannot be made until after the expression has been scanned and following the closing bracket there appears either an equals sign, a digit (being the text of label1: while fortran uses only integers as labels, labels may be named via the ASSIGN statement, and so the scan must rely on finding the two commas), the start of an assignment statement (or a write-statement, etc.), or a "then" (that must not be followed by other text), and so now, the context spans an arbitrary amount of source text because the expression is arbitrary. However, in all four cases the compiler can generate the code for evaluating the expression as its scan advances. Thus, the lexical analysis cannot always determine the meaning of the tokens it has just identified because of the vagaries of the allowable syntax, and so the syntax analysis must maintain a superposition of possible states if backtracking is to be avoided.

With the syntax analysis adrift in a fog of superposed states, should an error be encountered (that is, a token is found that cannot be fitted into any valid syntactic frame) the production of a helpful message can be difficult. The B6700 Algol compiler for example was notorious for error messages such as "semicolon expected" along with a listing of the source line plus a marker showing the location of trouble - often marking a semicolon. In the absence of a semicolon, if one were indeed placed as indicated, on recompilation there could well arise a message "unexpected semicolon" for it. Often, only the first error message from a compiler will be worth attending to, because subsequent messages went awry. Cancelling the current interpretation then resuming the scan at the start of the next statement is difficult when the source file is in error, and so subsequent messages are unhelpful. Further code production is of course abandoned.

This problem can be reduced through the employment of reserved words, so that for example "if", "then", and "else" always are parts of an if-statement and cannot be names of variables, but a surprisingly large number of useful words may thereby become unavailable. Another approach is "stropping", whereby reserved words are marked off, say by placing them between special characters such as full stops, or apostrophes as in some versions of Algol. This means that  and   are different tokens, the latter being an ordinary name, but supplying all those apostrophes soon becomes irksome. For many languages, spacing supplies sufficient information though this may be complex. Often it is not just a space (or tab, etc.) but a character other than a letter or digit that terminates a possible token's text. In the above example, the expression of the if-statement must be within brackets so that the "(" definitely ends the identification of "if" and similarly, ")" enables the identification of "then"; further, other parts of a compound if-statement must appear on new lines: "else" and "end if" (or "endif") and "else if". By contrast, with Algol and others the brackets are not needed and all the parts of an if-statement can be on one line. With Pascal, if a or b then etc. is valid, but if a and b are expressions, then they must be enclosed in brackets.

Source file listings produced by the compiler can be made easier to read by having the reserved words it identifies presented underlined or in bold or italic, but there has been criticism: "Algol is the only language that distinguishes between an italic and normal full stop". Actually this is no joking matter. In fortran, a do-statement's start such as  is distinguished from   (an assignment of the value 1.15 to a variable called  ; recall that spaces are irrelevant) only by the difference between a comma and a full stop, and a printed listing's glyphs may not be well-formed.

Careful attention to the design of a language can promote clarity and simplicity of expression with a view to creating a reliable compiler whose behaviour is easily understandable. Yet poor choices are common. For example, Matlab denotes matrix transposition by using an apostrophe as in A' which is unexceptionable and closely follows mathematical usage. Well and good, but for the delimiters of a text string Matlab ignores the opportunity presented by the double quote symbol for any purpose and uses apostrophes for this as well. Though Octave uses double quotes for text strings, it strives to accept Matlab statements as well and so the problem extends to another system.

Pre-processor expansions
It is at this stage that pre-processor options are exercised, so called because they are exercised previous to the compiler proper processing the incoming source. They echo the "macro expansion" options of assembler systems, hopefully with a more gracious syntax. The most common arrangement is a variation on if condition then this source else other source fi often with some arrangement to distinguish pre-processor source statements from "ordinary" source statements, such as the statement starting with a % symbol in pl/i, or a #, etc. Another simple option is a variation of define this = that But caution is needed, as in define SumXY = (x + y) sum:=3*SumXY; Since without the brackets, the result would be sum:=3*x + y; Similarly, caution is needed in determining the bounds of the replacement text and how the resulting text will be scanned. Consider #define three = 3; #define point = .; #define one = 1; x:=three point one; Here the define statement is terminated by a semicolon, and the semicolon is not itself a part of the replacement. The invocation can't be  because that is a different name, but   would be   and the subsequent scan may or may not be able to regard that as a single token.

Some systems allow the definition of pre-processor procedures whose output is source text to be compiled, and may even allow such source to define still further pre-processor items. Adroit usage of such options allows for constants to be given explanatory names, recondite details to be replaced by easy mnemonics, the appearance of new statement forms, and the generation of in-line code for specific usages of a general procedure (such as sorting), rather than devise actual procedures. With a proliferation of parameters and parameter types, the number of combinations required grows exponentially.

Further, the same pre-processor syntax could be used for multiple different languages, even natural languages as in the generation of a story from a story template using a person's name, nickname, name of pet dog, etc. and the temptation would be to devise a pre-processor programme which would accept the source file, perform the pre-processor actions and output the result ready for the next stage, the compilation. But this clearly constitutes at least one extra pass through the source and so such a solution would be unavailable to a single-pass compiler. Thus, progress through the actual input source file may well advance in fits and starts, but it is still unidirectional.

Long-range context
Code generation by the compiler also faces the problem of forwards reference, most directly in the likes of Go to label where the destination label is an unknown distance further ahead in the source file, and thus the jump instruction to reach that label's location involves an unknown distance across yet-to-be-generated code. Some language designs, influenced perhaps by "GOTOs considered harmful", do not have a GOTO statement, but this does not evade the problem as there are many implicit GOTO equivalents in a program. Consider if condition then code true else code false fi As mentioned before, code to evaluate the condition can be generated straight away. But when the then token is encountered, a JumpFalse operation code must be placed whose destination address is the start of the code for the code false statements, and similarly, when the else token is encountered, the just-completed code for the code true statements must be followed by a GOTO-style jump operation whose destination is the code that follows the end of the if-statement, here marked by the fi token. These destinations are knowable only after an arbitrary amount of code is generated for the as-yet unscanned source. Similar problems arise for any statement whose parts span arbitrary amounts of source, such as the case statement.

A recursive-descent compiler would activate a procedure for each type of statement, such as an if-statement, in turn invoking the appropriate procedures to generate the code for the statements of the code true and code false parts of its statement and similarly for the other statements according to their syntax. In its local storage it would keep track of the location of the address field of its incomplete JumpFalse operation, and on encountering its then token, would place the now-known address, and similarly on encountering the fi token for the jump needed after the code true code. The GoTo statement differs in that the code to be jumped over is not inside its statement form, so an entry in an auxiliary table of "fixups" is needed that would be used when finally its label is encountered. This notion could be extended. All unknown-destination jumps could be made via an entry in a jump table (whose addresses are later filled in as the destinations are encountered), however the necessary size of this table is unknown until the end of the compilation.

One solution to this is for the compiler to emit assembler source (with compiler-generated labels as the destinations for jumps, etc.), and the assembler would determine the actual addresses. But this clearly requires an additional pass through (a version of) the source file and so is disallowed for single-pass compilers.

Unfortunate decisions
Although the description above has employed the notion that code may be generated with certain fields left to be fixed up later, there was an implicit assumption that the size of such code sequences was stable. This may not be the case. Many computers have provision for operations occupying different amounts of storage, notably relative addressing whereby if the destination is within say -128 or +127 addressing steps then an eight-bit address field can be used, otherwise a much larger address field is required to reach. Thus if the code were generated with a hopeful short address field, later it may become necessary to go back and adjust the code to use a longer field, with the consequence that earlier code referencing locations after the change will have to be adjusted as well. Likewise, later references going backwards across the change will have to be fixed, even those that had been to known addresses. And as well, the fixup information will itself have to be fixed, correctly. On the other hand, long addresses could be used for all cases when nearness is not certain, but the resulting code will no longer be ideal.

One-pass sequential input, irregular sequence output
Already mentioned are some possibilities for optimisation within a single statement. Optimisations across multiple statements would require that the content of such statements be held in some sort of data structure that could be analysed and manipulated before code is emitted. In such a case, producing provisional code, even with fixups allowed for, would be a hindrance. In the limit this means the compiler would generate a data structure representing the entire program in an internal form, but a straw could be clutched and the claim made that there is no actual second pass of the source file from start to end. Possibly in the PR document advertising the compiler.

Notably therefore, a compiler cannot generate its code in a single relentlessly-forwards sequence, still less immediately as each part of the source is read. The output could still be written sequentially, but only if output of a section is deferred until all pending fixups for that section have been made.

Declaration before usage
When generating code for the various expressions, the compiler needs to know the nature of the operands. For example, a statement such as A:=B; could produce rather different code depending on whether A and B are integers or floating-point variables (and what size: single, double or quadruple precision) or complex numbers, arrays, strings, programmer-defined types, etc. In this case, a simple approach would be to transfer a suitable number of words of storage, but, for strings this could be unsuitable as the recipient may be smaller than the supplier and in any case, only a part of the string may be used - perhaps it has space for a thousand characters, but currently contains ten. Then there are more complex constructions, as offered by COBOL and pl/i, such as  In this case, A and B are aggregates (or structures) with A having for example parts ,   and   while B has parts  ,   and  , and in that order. The "by name" feature means the equivalent of  But because   has no counterpart in A, and   has no counterpart in B, they are not involved.

All of this can be handled by the requirement that items are declared before they are used. Some languages do not require explicit declarations, generating an implicit declaration on first encountering a new name. Should a fortran compiler encounter a previously-unknown name whose first letter is one of I,J,...,N, then the variable will be an integer, otherwise a floating-point variable. Thus a name  would be a floating-point variable. This is a convenience, but after a few experiences with mistyped names, most programmers agree that the compiler option "implicit none" should be used.

Other systems use the nature of the first encounter to decide the type, such as a string, or an array, and so forth. Interpreted languages can be particularly flexible, with the decision being made at run time, somewhat as follows if condition then pi:="3.14" else pi:=3.14 fi; print pi; Should there be a compiler for such a language, it would have to create a complex entity to represent the variable pi, containing an indication as to just what its current type is and associated storage to represent such a type. This is certainly flexible, but may not be helpful for intensive computation as in solving A.x = b where A is a matrix of order a hundred, and suddenly, any one of its elements may be of a different type.

Procedures and functions
Declaration before use is likewise an easy requirement to meet for procedures and functions, and this applies also to the nesting of procedures within procedures. As with ALGOL, Pascal, PL/I and many others, MATLAB and (since 1995) Fortran allow a function (or procedure) to contain the definition of another function (or procedure), visible only within the containing function, but these systems require that they be defined after the end of the containing procedure.

But when recursion is allowed, a problem arises. Two procedures, each invoking the other, cannot both be declared before usage. One must be first in the source file. This need not matter if, as on the encounter with an unknown variable, sufficient can be deduced from the encounter that the compiler could generate suitable code for the invocation of the unknown procedure, with of course the "fixup" apparatus in place to come back and fill in the correct address for the destination when the procedure's definition is encountered. This would be the case for a procedure with no parameters, for example. The returned result from a function invocation may be of a type discernable from the invocation, but this may not always be correct: a function could return a floating-point result but have its value assigned to an integer.

Pascal solves this problem by requiring "predeclaration." One of the procedure or function declarations must be given first, but, instead of the body of the procedure or function, the keyword forward is given. Then the other procedure or function can be declared and its body defined. At some point the "forward" procedure or function is redeclared, along with the body of the function.

For the invocation of a procedure (or function) with parameters, their type will be known (they being declared before use) but their usage in the procedure invocation may not be. Fortran for example passes all parameters by reference (i.e. by address) so there is no immediate difficulty with generating the code (as always, with actual addresses to be fixed up later), but Pascal and other languages allow parameters to be passed by different methods at the programmer's choice (by reference, or by value, or even perhaps by "name") and this is signified only in the definition of the procedure, which is unknown before the definition has been encountered. Specifically for Pascal, in the specification of parameters a prefix "Var" signifies that it must be received by reference, its absence signifies by value. In the first case the compiler must generate code that passes the address of the parameter, while in the second it must generate different code that passes a copy of the value, usually via a stack. As always, a "fixup" mechanism could be invoked to deal with this, but it would be very messy. Multi-pass compilers can of course collate all the required information as they shuttle back and forth, but single-pass compilers cannot. Code generation could be paused while the scan advances (and its results be held in internal storage) until such time as the needed entity is encountered, and this might not be regarded as resulting in a second pass through the source because the code generation stage will soon catch up, it was merely halting for a while. But this would be complex. Instead a special construction is introduced, whereby the procedure's definition of parameter usage is declared "forward" of its later full definition so that the compiler may know it before use, as it requires.

From First Fortran (1957) onwards, separate compilation of portions of a program has been possible, supporting the creation of libraries of procedures and functions. A procedure in the source file being compiled that invokes a function from such an outside collection must know the type of result returned by the unknown function, if only to generate code that looks in the right place to find the result. Originally, when there were only integers and floating-point variables, the choice could be left to the rules for implicit declaration, but with the proliferation of sizes and also types the invoking procedure will need a type declaration for the function. This is not special, having the same form as for a variable declared inside the procedure.

The requirement to be met is that at the current point in a single-pass compilation, information on an entity is needed so that the correct code for it can be produced now, if with address fixups later. Whether the required information will be encountered later on in the source file or is to be found in some separately-compiled code file, the information is provided by some protocol here.

Whether or not all invocations of a procedure (or function) are checked for compatibility with each other and their definitions is a separate matter. In languages descended from Algol-like inspiration, this checking is usually rigorous, but other systems can be indifferent. Leaving aside systems that allow a procedure to have optional parameters, mistakes in the number and type of parameters will normally cause a program to crash. Systems that allow separate compilation of parts of a complete programme that later are "linked" together should also check for the correct type and number of parameters and results as mistakes are even easier to make, but often do not. Some languages (such as Algol) have a formal notion of "upgrading" or "widening" or "promotion", whereby a procedure that expects say a double-precision parameter may be invoked with it as a single precision variable, and in this case the compiler generates code that stores the single precision variable into a temporary double-precision variable which becomes the actual parameter. This however changes the parameter passing mechanism to copy-in, copy-out which may lead to subtle differences in behaviour. Far less subtle are the consequences when a procedure receives the address of a single precision variable when it expects a double precision parameter, or other size variations. When within the procedure the parameter's value is read, more storage will be read than that of its given parameter and the resulting value is unlikely to be an improvement. Far worse is when the procedure changes the value of its parameter: something is sure to be damaged. Much patience can be expended in finding and correcting these oversights.

Pascal example
An example of such a construct is the forward declaration in Pascal. Pascal requires that procedures be declared or fully defined before use. This helps a one-pass compiler with its type checking: calling a procedure that hasn't been declared anywhere is a clear error. Forward declarations help mutually recursive procedures call each other directly, despite the declare-before-use rule:

By adding a forward declaration for the function  before the function , the one-pass compiler is told that there will be a definition of   later on in the program.

When the actual declaration of the body of the function is made, either the parameters are omitted or must be absolutely identical to the original forward declaration, or an error will be flagged.

Pre-processor recursion
When declaring complex data aggregates, a possible usage of functions Odd and Even could arise. Perhaps if a data aggregate X has a storage size that is an odd number of bytes, a single byte item might be added to it under the control of a test upon Odd(ByteSize(X)) so as to make an even number. Given the equivalent declarations of Odd and Even as above, a "forward" declaration probably wouldn't be needed because the usage of the parameters is known to the pre-processor which is unlikely to present opportunities to choose between by reference and by value. However, there could be no invocations of these functions in the source code (outside their definitions) until after their actual definition, because the result of the invocation is required to be known. Unless of course the pre-processor engaged in multiple passes of its source file.

Forward declarations considered harmful
Anyone who has attempted to maintain coherence amongst the declarations and usages of procedures in a large program and its usage of libraries of routines, especially one undergoing changes, will have struggled over the usage of forward or similar added declarations for procedures invoked but not defined in the current compilation. Maintaining synchrony between widely-separated locations especially across different source files requires diligence. Those declarations using the reserved word are easy to find, but if the helpful declarations are not distinguished from ordinary declarations, the task becomes troublesome. The gain of supposedly swifter compilation may seem insufficient when simply abandoning the goal of one-pass compilation would remove this imposition.

title: One-pass compiler


text: Template:History of Austria

title: Template:History of Austria


text: File:Viva Forever.jpg

title: File:Viva Forever.jpg


text:
Schiffler point

[[Image:Schiffler Point.svg|300px|thumb|right|alt=Diagram of the Schiffler point on an arbitrary triangle|Diagram of the Schiffler Point

]]

In geometry, the Schiffler point of a triangle is a triangle center, a point defined from the triangle that is equivariant under Euclidean transformations of the triangle. This point was first defined and investigated by Schiffler et al. (1985).

Definition
A triangle $△ABC$ with the incenter $I$ has its Schiffler point at the point of concurrence of the Euler lines of the four triangles $△ABC$. Schiffler's theorem states that these four lines all meet at a single point.

Coordinates
Trilinear coordinates for the Schiffler point are
 * $$\frac{1}{\cos B + \cos C} : \frac{1}{\cos C + \cos A} : \frac{1}{\cos A + \cos B}$$

or, equivalently,
 * $$\frac{b+c-a}{b+c} : \frac{c+a-b}{c+a} : \frac{a+b-c}{a+b}$$

where $Sp$ denote the side lengths of triangle $△ABC$.

title: Schiffler point


text:
Talk:Meluhha

Afro-Uralic
Google for "Afro-Uralic" and "Bernard Sergant" reveals approx. 4 sources, all of which are copies of this text. "Bernard Sergent" and "Afro-Dravidian" have better (but still scarce) results, so I am changing them accordingly, although I'm not precisely sure what the term means. --April Arcus 23:45, 8 Jun 2005 (UTC)

 * I wrote this article about a year ago, so I don't actually remember what my references were. I'm going to go back and check. I *think* I may know where I got them. AreJay 00:17, 13 Jun 2005 (UTC)

 * I don't want to censor the Afro stuff, but surely this is fringe science? Bernard Sergent seems to be notable for his books about historical homosexuality, but that hardly makes him a "renowned" expert on Dravidian linguistics and early migrations. Some toning-down and putting-in-perspective may be needed here. dab (ᛏ) 08:32, 14 July 2005 (UTC)
 * it is quite fringy. I've cut it down and present it as Sergent's idiosyncratic view. I think it can stand like this, and I have removed the "disputed" tag. dab (ᛏ) 08:44, 14 July 2005 (UTC)

 * I am currently writing my dissertation on the Kushites in New Kingdom Egypt and came across the term Meluhha in the Amarna Letters. In Moran (1992) p139, it is suggested that Meluhha could probably be identified as Kush. Also in Amarna Letter EA 133, it says "[Sen]d me 10 [men from Meluh]ha: Ka[si that I may gua]rd" (as translated by Moran (1992) p215). As Kasi is the term for Kush, it would appear that Meluhha and Kush are the same. - Pim Aelbers, 12 March 2006

 * Wow, if that is substantiated, some parts of this article will definitely have to be revised, like the statement in there that no documents refer to Meluhha between 1700 and 668 BC... The main question I have is, do those parts you have in [brackets] represent lacunae that someone has hypothetically reconstructed, or what? Cheers, ፈቃደ (ውይይት) 03:09, 12 March 2006 (UTC)
 * interesting indeed, we need to make note of this. But, as Codex points out, [Meluh]ha does hardly equal Meluhha in terms of incontrovertibility :) dab (ᛏ) 09:12, 12 March 2006 (UTC)

 * Sorry, I did not check this page for some time. I am currently away from home so can't check the book by Moran for another week at least. I'll try to remember as soon as I get back. If my memory serves me right, in the specific letter I quoted, the [brackets] represent lacunae, but I think there are also letters where there are no or much smaller lacunae. These cases, however, do not also mention Kasi/Kush, but they still negate the comment that there is no mnetion of Meluhha between 1700 and 668 BC. Anyway, I'll check and report back as soon as I can get my hands on the book. - Pim Aelbers 5 April 2006

 * I just spotted this: "[...] suggesting that Meluhha first referred to Ethiopia, and later to the Indus Valley. It is important to note that from the third millennium BC onwards, Ethiopia itself was never referred to as Meluhha, but as Kush." The link between Ethiopia and Kush is often disputed. It was a translation of Kush that was used until the 1950s, but since it has become accepted that Kush refers to an area in southern Egypt and the Sudan. I think this needs amending - PK 17 Feb 2009 —Preceding unsigned comment added by 87.240.220.164 (talk) 23:05, 16 February 2009 (UTC)

Meluhha-Malaku question
Question: Could "the Moluccas", that is, "Maluku", be derived from Meluhha? Maybe because Meluhhan settlers to Maluku named it that just as English settlers gave North American places English names. Or because Meluhha means port. These two possible reasons blend together, I know. Could Meluhhans also have settled Kush and Kush then was sometimes called Meluhha? Richard L. Peterson 4/17/06

 * "Maluku" does seem phonetically very similar, but I have a feeling that "Meluhha" has a higher likelihood of being related more closely to ethnonyms and toponyms such as Brahui and Baluchistan, which are both obvious candidates for relics of the defunct Indus Valley civilization. It is especially interesting to me that the */-lah-/ vs. */-luh-/ variation that has been noted by Sumerologists can be found in various modern renditions of the Brahui/Baloch/Baluch name. Of course, all these names are also similar to "Maluku," as you mentioned, as well as to Sanskrit mleccha (barbarian) and Germanic Walha (used to refer to foreign peoples, often those that were under control of the Roman Empire, such as the Welsh of Britain or the Vlachs of Eastern Europe, but it is supposed to be derived from the name of the Volcae).

 * As for the genetic side of things, it appears that most of the "older" (Paleolithic?) populations of the Malay Archipelago, New Guinea, and Melanesia belonged to Haplogroup K5, Haplogroup K1, Haplogroup M, or Haplogroup C2. The present-day inhabitants of Maluku (the Moluccas) appear to share a great deal of genetic heritage with the Papuan peoples directly to their east, as the Y-chromosomes of a great percentage of the males of populations of both Maluku and Papua New Guinea fall into the aforementioned haplogroups (excluding Haplogroup K1, which appears to be limited to Fiji and the Solomon Islands in eastern Melanesia). All these "Paleolithic Melanesian" haplogroups are peculiar to populations of East Indonesia, Papua New Guinea, Melanesia, and Oceanic Austronesia (i.e., Micronesia and Polynesia), and they have apparently not been detected among any populations of continental Eurasia nor among any indigenous populations of Australia. This uniqueness of the Y-chromosomal complement of Papua-Melanesian-like populations seems to exclude any possibility of their being descended primarily from recent immigrants, and it seems more likely that most of the ancestors of these peoples have been resident in the region of the Malay Archipelago for tens of thousands of years, perhaps as many as 40,000 years. There is, however, a clearly intrusive, recently introduced element in the genetic heritage of many peoples of this region, and this is reflected also in the spread of languages belonging to the Malayo-Polynesian branch of the Austronesian language family. The Y-chromosome haplogroups associated with these Malayo-Polynesian-speaking colonists include Haplogroup O1, Haplogroup O2a, Haplogroup O3, and Haplogroup C*. Haplogroup R1b, Haplogroup G, Haplogroup C3, Haplogroup N, and Haplogroup D1 have also been found among modern speakers of Malayo-Polynesian languages, but it is not clear whether the minor presence of these haplogroups in the region is due solely to recent and historical (i.e., post-Neolithic Asian and colonial European) admixture from continental Eurasia. The high frequency of Haplogroup O2a in some parts of Indonesia may represent an earlier Neolithic influence (proto-Nicobarese? proto-Mon-Khmer? proto-Vietnamese?) from India or Southeast Asia, as this haplogroup is rather typical of Austro-Asiatic populations of mainland South and Southeast Asia, and its distribution is somewhat different from the distributions of Haplogroup O1 and Haplogroup O3, which are much more typical of Austronesian people and East Asians in general.

 * So, in short, for "Maluku" to have any sort of connection with "Meluhha," it would be necessary for it to have been applied to the island group by one of the populations of Neolithic settlers, either the Malayo-Polynesians or a hypothetical seafaring Austro-Asiatic population. It seems to me that this would only be possible if "Maluku," like Sanskrit "mleccha," had become a synonym for "barbarians" in the language of one of these invading Neolithic populations, and was applied to a region that had a high density of indigenous Papuan-like peoples. Ebizur 06:07, 10 November 2006 (UTC)

Does anyone know, or have an opinion?130.86.14.90 05:59, 23 May 2007 (UTC)-Rich Peterson
 * Ebizur, thankyou so much for the thoughtful and fascinating reply!Rich 06:22, 10 November 2006 (UTC)
 * I go back on forth on whether the following is silly:Could "Malay" itself be derived from Meluhha?

 * Transferred from help desk:question about possible connections between Meluhha, Moluccas (and maybe other words

like Malay, latin mal, Moloch, etc?)130.86.14.9 (talk) 06:23, 3 November 2008 (UTC)Hi, I moved my question and Ebizur's response from the Meluhha talk page. It is interesting to me that Ebizur seems to be suggesting that the M in Meluhha might have changed to a B in words like Baluchistan. If M did change to B in some daughter words, could that have given rise to "Bel" words like Baal and Beelzebub? Or maybe the B pronuncuiation is the original (something like Beluhha) and it was pronounced M by Sumer but B by The Meluhhans themselves?(That may even be what Ebizur had in mind, for all I know) Thanks in advance for any responses and also for Ebizur's thoughtful response.--Rich Peterson130.86.14.9 (talk) 06:24, 3 November 2008 (UTC)

 * These are interesting speculations, but we would have to attribute them to published sources in order to mention them in an article. Til Eulenspiegel (talk) 13:24, 3 November 2008 (UTC)
 * yes, perhaps i went against talk page guidelines by posting them here.--Rich Peterson130.86.14.35 (talk) 22:57, 3 November 2008 (UTC)

Magan
The statement that Magan is usually identified with Egypt is contradicted by Magan, which prefers Oman. Orcoteuthis (talk) 10:25, 14 June 2008 (UTC)
 * Isn't. It was one, then the other, as mentioned. -LlywelynII (talk) 16:07, 14 December 2010 (UTC)

Is there a "Make up your mind" template?
This is particularly awful:
 * Meluhha, however, is hotly debated. Currently (2010) the mainstream scholars of this period in history confidently identify Meluhha with the Harappan Civilization.

It's one or the other and can't be both. Will remove obvious "currently (2010)" ... "of this period in history" silliness ("Today, scholars" works just fine), but I'll have to leave the main contradiction since I don't know which of the two opposing views is more accurate or whether one should be discarded or merely modified (Something like "Meluhha's identity was hotly debated" e.g.). -LlywelynII (talk) 16:07, 14 December 2010 (UTC)
 * Another problem: article gives two different words, then says the Dravidian word is "the exact same." (And the claim seems specious anyway, as there are various Dravidian languages whose vocabulary presumably differs.) -LlywelynII (talk) 16:19, 14 December 2010 (UTC)

And what's going on here? "Magan is usually identified with Oman. This identification, however, is Assyrian; the Sumerian localization of Magan was probably Oman." 130.195.124.56 (talk) 01:48, 2 May 2012 (UTC)

Meluhha has been identified, in the textual record, by Ashurbanipal. His ID of Meluhha is the ONLY textual evidence giving it a reasonably precise location, in Egypt. Its quite astonishing that because it happens to drive a chariot through invented theories from academics of where they would like it to be, and they cant handle the truth. When the facts change, one should change their mind. There is no evidence it is in Indus valley. It was just a theory, and proven wrong. The academics continuing to reject the textual record are responsible for mythologizing, creating fake history, and bringing Assyriology in disrepute.

One can hardly criticise the Old testmanet for being very short of facts when we have modern academics creating myths of their own. How pathetic. Coldcall (talk) 13:27, 8 October 2020 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Meluhha. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20110607212814/http://www.harappa.com/arrow/meluhha_and_agastya_2009.pdf to http://www.harappa.com/arrow/meluhha_and_agastya_2009.pdf

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

Cheers.— InternetArchiveBot  (Report bug) 11:54, 20 December 2017 (UTC)

Austro-Asiatic arrived in India before Dravidian?
McIntosh's claim is at best controversial, it shouldn't be stated as a claim. Helenuh (talk) 09:51, 27 May 2018 (UTC)
 * I removed the claim because it has no bearing on the topic of this article. -- Kautilya3 (talk) 10:46, 27 May 2018 (UTC)

Captions
Why did you move the line Flat-bottomed river row-boats appear in two Indus seals, but their seaworthiness is debatable back to the other caption? I don't see anything about that line which is specific to only that image and not applicable to the other; moving it to the other makes the captions more even and keeps the context nearby. If anything, that line is more appropriate to the first image since it actually depicts rowers. – Scyrme (talk) 14:43, 3 July 2022 (UTC)
 * Hi Scyrme! Actually, that line is totally specific to the second seal (which is an Indus seal). The first photograph, on the contrary, is a Mesopotamian bas-relief, so, obviously, the "Indus seal" caption is inadequate there... The price to pay is indeed a bigger caption on the right. Best पाटलिपुत्र  Pat  (talk) 14:58, 3 July 2022 (UTC)
 * My mistake. The captions could be made more balanced by elaborating on the first by discussing its relevance, perhaps citing someone who makes a comparison between the boating technologies of these cultures. It would make things a bit clearer. – Scyrme (talk) 16:54, 3 July 2022 (UTC)

indus civilization were not mlecchas
It is just a so-called theory that Meluha people belonged to the Indus civilization, there is no solid evidence for this, and anyway, Shunga dynasty has called Mlechha to Yavanas. and indus civilisation is considered to be a better well mannered civilization, it is nonsense to call it them Mlecha. And the word Dravid itself is derived from dravin, the son of King Prithu and from Prithu itself the Sanskrit word Prithvi(earth) has come, in Hinduism Rama Krishna is a dark skinned deity who has been called Arya. 103.206.177.49 (talk) 12:19, 9 February 2023 (UTC)

The Indus Civilization was a civilized civilization, before Max Muller of yesterday the Europeans themselves did not know who they are who today call themselves Aryans.
There is no similarity between Mlech and Meluha, such words are slightly similar to each other, but it does not mean that they are similar! In some places some words of Europeans are abusive and in some places the same word is an indicator of respect! And the Sumerian people themselves were not of white race before, whereas even today the people there meet less than Europeans! indus civilization was a well developed civilization there jewelery factory to swastika everything found by archaelogist which related to so called aryan race ! 103.206.177.82 (talk) 09:50, 4 May 2023 (UTC)

Horrible article
Will take a stab at improvement. Not-so-recent discourse. TrangaBellam (talk) 13:10, 10 February 2024 (UTC)

title: Talk:Meluhha


text:
Mick Mills

Michael Dennis Mills MBE (born 4 January 1949) is an English former footballer who played for Ipswich Town, Southampton and Stoke City. He managed Stoke City, Colchester United and Birmingham City. During his career he achieved Ipswich Town's record number of appearances and captained England at the 1982 World Cup.

He was appointed Member of the Order of the British Empire (MBE) in the 1984 New Year Honours, for "services to association football".

Club career
Mills joined Portsmouth as a schoolboy, but the club abandoned its youth system, forcing him to look for a new club to begin his career. Ipswich Town took him on and he made his debut for the first team in 1966, aged just 17, in a 5–2 victory against Wolverhampton Wanderers. A full back who could play on either side but was more frequently used on the left, Mills spent his late teens in and out of the Ipswich first team but became an established regular in 1969, the year after the club achieved promotion to the First Division. It was also the year that Bobby Robson arrived as manager. Robson appointed Mills as team captain in 1971 and so began a close working relationship between coach and skipper which was at the forefront of Ipswich's rise to the top of the game for a decade. In 1973, Ipswich finished fourth in the First Division, won the Texaco Cup and qualified for the UEFA Cup. Ipswich began to finish in the top sector of the First Division with some regularity and played in numerous European competitions, but actual success seemed to elude them. Mills was the experienced captain of a young side consisting mainly of players brought through the ranks. They achieved third place in the First Division in 1977 and expected to go better than that the following year. However, that subsequent season in the First Division for Ipswich was disappointing as they struggled to find any consistency and finished a lowly 16th. There was a tremendous bonus for them in the FA Cup, however, as they reached the final where they beat favourites Arsenal 1–0 at Wembley. Mills, as captain, lifted the trophy – Ipswich's first major honour for 16 years. Ipswich, meanwhile, continued to hit high spots, finishing in the top five every year between 1978 and 1982, including a memorable season in 1981 which saw them just miss out on First Division and FA Cup glory, but won the UEFA Cup, which Mills duly collected after victory over AZ 67 Alkmaar in the final.

In the same year, Robson had told a 33-year-old Mills that his contract at Ipswich would not be renewed. Mills joined Southampton in November 1982 for £40,000, while Robson became Ron Greenwood's replacement as England manager, thereby ending Mills' international career too. He made 741 appearances for Ipswich over 17 years, a club record.

He joined Southampton in November 1982 and spent three seasons at The Dell making 123 appearances before leaving in the summer of 1985 to become player-manager at Stoke City. At Stoke, Mills played himself 44 times before deciding to retire from playing at the age of 38.

International career
During the 1972–73 season, England manager Alf Ramsey gave Mills his first international cap in a 1–1 draw with Yugoslavia at Wembley. Mills played at right back, a position which became more familiar to him with England than with Ipswich as his career continued. His second cap came in 1976 against Wales and he had eleven by the end of the 1977 campaign.

While his club had finally won a trophy, Mills' international career was in a semi-statuesque state. Don Revie had given him a number of games at left back, including the opening qualifiers for the 1978 World Cup (a straightforward 4–1 win for England over Finland, followed by a disappointing 2–0 defeat to Italy) but Mills had to cope with much competition for both full back slots. After Revie's departure, successor Ron Greenwood seemed to prefer Liverpool's Phil Neal at right back and Leeds United's Trevor Cherry at left back, with Mills as reserve for both. He didn't play in any of the remaining qualifying games, and England failed to reach the finals. Mills, however, started to become a regular in the England set-up in 1978 though some confusion continued over his best position as, of the eight internationals during that year, he played six at left back (with Neal on the right) and two at right back (with Cherry down the left). Mills sacrificed his place in the final England game of 1978, against Czechoslovakia, when Nottingham Forest right back Viv Anderson was handed his debut, becoming England's first black player.

Another young debutant, Kenny Sansom, emerged in 1979 to give Mills food for thought in the other full back slot, but he began to settle in at left back for his country as England qualified for the 1980 European Championships. Mills was named in Greenwood's squad but by now Sansom was an established option in the left back slot and he got the nod over Mills in England's opening two group games – a draw with Belgium and a defeat against hosts Italy – before Mills returned for the final game against Spain, which, despite an England win, saw their exit from the tournament. Mills played four England matches in 1981 – notably, they were all World Cup qualifiers for the 1982 tournament, with Greenwood happy to use less-experienced players like Anderson and Sansom in the friendly games which preceded them. When England beat Hungary at Wembley in their final qualifier to reach their first World Cup in a dozen years, Mills won his 35th cap.

Still switching flanks for his country when required (but rarely for club – he was almost always the left back), Mills played in just two of the preparation matches for the competition, but was named in the team as right back and captain (squad captain Kevin Keegan was injured) when England played their first game of the tournament against France in Bilbao. England won 3–1 and Mills stayed in the side for the remaining group matches, both of which England also won, although he switched to left back for the final match to allow a run-out for Neal. Greenwood reverted to a Mills-Sansom full back pairing for the second phase, but two goalless draws against West Germany and Spain (the latter of which finally saw Keegan's return to the team) sent England out of the competition.

Coaching and managerial career
In 1985, Mills became player-manager of Stoke City with Sammy Chung as his assistant. Mills joined Stoke with the club a very poor position having just been relegated from the First Division with a record low points tally and with little money available. He set about trying to restore some pride into the support and began well as Stoke beat Leeds United 6–2 on the third match of the 1985–86. Money was still a major problem so the club sold Mark Chamberlain to Sheffield Wednesday for £300,000 but typical of the financial climate at Stoke the money was used to reduce the club's overdraft. Results slowly improved and Stoke finished the season in 10th place in what was a season of recovery. More player sales followed in 1986–87 but the arrival of Peter Coates as chairman allowed for some new players to arrive most notably Lee Dixon, Nicky Morgan and former Ipswich teammate Brian Talbot. Morale was boosted again thanks to another large win over Leeds United (7–2) as Stoke climbed up the table into the play-offs. However their form could not be maintained and they had to settle for 8th position.

The 1987–88 season was frustrating for Stoke as little progress was made culminating in a finish of 11th. Further funds were raised by selling both Lee Dixon and Steve Bould to Arsenal. The 1988–89 season again saw Stoke finish in mid-table which prompted speculation that Mills would not be offered a new contract. In the end he was given a 'final chance' to get Stoke promoted and he was given a £1 million transfer budget by Coates for the 1989–90 season. He spent it all breaking the club's record transfer of £480,000 for Sheffield Wednesday defender Ian Cranson, £75,000 on Derek Statham from West Bromwich Albion, £175,000 for Ian Scott and £250,000 for Wayne Biggins both from Manchester City. However, with Cranson only making 19 appearances in 1989–90 missing most of the campaign due to a knee injury, results were poor and with Stoke rock bottom and heading into the third tier for the first time since 1927 he was sacked in November 1989.

The following year he agreed to become manager of Colchester United, who were adrift at the bottom of the league. Despite closing the gap Colchester failed to avoid relegation and Mills declined to stay on for the following season. Mills became chief scout for Sheffield Wednesday and then a coach and Assistant Manager at Birmingham City – at one point becoming caretaker manager after the dismissal of Trevor Francis.

Later career
After a period of time as Technical Director of Galaxy Sports Management Mills is now retired, but continues as a football summariser for BBC Radio Suffolk, which he continues to do to this day on match day live.

In 2010, Mills was named a patron of the Sir Bobby Robson Foundation.

As a player
Ipswich Town
 * FA Cup: 1978
 * UEFA Cup: 1981
 * Texaco Cup: 1973
 * Football League First Division runner-up: 1980–81, 1981–82
 * Football League Second Division: 1967–68

Southampton
 * Football League First Division runner-up: 1983–84

Individual
 * Ipswich Town Player of the Year: 1977–1978
 * Football League First Division PFA Team of the Year: 1976–77
 * Ipswich Town Hall of Fame: Inducted 2007

title: Mick Mills


text:
F. Richard Stephenson

F. Richard Stephenson (born Francis Richard Stephenson, 26 April 1941) is an Emeritus Professor at the University of Durham, in the  Physics department and the East Asian Studies department. His research concentrates on historical aspects of astronomy, in particular analyzing ancient astronomical records to reconstruct the history of Earth's rotation. He has an asteroid named after him: 10979 Fristephenson.

title: F. Richard Stephenson


text:
The Steadfast Tin Soldier

"The Steadfast Tin Soldier" (Den standhaftige tinsoldat) is a literary fairy tale by Hans Christian Andersen about a tin soldier's love for a paper ballerina. The tale was first published in Copenhagen by C.A. Reitzel on 2 October 1838 in the first booklet of ''Fairy Tales Told for Children. New Collection.'' The booklet consists of Andersen's "The Daisy" and "The Wild Swans". The tale was Andersen's first not based upon a folk tale or a literary model. "The Steadfast Tin Soldier" has been adapted to various media including ballet and animated film.

Plot
On his birthday, a boy receives a set of 25 toy soldiers all cast from one old tin spoon and arrays them on a table top. One soldier stands on a single leg because, as he was the last one cast, there was not enough metal to make him whole. Nearby, the soldier spies a pretty paper ballerina with a spangle on her sash. She, too, is standing on one leg, and the soldier falls in love. That night, a goblin among the toys in the form of a jack-in-the-box, who also loves the ballerina, angrily warns the soldier to take his eyes off her, but the soldier ignores him.

The next day, the soldier falls from a windowsill (presumably the work of the goblin) and lands in the street. Two boys find the soldier, place him in a paper boat, and set him sailing in the gutter. The boat and its passenger wash into a storm drain, where a rat demands the soldier pay a toll.

Sailing on, the boat is washed into a canal, where the tin soldier is swallowed by a fish. When this fish is caught and cut open, the tin soldier finds himself once again on the table top before the ballerina. Inexplicably, the boy throws the tin soldier into the fire, which is most likely the work of the jack-in-the-box goblin. A wind blows the ballerina into the fire with him; she is consumed by it. The maid cleans the fireplace in the morning and finds that the soldier has melted into a little tin heart, along with the ballerina's spangle, which is now burned as black as coal.

Publication
The tale was first published in Copenhagen, Denmark by C. A. Reitzel on 2 October 1838 in Fairy Tales Told for Children. First Collection. First Booklet Other tales in the booklet include "The Daisy" and "The Wild Swans". The tale was republished in collected editions of Andersen's work, first, on 18 December 1849 in Fairy Tales and again on 15 December 1862 in the first volume of Fairy Tales and Stories.

Adaptations

Ub Iwerks did a 1934 Cinecolor cartoon based on the story entitled "The Brave Tin Soldier". The cartoon's plot is slightly different from the original story. The antagonist is not a Jack-in-the-Box, but rather a toy king who wants the ballerina for himself. The tin soldier attacks the king, and as a result is put on trial and sentenced to death via firing squad. The ballerina pleads for his life to be spared, but her pleas go ignored. She then stands alongside the tin soldier and both are shot into a burning fireplace, where he melts into the shape of a heart with her. The cartoon has a happy ending, as both the tin soldier and ballerina are sent to "Toy Heaven", where the tin soldier now has both legs.

In the 1940 Disney animated film Fantasia, a shorter/shortened version of the tale was planned for the film as indicated by 1938 storyboards. Unfortunately, the ending of the segment did not satisfy Walt Disney and the story was set aside.

George Pal's war-themed 1941 Puppetoon, "Rhythm in the Ranks", is likely a loose adaptation of Andersen's story, with a toy soldier getting discharged after falling in love with an ice-skating ballerina.

Paul Grimault (with Jacques Prévert) did a 1947 colour French cartoon Le Petit Soldat that portrayed the title character as a toy acrobat who is called to war and returns crippled but determined to rescue his ballerina.

Marcia Brown's 1953 picture book illustrating the story in M. R. James's translation was awarded a Caldecott Honor.

Ivo Caprino's 1955 puppet movie "The Steadfast Tin Soldier".

Shawn Phillips's 1964 song 'Little Tin Soldier' is also based on the Hans Christian Andersen tale and was covered by Donovan in 1965.

The Small Faces 1967 song Tin Soldier opens with the lyric "I am a little tin soldier that wants to jump into your fire", and appears to have been influenced by the Andersen story.

In 1971, the Japanese anime anthology series Andersen Monogatari made an episode adaptation.

Andersen's contemporary August Bournonville choreographed the tale for his ballet A Fairy Tale in Pictures, and George Balanchine choreographed the tale in 1975, allowing the soldier and the ballerina to express their love before the ballerina is blown into the fire. Georges Bizet set the tale to music in Jeux d'Enfants.

In 1976, Soyuzmultfilm made an animated adaptation.

A live-action musical adaptation was the second of four episodes of The Enchanted Musical Playhouse that originally aired from 1984 to 1985 on the (then) brand new Disney Channel.

In 1985, Harmony Gold made an English dub of The Little Train adaptation of the story, the film was originally made in Italy in the late 70s.

In 1986, Atkinson Film-Arts made an animated adaptation featuring the voices of Rick Jones, Terrence Scammell, and Robert Bockstael, with narration by Christopher Plummer.

In 1989, Studio Miniatur Filmowych made an animated adaptation.

In 1991, it was adapted into an animated television movie as part of Timeless Tales from Hallmark, which was produced by Hanna-Barbera and Hallmark. It featured the voices of George Newbern as the Tin Soldier, Megan Mullally as the Ballerina, Tim Curry as the Jack-in-the-box and Paul Williams as a frog named Frogbauten. It was Curry's second clown role after he played Pennywise in It (1990).

Children's author Tor Seidler adapted the book in 1992, with illustrations by Fred Marcellino.

1995 saw Jon Voight make his directorial debut with The Tin Soldier, a Showtime family film loosely based on Andersen's story.

In 1996, Vivian Little and Kathleen Mills adapted Anderson's story into a full-length ballet for the Dance Fremont studio in Seattle. The ballet is still produced every winter, as an alternative to the popular Christmas ballet The Nutcracker, which many American studios produce in December. Dance Fremont centers the story around a young deaf boy who receives the toys for Christmas, and uses Signed Exact English for all dialogue.

In the 2000 Disney animated film Fantasia 2000, an adaptation of the tale is set to the first movement of the Piano Concerto No. 2 in F Major by Dmitri Shostakovich. The segment differs slightly from Andersen's tale: there are only five soldiers, but still only one with one leg; the ballerina appears to be made of porcelain; the soldier is disappointed to discover the ballerina has two legs, but the ballerina still accepts him; at the end, the jack-in-the-box villain is the one that perishes in the fire instead of the soldier and ballerina who both remain in one piece. Other animated films for children have been produced on the tale, and, in 1975, a science fiction fantasy feature film, The Tin Soldier.

In 2002, the series The Fairytaler adapted it in the story "The Hardy Tin Soldier".

The music video of Anastacia's 2005 song Heavy on My Heart was loosely inspired by Andersen's story.

In Stieg Larsson's 2006 thriller The Girl Who Played with Fire, the fiercely independent protagonist Lisbeth Salander compares the journalist Mikael Blomkvist, who had stayed loyal to her despite her repeated blatant rejection of him, with Andersen's steadfast tin soldier (implicitly comparing herself with Andersen's ballerina).

Mike Mignola's graphic novel Baltimore, or The Steadfast Tin Soldier and the Vampire fuses the poignancy of "The Steadfast Tin Soldier" with supernatural Dracula myths, set in a post-World War I environment. Kate DiCamillo's The Miraculous Journey of Edward Tulane (2006) makes use of the tale's themes.

The Hanson song Soldier is also based on this fairy tale. The song doesn't mention the goblin at all. The tin soldier fell out the window when the wind blew and the tin soldier and ballerina melted together while dancing and the ballerina fell near the fireplace.

In Anirudh Arun's 2013 bildungsroman The Steadfast Tin Soldier?, the protagonist Ashwin is compared to the tin soldier by his successful brother Abhinav (the society thus plays the part of the dangerous jack-in-the-box).

Daft Punk's music video for the song "Instant Crush" is said to have been inspired by "The Steadfast Tin Soldier".

title: The Steadfast Tin Soldier


text: User talk:84.170.126.80

title: User talk:84.170.126.80


text:
Wikipedia:Articles for deletion/ABOP

 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. Golbez 08:59, Jun 18, 2005 (UTC)

ABOP
Looks like a vanity page to me... quercus robur 23:37, 8 Jun 2005 (UTC)

Revise that- actually looks like a pack of lies! quercus robur 23:39, 8 Jun 2005 (UTC) Keep - This is information about a band, not vanity. Jesusjones
 * Delete - either way, it doesn't look Wikipedic. FreplySpang (talk) 23:42, 8 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 .

title: Wikipedia:Articles for deletion/ABOP


text:
User:Cngvr

Just doing my two bits.

title: User:Cngvr


text:
Kalundborg Municipality

Kalundborg Municipality (Kalundborg Kommune) is a kommune in the Region Sjælland on the west coast of the island of Zealand in Denmark. The municipality covers an area of 604 km2, and has a total population of 48,309 (1. January 2024). Its mayor is Martin Damm, a member of Venstre. The main town and the site of its municipal council is the city of Kalundborg.

The municipality is surrounded by water on three sides:
 * Samsø Bælt— the strait which separates the municipality from the island of Samsø— and Sejerø Bay (Sejerø Bugt) — the bay in which the island of Sejerø is located) to the north
 * The Great Belt (Storebælt)— the strait which separates Zealand from the island of Funen) and the Kattegat to the west
 * Jammerland Bay (Jammerland Bugt) to the south.

The municipalities of Samsø to the northwest, and Juelsminde on the Jutland peninsula to the west are thus also Kalundborg's municipal neighbors, albeit separated by water.

Ferry lines connect the municipality to Aarhus on the Jutland peninsula, and to the island of Samsø at the central harbour in Kalundborg. The harbour is conveniently located near the Kalundborg train station, which connects to the cities of Holbæk and Copenhagen. A large industrial zone, including a South Harbour?, is located south of the town's central area.

On January 1, 2007 Kalundborg municipality was, as the result of Kommunalreformen ("The Municipal Reform" of 2007), merged with existing Gørlev, Hvidebæk, Bjergsted, and Høng  municipalities to form the new Kalundborg municipality.

Urban areas
The ten largest urban areas in the municipality are:

Politics
Kalundborg's municipal council consists of 27 members, elected every four years.

Municipal council
Below are the municipal councils elected since the Municipal Reform of 2007.

Attractions
The tip of Røsnæs peninsula is the westernmost point on the island of Zealand. On the northern side of the peninsula is the Skanse Forest (Skanseskoven) which has a rich birdlife. During the spring and autumn it is visited by many migrating birds.

Stately Lerchenborg Castle, the traditional seat of the aristocratic Lerche family, is located on the forest-covered Asnæs peninsula. It is one of the finest examples of baroque architecture in Denmark. The home and gardens are open to the public, but is closed during 2005 for restoration. A number of special arrangements take place at the castle during the year, including a Christmas market, music concerts and car shows. The castle was built in 1747 by General Lerche-Lerchenborg. In the southern side wing is a room dedicated to Hans Christian Andersen who was guest in 1862.

The municipality also encompasses a large body of water near its northern coast— Saltbæk Cove (Saltbæk Vig), which is one of the largest lakes in West Zealand and a bird reservation. Nearby to the south is a public beach.

Our Lady Church (Vor Frue Kirke), erected ca. 1170, is located in the center of Kalundborg city's old quarter called Højbyen ("The High City"). It is a beautiful and unique, five-spired church which is believed to have been built by Esbern Snare. It is closely associated with King Valdemar I and the famous Archbishop Absalon. The city center has cobblestone streets, narrow streets, and well-preserved half-timbered houses from the Middle Ages.

title: Kalundborg Municipality


text: User talk:69.157.83.168

title: User talk:69.157.83.168


text:
Collegiate Peaks Wilderness

The Collegiate Peaks Wilderness is a 168000 acre area located in central Colorado between Leadville and Buena Vista to the east and Aspen to the west and Crested Butte to the southwest. Most of the area is in the San Isabel and Gunnison National Forests, with a smaller area in the White River National Forest southeast of Aspen. Most of the area is in northwest Chaffee County with smaller portions in Gunnison, Pitkin, and Lake counties.

Geography
The Collegiate Peaks area includes much of the Sawatch Range and has the highest average elevation of any wilderness area in the United States. Five of the area's 14000 ft peaks are named for famous universities and colleges, including Mt. Harvard, Mt. Oxford, Mt. Yale, Mt. Princeton and Mt. Columbia. These peaks are the source of the name for the wilderness area, which includes them all but Mt. Princeton. Other fourteeners in the area include La Plata Peak, Mount Belford, Huron Peak, and Missouri Mountain. The Collegiate Peaks also includes several notable 13000 ft peaks including the Three Apostles, a chain of three mountains about six miles (10 km) south of the ghost town of Winfield. The middle peak of the Three Apostles is also referred to as Ice Mountain and is generally recognized as one of the most difficult peaks to climb in the Sawatch Range. Notably, the Collegiate Peaks also has two peaks named Grizzly Peak. One is south of Independence Pass at 13,988, and the other is north of Taylor Reservoir on the Continental Divide at 13,281.

The area is an important watershed for three rivers on both sides of the Continental Divide: the upper Arkansas River, the Gunnison River, and the Roaring Fork River. There are numerous alpine creeks in the area's wide valleys and these are all quite marshy. Snow does not usually begin to melt until May or June and it remains year-round in places on some of the high peaks.

Both the Continental Divide Trail and the Colorado Trail cross the area. The Continental Divide Trail follows the course of the Continental Divide itself with several side spurs. The Colorado Trail passes through the lower eastern portion of the area and crosses Pine Creek, Frenchman Creek and Three Elk Creek all of which drain into the Arkansas River north of Buena Vista.

History
In earlier times the area was inhabited by various people. There are groves of old growth Ponderosa Pine on the eastern side which bear evidence of stripping by bands of native Utes who inhabited the area and used the bark from living trees for clothing and food. The area is also dotted with the evidence of mining operations from the last century. In the Pine Creek valley - one of the central valleys between Mounts Oxford, Belford and Missouri to the north and Mt. Harvard and Columbia to the south, there is evidence of an earlier settlement on both sides of the stream comprising four cabins and a horse corral. South of the town of Winfield are the spare remains of the town of Harrison at the base of Mt. Huron.

The Collegiate Peaks borders several other Colorado wilderness areas including: Buffalo Peaks, Maroon Bells-Snowmass, Hunter-Fryingpan, and Mount Massive. It was designated by congress as a wilderness area in 1980 in accordance with the provisions of the Wilderness Act of 1964.

Regulations/Prohibitions

 * Having more than 15 persons in any one group.
 * Having more than a combination of 25 people and pack or saddle animals in any one stock group.
 * Possessing dogs, except for working stock dogs, or dogs used for legal hunting purposes, unless under physical restraint of a leash.
 * Camping within one hundred feet of developed trails.
 * Building, maintaining, attending, or using a campfire, within 100 feet of lakes, streams and forest development trails.
 * Hitching, hobbling or tethering any pack or saddle animal within one hundred (100) feet of lakes, streams and forest development trails.
 * Short-cutting a switchback on a forest development trail.

title: Collegiate Peaks Wilderness


text:
Talk:Hoosac Range

Untitled
Removing this line for the time being:

Its highest peak is Crum Hill, with an elevation of 2,841 feet.

I can't find a source that says Crum Hill is in the Hoosac Range, other articles imply the major peaks of that range are Spruce Hill and Borden Mountain. Crum Hill is certainly close by.

Will try to confirm this one way or the other.

Econrad 23:40, 8 Jun 2005 (UTC)

title: Talk:Hoosac Range


text:
Wikipedia talk:Articles for deletion/ABOP

More like an insanity page!

Cuz ABOP is insane and uh good.


text: User talk:4.245.7.207

title: User talk:4.245.7.207