text:
Chhayanaut

The Chhayanaut Sangeet Vidyatan (ছায়ানট) is an institution devoted to Bengali culture, founded in Bangladesh in 1961. As in the case of many similar organizations, it was established during Pakistani rule in Bangladesh to promote and nurture the cultural and musical heritage of Bengal. Every year, Chhayanaut arranges activities in order to celebrate the Pahela Boishakh, the first day of the Bengali new year.

Chhayanaut hosts numerous cultural events throughout the year. These include the Nababarsha or 'Bengali New Year' celebration held beneath the Banyan Tree at Ramna, commemorations of various national holidays, festivals dedicated to Rabindranath Tagore and Kazi Nazrul Islam including their birth and death anniversaries, as well as seasonal programs. Additionally, they organize folklore and folk music festivals, theatre festivals, dance ceremonies, and speeches by esteemed experts. Among their regular activities, Chhayanaut operates a music center and a cultural and general education school called "Nalanda." They also conduct a program called "Shikhad" to introduce children to Bengali culture. They have initiatives to provide activities for autistic babies as well as the elderly. Furthermore, they publish a Bengali quarterly magazine titled "Bangladesher Hridoy Hote" that focuses on literature and culture.

In 2015 Chhayanaut was conferred with the prestigious Tagore Award for promoting cultural harmony.

title: Chhayanaut


text:
Félix Benítez Rexach

Félix Benítez Rexach (March 27, 1886 – November 2, 1975) was a Puerto Rican engineer and businessman who built the Normandie Hotel, located in San Juan, Puerto Rico.

Life and career
Benitez Rexach was born in Vieques. In 1928, he fell in love with and married Lucienne Dhotelle, a French singer better known as La Môme Moineau (the kid sparrow).

Normandie Hotel
Benítez Rexach decided to surprise his wife with the construction of a yacht as a replica of the majestic ship. Moineau wasn't satisfied and Benítez Rexach decided then to construct a hotel with the form of a great transatlantic vessel. Designed by architect Raúl Reichard (1908–1996), the hotel began construction in 1938. He named the "Normandie Hotel" in honor of the French liner and presented it as a gift to his beloved wife and to the people of Puerto Rico. The hotel opened on October 10, 1942 at an estimated cost of more than US$2,000,000.

Bridges
Rexach designed and/or built a number of Puerto Rico's historic bridges, including the "futuristic" Bridge No. 122 and Las Cabañas Bridge (both of those being joint works with designer Rafael Nones).

Other works
Benítez Rexach also worked on various projects in the Dominican Republic, as a consequence of the friendship which he had with that country's dictator, Rafael L. Trujillo. Among his works in that country were the Port of Santo Domingo and the "Avenida Jorge Washington" (George Washington Avenue).

Political beliefs
Benítez Rexach was a passionate Puerto Rican patriot and a personal friend of Pedro Albizu Campos, president of the Puerto Rican Nationalist Party. He was a firm believer in the Puerto Rican independence movement and once visited Luis A. Ferré, the pro-statehood Governor of Puerto Rico, at the governor's mansion and asked him to proclaim the independence of Puerto Rico, since in his words: "Puerto Rico was a superior nation and the most developed in the Caribbean."

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

title: Félix Benítez Rexach


text:
Boston F.C.

Boston F.C. or Boston Football Club may refer to one of these association football (soccer) clubs:

England

 * Boston F.C. (1878), Boston, Lincolnshire, football club from the 1880s
 * Boston Town F.C., Boston, Lincolnshire of the United Counties League Premier Division (tiers 9-10 of the English football league system)
 * Boston United F.C., Boston, Lincolnshire of the National League North (tier 6 of the English football league system)

United States

 * Boston City FC, Malden, Massachusetts (near Boston), of the National Premier Soccer League, the fourth tier of the United States soccer league system
 * FC Boston, Waban, Massachusetts (near Boston), of the Premier Development League, unofficially the premier men's amateur soccer league of the United States and Canada
 * New England Revolution, Foxborough, Massachusetts (near Boston) of Major League Soccer, the premier soccer league of the United States and Canada

title: Boston F.C.


text:
User talk:Davidpk212

Welcome!
Hi,, Welcome  to Wikipedia! I hope you like this place — I sure do — and want to stay. Before getting too in-depth, please read about the simplified ruleset. If you need help on how to title new articles check out the naming conventions, and for help on formatting the pages visit the manual of style. If you need help look at Help and the FAQ, plus if you can't find your answer there, check the Village Pump (for Wikipedia related questions) or the Reference Desk (for general questions)! There's still more help at the Tutorial and Policy Library. Plus, don't forget to visit the Community Portal. And if you have any more questions after that, feel free to post them on my user talk page. ---

Additional tips
Here's some extra tips to help you get around in the 'pedia!
 * If you want to play around with your new Wiki skills the Sandbox is for you.
 * You can sign your name using three tildes (~). If you use four, you can add a datestamp too.
 * If you ever think a page or image should be deleted, please list it at the articles for deletion page. There is also a votes for undeletion page if you want to retrieve something that you think should not have been deleted.
 * If you believe something you added or created has been unfairly treated, talk to the user or follow the steps in resolving disputes
 * If you're still entirely confused, or would like to get a better grasp of your wikipedia skills, and you have an IRC client (or don't mind getting one), check out the Bootcamp. It's not what it sounds like, but it is fun and can help you with your editing skills.
 * If you're bored and want to find something to do, try the Random page button in the sidebar, or check out the Open Task message in the Community Portal.

Happy Wiki-ing.
- Trevor MacInnis (Talk | Contribs) 20:51, 5 October 2005 (UTC)

License tagging for File:Wikipedia-globe.png
Thanks for uploading File:Wikipedia-globe.png. You don't seem to have indicated the license status of the image. Wikipedia uses a set of image copyright tags to indicate this information; to add a tag to the image, select the appropriate tag from this list, click on this link, then click "Edit this page" and add the tag to the image's description. If there doesn't seem to be a suitable tag, the image is probably not appropriate for use on Wikipedia.

For help in choosing the correct tag, or for any other questions, leave a message on Media copyright questions. Thank you for your cooperation. --ImageTaggingBot (talk) 19:06, 28 December 2008 (UTC)

Template:Infobox programming language
Given lexical scoping's overwhelming dominance, I question the utility of the new "Scoping" field. Your thoughts? --Cyber cobra (talk) 18:51, 4 September 2011 (UTC)

Quixotic plea
You are invited to join the discussion at Wikipedia talk:Wikipediholism test. Thanks. —  04:54, 23 May 2015 (UTC)

File:Blue Fuzz.jpg listed for discussion
A file that you uploaded or altered, File:Blue Fuzz.jpg, has been listed at Files for discussion. Please see the to see why it has been listed (you may have to search for the title of the image to find its entry). Feel free to add your opinion on the matter below the nomination. Thank you. ShakespeareFan00 (talk) 08:49, 13 September 2018 (UTC)

MfD nomination of Portal:Radio
Portal:Radio, a page which you created or substantially contributed to, has been nominated for deletion. Your opinions on the matter are welcome; you may participate in the discussion by adding your comments at Wikipedia:Miscellany for deletion/Portal:Radio and please be sure to sign your comments with four tildes ( ~ ). You are free to edit the content of Portal:Radio during the discussion but should not remove the miscellany for deletion template from the top of the page; such a removal will not end the deletion discussion. Thank you. Nemo 20:02, 4 October 2019 (UTC)

title: User talk:Davidpk212


text:
Talk:List of kings of Lydia

Untitled
The dates given for the later kings on the "List of Kings of Lydia" entirely conflict with the dates given on the pages of the individual kings. A careful revision of all of this material is needed.

I think the dates here are based on Herodotus, which doesn't synchronize properly with Assyrian sources. This page needs to be changed, I think. john k 21:20, 5 October 2005 (UTC)

Disputed status - help needed for chronology
I tried, honestly. But I have no idea how to fix this important list of rulers. Here are the problems that I see: --Serpent's Choice 05:35, 26 December 2006 (UTC)
 * The dates given for the later kings don't match the dates in those kings' articles. I'm not at all sure which, if any, are accepted.
 * Dynasty names. I've got some sources that seem to go with this Heraclid/Tilonid/Mermnad dynastic order, and others that go Atyad/Heraclid = Tilnoid/Mermnad.  I suspect the latter, but I've got little to go on here.
 * Kings themselves. I've got no clue where the list of kings before Ardys I came from.  Some of those names are more commonly identified with random mythological elements (Marsyas).  Omphale is certainly attested to in classical text, although I wonder if she's semi-legendary.  I've already removed Tantalus and Heracles from the list; I'm unwilling to accept claims that they are meant to represent real Lydian kings without serious documentation.
 * In the same vein, who the heck is Ker?
 * Indeed, the main Lydia article employs the Atyad/Heraclid = Tilonid/Mermnad dynastic progression. Of course, it is also virtually unreferenced. Serpent's Choice 05:43, 26 December 2006 (UTC)

Manes, Cotys, Atys, Tmolus
Manes (king), as his name implies, was the first of his line, and Tmolus, as the accounts -of any sort- surrounding him make clear, was the last. After Tmolus, the reign was taken over by another dynasty. I don't why anyone wanted to couple Manes and Tmolus, and place Tantalus at the bottom of Atyads (Tantalids). Also, Herodotus mentions, in one section of his history, Cotys between Manes and Atys, and he doesn't in another section. I suggest we insert Cotys under Manes with eventually a question mark, and name another Cotys who came in the line later, as [[Cotys II, perhaps again with a question mark. Cretanforever (talk) 12:17, 10 February 2010 (UTC)

title: Talk:List of kings of Lydia


text:
User:Careax

This user feels that Wikipedia has become blighted by turf wars, bias, cronyism, petty bureaucracy and pedantic zealots. He is tired of dealing with the users who perpetuate these problems and their unprofessional attitudes. As a result, he has stopped making contributions. He wishes all the good contributors luck in their struggle against the causes of these problems!

title: User:Careax


text:
Talk:Sea Cliff (disambiguation)

Merged with Seacliff (disambiguation)
Given the lack of discussion for the move to "Sea Cliff" and the overlap between this page and Seacliff (disambiguation), I've merged the content of the two onto that page, and made this one redirect there. I'll be checking for double redirects and the like. Dpv 15:52, 26 June 2006 (UTC)

title: Talk:Sea Cliff (disambiguation)


text:
User talk:Eatatchipotle

Welcome!

Hello, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers: I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~); this will automatically produce your name and the date. If you have any questions, check out Where to ask a question or ask me on my talk page. Again, welcome! Bushytails 20:52, 5 October 2005 (UTC)
 * The five pillars of Wikipedia
 * How to edit a page
 * Help pages
 * Tutorial
 * How to write a great article
 * Manual of Style

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

If you have uploaded other unlicensed media, please check whether they're used in any articles or not. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that all non-free media not used in any articles will be deleted after seven days, as described on criteria for speedy deletion. Thank you. BetacommandBot 08:24, 18 August 2007 (UTC)

File permission problem with File:Savethewheel1.jpg
Thanks for uploading File:Savethewheel1.jpg. I noticed that while you provided a valid copyright licensing tag, there is no proof that the creator of the file agreed to license it under the given license.

If you created this media entirely yourself but have previously published it elsewhere (especially online), please either
 * make a note permitting reuse under the CC-BY-SA or another acceptable free license (see this list) at the site of the original publication; or
 * Send an email from an address associated with the original publication to , stating your ownership of the material and your intention to publish it under a free license. You can find a sample permission letter here. If you take this step, add OTRS pending to the file description page to prevent premature deletion.

If you did not create it entirely yourself, please ask the person who created the file to take one of the two steps listed above, or if the owner of the file has already given their permission to you via email, please forward that email to .

If you believe the media meets the criteria at Non-free content, use a tag such as or one of the other tags listed at File copyright tags, and add a rationale justifying the file's use on the article or articles where it is included. See File copyright tags for the full list of copyright tags that you can use.

If you have uploaded other files, consider checking that you have provided evidence that their copyright owners have agreed to license their works under the tags you supplied, too. You can find a list of files you have created in [ your upload log]. Files lacking evidence of permission may be deleted one week after they have been tagged, as described on criteria for speedy deletion. You may wish to read the Wikipedia's image use policy. If you have any questions please ask them at the Media copyright questions page. Thank you. —Bkell (talk) 16:36, 27 August 2012 (UTC)

File permission problem with File:Savethewheel1.gif
Thanks for uploading File:Savethewheel1.gif. I noticed that while you provided a valid copyright licensing tag, there is no proof that the creator of the file has agreed to release it under the given license.

If you are the copyright holder for this media entirely yourself but have previously published it elsewhere (especially online), please either
 * make a note permitting reuse under the CC-BY-SA or another acceptable free license (see this list) at the site of the original publication; or
 * Send an email from an address associated with the original publication to permissions-en@wikimedia.org, stating your ownership of the material and your intention to publish it under a free license. You can find a sample permission letter here. If you take this step, add OTRS pending to the file description page to prevent premature deletion.

If you did not create it entirely yourself, please ask the person who created the file to take one of the two steps listed above, or if the owner of the file has already given their permission to you via email, please forward that email to permissions-en@wikimedia.org.

If you believe the media meets the criteria at Non-free content, use a tag such as non-free fair use or one of the other tags listed at File copyright tags, and add a rationale justifying the file's use on the article or articles where it is included. See File copyright tags for the full list of copyright tags that you can use.

If you have uploaded other files, consider checking that you have provided evidence that their copyright owners have agreed to license their works under the tags you supplied, too. You can find a list of files you have created in [ your upload log]. Files lacking evidence of permission may be deleted one week after they have been tagged, as described on criteria for speedy deletion. You may wish to read Wikipedia's image use policy. If you have any questions please ask them at the Media copyright questions page. Thank you. Sfan00 IMG (talk) 22:35, 2 June 2016 (UTC)

title: User talk:Eatatchipotle


text:
Jack Carter (politician)

John William Carter (born July 3, 1947) is an American businessman and politician who ran for the United States Senate in Nevada in 2006, losing to John Ensign in the general election. He is the eldest child of former President Jimmy Carter and First Lady Rosalynn Carter.

Early life and education
Carter was born at the Naval Medical Center Portsmouth in Portsmouth, Virginia, four days before his parents’ first wedding anniversary. Raised in Plains, Georgia, he spent winters working at his father's peanut farm warehouse, where his wages began at 10 cents per hour. Carter struggled when he first entered college in 1965, attending Georgia Institute of Technology, Emory University, and Georgia Southwestern State University before enlisting in the United States Navy in April 1968 at the suggestion of his father. Carter served during the Vietnam War, on the salvage ship USS Grapple (ARS-7). He received a general discharge in late 1970 after he and 53 classmates were caught smoking marijuana at the Naval Reactors Facility in Idaho Falls, Idaho. Carter returned to Georgia Tech, earning a degree in nuclear physics. Following graduation, he immediately entered the University of Georgia School of Law, receiving his Juris Doctor in 1975.

In 1985, he was interviewed by David Wallechinsky for his book, Midterm Report: The Class of '65: Chronicles Of An American Generation (1986). It was later published as Class Reunion '65, Tales of an American Generation, written from the perspective of two decades post-high school graduation. Twenty-eight then-contemporary high school graduates were interviewed, with Wallachinsky noting the profound impact of the war on Vietnam on their lives.

Career
In 1981, Carter moved to Chicago, where he worked for the Chicago Board of Trade and Citibank.

2006 senatorial campaign
Carter moved to Nevada in 2002 and ran unsuccessfully for a seat in the United States Senate as a Democrat against incumbent Republican Senator John Ensign of Nevada in the 2006 election. Carter won the Democratic nomination on August 15, 2006, against opponent Ruby Jee Tun, a teacher from Carson City.

Carter's primary issues were his opposition to the Iraq War and his concerns about the healthcare system, especially what he characterized as its failure to meet its commitment to veterans.

Personal life
Stepson John Chuldenko, from Brasfield's first marriage, is a film director and has directed television ads for the campaign; stepdaughter Sarah Reynolds (née Chuldenko) is a book illustrator (for Jimmy Carter's poetry volume) and painter who has worked with Jeff Koons, and is married to Australian artist Stephen Reynolds.

title: Jack Carter (politician)


text: Category:Deputy Directors for Management of the Office of Management and Budget


text:
User talk:Zhopa

Welcome!

Hello,, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers: I hope you enjoy editing here and being a Wikipedian! Please sign your name on talk pages using four tildes (~~); this will automatically produce your name and the date. If you need help, check out Where to ask a question, ask me on my talk page, or place  on your talk page and someone will show up shortly to answer your questions. Again, welcome!
 * The five pillars of Wikipedia
 * How to edit a page
 * Help pages
 * Tutorial
 * How to write a great article
 * Manual of Style

-- 20:55, 5 October 2005 (UTC)

However, please see Username for policy on choosing usernames. -- 20:55, 5 October 2005 (UTC)

Unreferenced BLPs
Hello Zhopa! Thank you for your contributions. I am a bot alerting you that 1 of the articles that you created  is tagged as an Unreferenced Biography of a Living Person. The biographies of living persons policy requires that all personal or potentially controversial information be sourced. In addition, to insure verifiability, all biographies should be based on reliable sources. if you were to bring this article up to standards, it would greatly help us with the current Category:All_unreferenced_BLPs article backlog. Once the article is adequately referenced, please remove the unreferencedBLP tag. Here is the article:

Thanks!--DASHBot (talk) 19:57, 8 January 2010 (UTC)
 * 1) Keir Giles -

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

PLEASE NOTE:

 * I am a bot, and will therefore not be able to answer your questions. If you have a question, place a template, along with your question, beneath this message.
 * I will remove the request for deletion if the file is used in an article once again.
 * If you receive this notice after the image is deleted, and you want to restore the image, click here to file an un-delete request.
 * To opt out of these bot messages, add  to your talk page.
 * If you believe the bot has made an error, please turn it off here and leave a message on my owner's talk page.

Thank you. DASHBot (talk) 05:47, 21 August 2011 (UTC)

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

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

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article until the discussion has finished. MicrobiologyMarcus (talk) 13:23, 3 October 2023 (UTC)

title: User talk:Zhopa


text: Category:Airports in the Cayman Islands

title: Category:Airports in the Cayman Islands


text:
Category:Airports in Chile

This category is for airports in Chile.

title: Category:Airports in Chile


text:
User:Rimenes~enwiki

Rimenes Ribeiro

title: User:Rimenes~enwiki


text:
Crimson-collared tanager

The crimson-collared tanager (Ramphocelus sanguinolentus) is a rather small Middle American songbird. It was first described by the French naturalist René-Primevère Lesson in 1831, its specific epithet from the Latin adjective sanguinolentus, "bloodied", referring to its red plumage.

Taxonomy
This species is sometimes placed in a genus of its own as Phlogothraupis sanguinolenta, and a genetic study suggests that it is less closely related to the other Ramphocelus tanagers than they are to each other. Its closest relative is the masked crimson tanager.

Description
Crimson-collared tanagers average 19 - 20 cm long. The adult plumage is black with a red collar covering the nape, neck, and breast (remarkably similar to the pattern of the male crimson-collared grosbeak). All tail coverts are also red. The bill is striking pale blue and the legs are blue-gray. In adults, the irides are crimson, contrary to what is shown in Howell and Webb. Females average slightly duller than males, but are sometimes indistinguishable from them. Juvenile birds are similar except that the hood is dull red, the black areas are tinged with brown, and the breast is mottled red and black. Young birds also have a duller bill color.

Vocalizations are high-pitched and sibilant. There are several calls; one rendered as ssii-p is given both when perched and in flight. The song is jerky and consists of two-to-four-note phrases separated by pauses, tueee-teew, chu-chee-wee-chu, teweee.

Distribution and habitat
The crimson-collared tanager ranges from southern Veracruz and northern Oaxaca in Mexico through the Atlantic slope of Central America, to the highlands of western Panama. It inhabits the edges of humid evergreen forests and second growth, where it is often seen in pairs at middle to upper levels.

Breeding
The nest is a cup built of such materials as moss, rootlets and strips of large leaves such as banana or Heliconia, and is placed at middle height in a tree at a forest edge. The female usually lays two eggs, pale blue with blackish spots.

Conservation
Because the species is not threatened, the population size is very large and the trend appears to be stable, the species is evaluated as Least Concern.

title: Crimson-collared tanager


text:
WQMP

WQMP (101.9 FM) is a radio station licensed to Daytona Beach serving the Orlando and Space Coast areas of Central Florida. Owned by Audacy, Inc., it broadcasts an alternative rock format branded as "FM 101.9". Its studios are located in Maitland and the transmitter is in Orange City. To the north, the station can be heard as far as St. Augustine, to the south, the station can be heard as far as Palm Bay and is one of the few Orlando stations that covers Ocala.

Early years
The 101.9 frequency began as WMFJ-FM on November 1, 1967. Sister to AM 1450 in Daytona Beach, WMFJ-FM was an automated beautiful music station known as Stereo 102. The station's calls were changed to WQXQ in 1973, and the format became automated Album Oriented Rock as Q102. Despite the rock format's success, management felt that a top 40 hit station would have more mass appeal, and so Q102 changed from rock to Top 40 in 1976; initially the station remained automated, but by the end of the 1970s it employed a staff of live and local announcers. The station changed its calls to WDOQ in 1980, but the format remained top 40, the moniker remained Q102, and the ratings remained high. Due to new competition in the Daytona market from WNFI in 1982, Q102 began to more aggressively target the Orlando market as opposed to only Daytona Beach. Although plans for a big 100,000-watt signal that would have extended to St. Augustine, Gainesville and Ocala were scrapped, WDOQ's listenership continued to grow.

In 1984, WDOQ was sold and adopted the new calls WCFI, with a satellite-fed adult contemporary format from Transtar (now Dial Global), using the I-4 (a tribute to Miami's WINZ-FM) and later Sunny 102 monikers. In 1985, the station was purchased by Duffy Broadcasting for $7.7 million. On June 16, 1986, the format and calls changed again to WORZ, Z-102FM, a classic rock station. In 1987, it was sold to Beasley-Reed Broadcasting for $9.2 million.

102 Jamz
On April 1, 1988, the call letters were changed to WJHM, and the station adopted a CHR/Urban format targeting a multicultural audience as 102 Jamz under the direction of Program Director Duff Lindsey and consultant Jerry Clifton. The station was an immediate success with listeners and within two years, ascended to the top of the 12+ Arbitron Ratings. Some of the DJs included Joe Nasty doing mornings, Magic Scott (now Cadillac Jack in Philadelphia) doing afternoons, and Cedric Hollywood as mid-day jock (also Music Director). WJHM was purchased by Chancellor Media in 1997. In late 1998, longtime music director Cedric Hollywood, who had been with the station since its inception in 1988, left "102 Jamz" to go to WEDR in Miami. Soon after, it started adding urban based songs to its playlist. Although the station was labeled as "Rhythmic", WJHM remained an Urban station at its core, but would later drop rhythmic-based songs when it got competition when WCFB acquired an urban AC format, resulting in WJHM shifting to urban altogether.

The late 1990s brought a time of mergers with Chancellor merging with Evergreen and forming AMFM, Inc., who hold ownership of WJHM until it merged with Clear Channel in 2000. To comply with FCC ownership rules, Clear Channel sold WJHM to Infinity Broadcasting (later CBS Radio) in 2001. It briefly reverted to rhythmic by 2005 to go up against WPYO, although this was unsuccessful due to WCFB (WPYO's sister station) having almost no competitor during the rhythmic experiment. WJHM shortly reverted to urban to challenge WCFB. Given WJHM's Urban heritage status in Orlando, it was in competition with both WCFB and WPYO (both owned by Cox Radio). Although it was one of the top ranking radio stations in the market, WJHM suffered the rare setback of ranking behind WPYO in the Arbitron ratings, rare to have an Urban format rank behind a Rhythmic.

In the fall of 2011, WJHM began adding Rhythmic product again. Despite its continued urban contemporary tenure per Nielsen BDS reports rather than being a rhythmic, it continued on Mediabase's rhythmic panel during this tenure. Since the shift back to Rhythmic, WJHM added more pop tracks, such as You Make Me Feel... by Cobra Starship & Moves Like Jagger by Maroon 5. This move was due to WJHM looking at challenging WXXL, the market's only Top 40/CHR and former sister station. However, Cox-owned WPYO, whose Rhythmic direction slightly favored hip hop but whose playlist was almost identical to WJHM, continued to surpass WJHM in the ratings. In late January 2012, WJHM made more changes by dropping Rickey Smiley's syndicated morning show in favor of a more music-intensive morning block, terminated 18-year air-staffer Jay Love from the roster, and began transitioning to a rhythmic top 40 direction altogether, as their playlist began including songs from artists like Jessie J, Avicii, Kelly Clarkson, fun., The Wanted, and Adele. It also dropped their longtime slogan "Non-Stop Hip-Hop and R&B", replacing it with "102 Minutes of Commercial-Free Music". The non-urban content that WJHM played also received airplay at both WXXL and adult top 40 WOMX, WJHM's sister station. By February 22, 2012, the station completed the shift to Rhythmic Top 40, joining the market's existing rhythmic WPYO as Nielsen BDS moved it to the Top 40/Rhythmic panel, citing a low emphasis on urban contemporary tracks and since making the transition adding more Pop tracks. Along with these changes, it dropped the Sunday morning gospel programming syndicated from WVEE, although WJHM's HD2 subchannel broadcasts a Gospel format full-time.

Between 2000 and early 2012, WJHM was one of CBS Radio's only young demographic-targeting Urban stations along with Atlanta's WVEE-FM and Charlotte's WPEG, although all of them are in the southern United States. Its sister station WPGC-FM in Washington, D.C.–Baltimore, Maryland was an urban contemporary reporter per Nielsen BDS and CBS Radio from 1997 to 2012, while they reported to the rhythmic contemporary panel at Mediabase, due to being a hybrid of both formats (also known as "Churban"), despite Radio One having WKYS and WERQ-FM directly competing in the area. WPGC returned to the BDS Rhythmic reporting panel in June 2012.

101-9 AMP Radio
On February 11, 2014, in the early morning hours, WJHM dropped the "Jamz" branding after 26 years and began stunting with a loop of the song "Get Lucky" by Daft Punk featuring Pharrell Williams and Nile Rodgers. At 10:19 that morning, WJHM rebranded as 101.9 AMP Radio and shifted to top 40/CHR altogether, putting it in line with CBS Radio's "AMP Radio" branding, which favors rhythmic pop and dance hits. The first song on "AMP Radio" was "Timber" by Pitbull featuring Kesha. Despite the rebranding, WJHM continued to lag in Arbitron ratings behind CHR competitor WXXL and then-rhythmic CHR station WPYO.

On January 20, 2016, WJHM changed its call letters to WQMP to match the "AMP Radio" branding.

On February 2, 2017, CBS Radio announced it would merge with Entercom. The merger was approved on November 9, 2017, and was consummated on November 17.

Alt 101.9/FM 101.9
On November 29, 2017, at 3 p.m., after playing “End Game” by Taylor Swift, WQMP flipped to alternative rock as Alt 101.9, joining several other former "AMP Radio"-branded stations in switching to the format and brand after the completion of the Entercom merger. The change brought the format back to a full-market signal in Orlando for the first time since 2008, when sister station WOCL flipped to classic hits, additionally it marked the return of any kind of rock format to the station for the first time since 1976 when the station (then known as “Q102” WQXQ) switched from album oriented rock to Top 40, while retaining the existing branding from the AOR format. The first song on Alt was "Smells Like Teen Spirit" by Nirvana. The most recent analog broadcast station to air the format full-time, Cox Media's W297BB/WCFB-HD2, was aired on a translator and an HD sub-channel, and aired from June 2014 to January 2016. Elsewhere in the Orlando market, iHeartMedia's talk-formatted WTKS-FM featured alternative on nights and weekends, and also aired on two HD subchannels in the Orlando market, WOCL-HD2 (until c. 2019) and WJRR-HD3 (until July 2024), the latter of which also used the brand Alt as standardized by iHeartMedia; this name conflict resulted in WQMP quietly changing its on-air brand to FM 101.9 on December 4 that year.

In September 2020, most of the local DJs and programming staff were laid off and replaced by out-of-market programming.

WQMP-HD2
WQMP activated its HD2 subchannel at the same time it started its HD radio operations at some point in the mid-2000s, which originally carried an urban gospel format, branded as "102 Gospel Jamz", from the 2000s until 2018. In August 2019, WQMP-HD2 was supposed to flip to "Channel Q", an LGBTQ-oriented talk/dance music format based in Los Angeles. Since the HD2 stream did not appear on the station, it was placed on the HD2 subchannel of sister station WOMX-FM in early November 2019. The HD2 stream then reappeared later in 2020 carrying an alternative format featuring new releases, known as "Orlando’s New Arrivals". On February 23, 2022, WQMP-HD2 flipped to Audacy's in-house BetQL Network.

WQMP-HD3
As of July 2019, WQMP-HD3 was carrying a Haitian format from an unknown source. The HD2 and HD3 subchannels were removed around early 2020. In late 2020, the HD3 subchannel reappeared and became the new home for "Channel Q" in Orlando after being dropped by WOMX-FM’s HD2 subchannel at some point in early-to-mid 2020. In January 2022, “Channel Q” returned to WOMX-HD2, which led to the HD3 subchannel becoming a secondary feed for Audacy’s New Arrivals. The HD3 subchannel was turned off until later in 2023, where the Haitian-language radio format returned on the HD3 sub channel after a 3-year hiatus. It was turned off again as of early 2024, until in May of that year, Central Florida Education Foundation, owner of WPOZ, a Christian contemporary radio station, moved its Gospel-formatted “G-Praise” from its HD3 subchannel to WQMP’s HD3 subchannel under a leasing agreement with Audacy, returning the format to an HD subchannel of the station for the first time in 6 years, since the HD2 subchannel of WQMP carried an urban gospel format known as “102 Gospel Jamz” from sometime in the early-mid 2000s until sometime in 2018 when it became defunct.

title: WQMP


text:
Automatic vectorization

Automatic vectorization, in parallel computing, is a special case of automatic parallelization, where a computer program is converted from a scalar implementation, which processes a single pair of operands at a time, to a vector implementation, which processes one operation on multiple pairs of operands at once. For example, modern conventional computers, including specialized supercomputers, typically have vector operations that simultaneously perform operations such as the following four additions (via SIMD or SPMD hardware):

 * $$\begin{align}

c_1 & = a_1 + b_1 \\ c_2 & = a_2 + b_2 \\ c_3 & = a_3 + b_3 \\ c_4 & = a_4 + b_4 \end{align}$$

However, in most programming languages one typically writes loops that sequentially perform additions of many numbers. Here is an example of such a loop, written in C:

A vectorizing compiler transforms such loops into sequences of vector operations. These vector operations perform additions on blocks of elements from the arrays,   and. Automatic vectorization is a major research topic in computer science.

Background
Early computers usually had one logic unit, which executed one instruction on one pair of operands at a time. Computer languages and programs therefore were designed to execute in sequence. Modern computers, though, can do many things at once. So, many optimizing compilers perform automatic vectorization, where parts of sequential programs are transformed into parallel operations.

Loop vectorization transforms procedural loops by assigning a processing unit to each pair of operands. Programs spend most of their time within such loops. Therefore, vectorization can significantly accelerate them, especially over large data sets. Loop vectorization is implemented in Intel's MMX, SSE, and AVX, in Power ISA's AltiVec, in ARM's NEON, SVE and SVE2, and in RISC-V's Vector Extension instruction sets.

Many constraints prevent or hinder vectorization. Sometimes vectorization can slow down execution, for example because of pipeline synchronization or data-movement timing. Loop dependence analysis identifies loops that can be vectorized, relying on the data dependence of the instructions inside loops.

Guarantees
Automatic vectorization, like any loop optimization or other compile-time optimization, must exactly preserve program behavior.

Data dependencies
All dependencies must be respected during execution to prevent incorrect results.

In general, loop invariant dependencies and lexically forward dependencies can be easily vectorized, and lexically backward dependencies can be transformed into lexically forward dependencies. However, these transformations must be done safely, in order to ensure that the dependence between all statements remain true to the original.

Cyclic dependencies must be processed independently of the vectorized instructions.

Data precision
Integer precision (bit-size) must be kept during vector instruction execution. The correct vector instruction must be chosen based on the size and behavior of the internal integers. Also, with mixed integer types, extra care must be taken to promote/demote them correctly without losing precision. Special care must be taken with sign extension (because multiple integers are packed inside the same register) and during shift operations, or operations with carry bits that would otherwise be taken into account.

Floating-point precision must be kept as well, unless IEEE-754 compliance is turned off, in which case operations will be faster but the results may vary slightly. Big variations, even ignoring IEEE-754 usually signify programmer error.

Theory
To vectorize a program, the compiler's optimizer must first understand the dependencies between statements and re-align them, if necessary. Once the dependencies are mapped, the optimizer must properly arrange the implementing instructions changing appropriate candidates to vector instructions, which operate on multiple data items.

Building the dependency graph
The first step is to build the dependency graph, identifying which statements depend on which other statements. This involves examining each statement and identifying every data item that the statement accesses, mapping array access modifiers to functions and checking every access' dependency to all others in all statements. Alias analysis can be used to certify that the different variables access (or intersect) the same region in memory.

The dependency graph contains all local dependencies with distance not greater than the vector size. So, if the vector register is 128 bits, and the array type is 32 bits, the vector size is 128/32 = 4. All other non-cyclic dependencies should not invalidate vectorization, since there won't be any concurrent access in the same vector instruction.

Suppose the vector size is the same as 4 ints:

Clustering
Using the graph, the optimizer can then cluster the strongly connected components (SCC) and separate vectorizable statements from the rest.

For example, consider a program fragment containing three statement groups inside a loop: (SCC1+SCC2), SCC3 and SCC4, in that order, in which only the second group (SCC3) can be vectorized. The final program will then contain three loops, one for each group, with only the middle one vectorized. The optimizer cannot join the first with the last without violating statement execution order, which would invalidate the necessary guarantees.

Detecting idioms
Some non-obvious dependencies can be further optimized based on specific idioms.

For instance, the following self-data-dependencies can be vectorized because the value of the right-hand values (RHS) are fetched and then stored on the left-hand value, so there is no way the data will change within the assignment.

Self-dependence by scalars can be vectorized by variable elimination.

General framework
The general framework for loop vectorization is split into four stages:
 * Prelude: Where the loop-independent variables are prepared to be used inside the loop. This normally involves moving them to vector registers with specific patterns that will be used in vector instructions. This is also the place to insert the run-time dependence check. If the check decides vectorization is not possible, branch to Cleanup.
 * Loop(s): All vectorized (or not) loops, separated by SCCs clusters in order of appearance in the original code.
 * Postlude: Return all loop-independent variables, inductions and reductions.
 * Cleanup: Implement plain (non-vectorized) loops for iterations at the end of a loop that are not a multiple of the vector size or for when run-time checks prohibit vector processing.

Run-time vs. compile-time
Some vectorizations cannot be fully checked at compile time. For example, library functions can defeat optimization if the data they process is supplied by the caller. Even in these cases, run-time optimization can still vectorize loops on-the-fly.

This run-time check is made in the prelude stage and directs the flow to vectorized instructions if possible, otherwise reverts to standard processing, depending on the variables that are being passed on the registers or scalar variables.

The following code can easily be vectorized at compile time, as it doesn't have any dependence on external parameters. Also, the language guarantees that neither will occupy the same region in memory as any other variable, as they are local variables and live only in the execution stack.

On the other hand, the code below has no information on memory positions, because the references are pointers and the memory they point to may overlap.

A quick run-time check on the address of both a and b, plus the loop iteration space (128) is enough to tell if the arrays overlap or not, thus revealing any dependencies.

There exist some tools to dynamically analyze existing applications to assess the inherent latent potential for SIMD parallelism, exploitable through further compiler advances and/or via manual code changes.

Techniques
An example would be a program to multiply two vectors of numeric data. A scalar approach would be something like:

This could be vectorized to look something like:

Here, c[i:i+3] represents the four array elements from c[i] to c[i+3] and the vector processor can perform four operations for a single vector instruction. Since the four vector operations complete in roughly the same time as one scalar instruction, the vector approach can run up to four times faster than the original code.

There are two distinct compiler approaches: one based on the conventional vectorization technique and the other based on loop unrolling.

Loop-level automatic vectorization
This technique, used for conventional vector machines, tries to find and exploit SIMD parallelism at the loop level. It consists of two major steps as follows.

 * 1) Find an innermost loop that can be vectorized
 * 2) Transform the loop and generate vector codes

In the first step, the compiler looks for obstacles that can prevent vectorization. A major obstacle for vectorization is true data dependency shorter than the vector length. Other obstacles include function calls and short iteration counts.

Once the loop is determined to be vectorizable, the loop is stripmined by the vector length and each scalar instruction within the loop body is replaced with the corresponding vector instruction. Below, the component transformations for this step are shown using the above example.
 * After stripmining

 * After loop distribution using temporary arrays

 * After replacing with vector codes

Basic block level automatic vectorization
This relatively new technique specifically targets modern SIMD architectures with short vector lengths. Although loops can be unrolled to increase the amount of SIMD parallelism in basic blocks, this technique exploits SIMD parallelism within basic blocks rather than loops. The two major steps are as follows.

 * 1) The innermost loop is unrolled by a factor of the vector length to form a large loop body.
 * 2) Isomorphic scalar instructions (that perform the same operation) are packed into a vector instruction if dependencies do not prevent doing so.

To show step-by-step transformations for this approach, the same example is used again.
 * After loop unrolling (by the vector length, assumed to be 4 in this case)

 * After packing

 * After code generation

Here, sA1, sB1, ... represent scalar variables and vA, vB, and vC represent vector variables.

Most automatically vectorizing commercial compilers use the conventional loop-level approach except the IBM XL Compiler, which uses both.

In the presence of control flow
The presence of if-statements in the loop body requires the execution of instructions in all control paths to merge the multiple values of a variable. One general approach is to go through a sequence of code transformations: predication → vectorization(using one of the above methods) → remove vector predicates → remove scalar predicates. If the following code is used as an example to show these transformations;

 * After predication

where (P) denotes a predicate guarding the statement.
 * After vectorization

 * After removing vector predicates

 * After removing scalar predicates

Reducing vectorization overhead in the presence of control flow
Having to execute the instructions in all control paths in vector code has been one of the major factors that slow down the vector code with respect to the scalar baseline. The more complex the control flow becomes and the more instructions are bypassed in the scalar code, the larger the vectorization overhead becomes. To reduce this vectorization overhead, vector branches can be inserted to bypass vector instructions similar to the way scalar branches bypass scalar instructions. Below, AltiVec predicates are used to show how this can be achieved.
 * Scalar baseline (original code)

 * After vectorization in the presence of control flow

 * After inserting vector branches

There are two things to note in the final code with vector branches; First, the predicate defining instruction for vPA is also included within the body of the outer vector branch by using vec_any_gt. Second, the profitability of the inner vector branch for vPB depends on the conditional probability of vPB having false values in all fields given vPA has false values in all fields.

Consider an example where the outer branch in the scalar baseline is always taken, bypassing most instructions in the loop body. The intermediate case above, without vector branches, executes all vector instructions. The final code, with vector branches, executes both the comparison and the branch in vector mode, potentially gaining performance over the scalar baseline.

Manual vectorization
In most C and C++ compilers, it is possible to use intrinsic functions to manually vectorise, at the expense of programmer effort and maintainability.

title: Automatic vectorization


text: Category:Chicago Transit Authority

title: Category:Chicago Transit Authority


text:
USS Bristol (DD-857)

USS Bristol (DD-857), an Allen M. Sumner-class destroyer, was the second ship of the United States Navy to be named for Rear Admiral Mark Lambert Bristol, who served as Commander-in-Chief North Atlantic Fleet from 1901 to 1903.

Construction and career
The second Bristol was launched on 29 October 1944 by Bethlehem Shipbuilding, San Pedro, California, sponsored by Mrs. August Frederick Eberly; and commissioned on 17 March 1945.

Service in the United States Navy
Bristol departed San Diego on 13 June 1945, en route to Pearl Harbor, arriving on 19 June 1945. Arriving at Guam on 29 July she joined Task Group 30.8, a logistic support group supplying Task Force 38. On 5 August 1945, Bristol collided with USS Ashtabula (AO-51). Bristol's bow was damaged and she returned to Guam for repairs. Repairs were completed on 1 September, afterwards she departed for Far Eastern occupation duty. Her tour of duty ended on 21 February 1946, and she returned to San Pedro on 15 March.

In April 1946, Bristol proceeded to the east coast and reported to the Atlantic Fleet. She operated along the east coast until February 1947, when she steamed to England for a cruise in European waters that lasted until August. Between August 1947 and September 1948, she conducted local operations in the Atlantic and, from September 1948 until January 1949, made a second tour of Europe.

Upon return, she was designated as a Reserve training ship and operated for the next 18 months out of New Orleans, Louisiana. During the summer and fall of 1950, Bristol visited several Caribbean ports, with interim periods of training at Guantanamo Bay, Cuba.

Bristol's homeport was changed to Newport, Rhode Island on 21 October 1950, and, after refresher training at Guantanamo Bay, she reported to Newport for general duty. On 5 March 1951, Bristol proceeded to the Mediterranean for duty with the 6th Fleet, returning to Newport during the summer.

On 2 October 1951, she commenced a round-the-world cruise which took her first to Korea where she served from 31 October 1951 to 27 February 1952. She then returned to Newport via the Suez Canal and the Mediterranean, arriving 21 April 1952.

On 21 November 1969, the ship was decommissioned and stricken. She was later loaned to Republic of China on 9 December 1969.

Service in the Republic of China Navy
She was commissioned by the Navy on 9 December 1969 and renamed ROCS Hua Yang (DD-3).

The ship was later modified with a triple Hsiung Feng I launcher and associated RTN 10X radar to become a missile destroyer; on New Year's Day in 1976, the hull number was changed to DD-988.

On 1 October 1979, the hull number was changed to DDG-903.

On 7 February 1991, Hua Yang, another Sumner-class destroyer, and 8 missile boats took part in a naval exercise off of Kaohsiung. The unit conducted joint sea-air anti-submarine, joint sea-land air defense, anti-missile boat, and underway replenishment exercises.

She was decommissioned on 25 April 1994 and sold for scrap.

Awards
Bristol received one battle star for her World War II service and two battle stars for her Korean service.

title: USS Bristol (DD-857)


text:
Pavel Kuznetsov

Pavel Varfolomevich Kuznetsov (1878–1968) was a painter and graphic artist.

Life and career
He studied at Saratov at Bogolyubov Art School (1891–1896), then Moscow School of Painting, Sculpture and Architecture (1897–1904) and for a year in Paris (1905). His early paintings were exhibited by the Mir Iskusstva group, and he was closely associated with the Russian Symbolists. He helped to organize the Crimson Rose exhibition (1904) and was a founder and leader of the Blue Rose in 1907. He taught at the Stroganov Institute (1917–18; 1945-8) and at the Moscow Institute of Fine Arts (1918–37). He headed the painting section of Narkompros until 1921, but fell out of official favour with the advent of Socialist Realism. He was one of the members of the art association ‘The Four Arts’, which existed in Moscow and Leningrad in 1924-1931.

Kuznetsov's early paintings are typical of the Blue Rose group's poetic explorations of an interior, imaginative world through archetypal symbols. After 1910 he drew increasingly on folk culture, continuing to draw on the rich colours and harmonious rhythms of the Symbolists but simplifying his compositions to depict the everyday life of village communities of Kirghizstan in Central Asia.

title: Pavel Kuznetsov


text:
Talk:Broca's area

Request to restore link to Wernicke’s Area — Preceding unsigned comment added by 71.210.154.76 (talk) 15:05, 22 February 2023 (UTC)

Generative Grammar
So, I don't edit often, but I thought this didn't belong here:

"Moreover, Broca's area has revealed to be sensitive to the distinction between "possible" vs. "impossible" languages as determined by principles of generative grammar as in the works coordinated by Andrea Moro "

It was (previously) the last sentence of the first paragraph under #Language Comprehension. The problem isn't the statement, but the source. The source is an entire book, no page numbers or even chapters listed. Just the whole effin thing. From what I know, that's not how sources work. The reason I looked at the source was because of the matter-of-factness of the statement. Generative Grammar is a topic that is controversial in Cognitive Science and Neruopsychology right now, something which has not been proven nor disproven. If there was going to be a statement about it, I would expect it to have far more nuance (hence my source check), but this makes it seem like something that has all been well-proven, due to the implication the sentence gives and it's location in the paragraph (the paragraph being a list of, for the most part, facts). My feeling is that this was thrown in there (it is a bit of a non-sequitur when you step back from the rest of it, and it's only a single sentence) to promote the author and his book (funny how the sentence lists the author in the article, instead of just the source, unlike any of the other sources, no?). If it's for some reason not that, then it could be someone from specific universities or research institutes that support the idea of Universal/Generative Grammar and are trying to bias the opinion of the reader that it is a foregone conclusion instead of something that's the subject of very active research (yes, there are actually people who cheer-lead over this shit, perhaps due in part to the relative fame of Noam Chomsky). Seeming quite out of place, I took it out of the article and put it in hear for the rest of you all to decide.

Is
Is this the same thing as the motor speech area? If so, we should probably include it, simply because eponyms are no longer in vogue. --Mauvila 11:47, 15 May 2006 (UTC)

I'm not familiar with that term, but some quick googling implies they might be the same. On the other hand, 'motor speech area' is a misleading term, because Broca's area doesn't have much to do with motor control. Masily box 14:50, 26 June 2006 (UTC)

"Yes... ah... Monday... er... Dad and Peter H... (his own name), and Dad.... er... hospital... and ah... Wednesday... Wednesday, nine o'clock... and oh... Thursday... ten o'clock, ah doctors... two... an' doctors... and er... teeth... yah."

Peter has some type of an appointment with a dentist and someone has to go to a doctor or came from or is involved with.. yep :) --Cyberman 20:59, 5 October 2005 (UTC) Scientists say Broca's Area when damaged is serve to the way we talk. Broca disected 8 brains in total of people (already dead) who couldn't speak. He found that their brains were all damaged servely in the same area. Therefore this is why we call that area today Broca's area

Too many run on sentences, when your introducing a new cocept it doesnt help if you can't remember what the beginning of the sentence was talking about.-Rooktje

This is coming long after intial dialogue...but here goes. Broca's is part of what one MIGHT refer to as a "motor speech area". The fact is that Broca's area is not a rigid area in every brain, but it is located mainly in what is called the motor association cortex of the brain. This area is sort of like the "mixer" that turns the butter an sugar into cookie dough for lack of a better metaphor. It is thought that the association areas of the brain are where memories for different things are stored. Wernicke orignially posited that Broca's area governed "motor memories" and this seems to be the case. Damage to Broca's shows the following symptoms in varying intensities and combinations:Non-fluent speech, slow,halting speech, loss of ability to "find" certain words, difficulty pronouncing words and loss of prosody (agrammatism, anomia, articulation difficulty). Athough the right hemisphere is ultimately responsible for prosody, for some reason Broca's (on the left) seems to be connected as well. True apraxia would be damage to the ventral primary motor cortex. Broca's aphasia is not a dysfuntcion of the actual motor connections as they pertain to the mechanical operation of the lips, tongue, etc; but to part of the motor association cortex that stores motor memories and allows their retrieval. It is in an area that works to integrate all the different aspects of the brain's motor systems.Cherokeechild 00:03, 14 May 2007 (UTC)cherokeechild

Sorry for the addition, but I think there may be a mistake in the last paragraph. As I recall, functional studies by Brown (2005) found that people who stutter have GREATER/increased activation of neuronal pathways in Broca's area...not less. You might check data as reported by Neil Carlson, Physiology of Behavior (2007), I think.Cherokeechild 00:16, 14 May 2007 (UTC)cherokeechild

""Yes... ah... Monday... er... Dad and Peter H... ......." My Psych textbook quotes this differently. Basically, alot of the er's and ah's are gone... and he says 'Dad and Dick'... 203.55.195.106 06:51, 10 June 2007 (UTC)

Broca's is not simply an organ for syntax
Have removed the universal grammar section. Very few people (maybe Grodzinsky, but I can't think of any others of note) now believe that this area is dedicated to parsing syntax, which is what this section would lead you to conclude. This part of the IFG participates in hundreds of cognitive functions, not all of them language related. As far as language itself is concerned, fMRI investigations have shown an involvement in semantic processing, even at the single word level - i.e. in the absence of any syntactic processing demand. Crudely put, current opinion seems to be that the anterior part (BA45) is involved in (probably multimodal) semantic processing, wheras the posterior part (BA44) appears to play a role in phonological processing. Even more crudely put, the front bit of Broca's probably helps us deal with the meaning of language, the back bit helps us deal with the sounds of language Terry Toweling 22:18, 14 August 2007 (UTC)

Broca's area is equivalent to Motor Speech center.. should add the link. -- econner 29 November 2007

I don't believe you can pinpoint Broca's area to any particular language feature. Yes, it is primarily motor speech - but, it probably is involved in other functions at a level we don't completely understand. --Anthropos65 (talk) 15:21, 4 January 2008 (UTC)
 * It's not "equivalent to Motor Speech center." Actually, most of the recent work is leaning towards calling BA44 and BA45 a working memory area, and the anterior temporal lobe (ATL) the real locus of most syntactic operations; you just see activation in Broca's area as well because the complex syntactic operations (gap-filling, etc.) require you to keep a moved constituent active in your working memory for a while.  To tell you the truth, I'm a bit surprised that there's no mention of working memory in this article, and maybe I will try to add some later (Dronkers et al 2000 and Friederici 2002 have some good stuff on that; sorry, don't have the full citation handy).
 * Also, remember to take this all with a grain of salt; Broca's Area is not just one homogenous blob, but is a region which has plenty of heterogeneity in it and has different parts that do different things. I will be more familiar with the literature on that within about a month or so. Polit i zer talk / contribs 19:32, 3 February 2009 (UTC)

It could have been present already in the common ancestor of humans and chimps
Quoting from Science Daily:
 * In the new study, the researchers non-invasively scanned the brains of three chimpanzees as they gestured and called to a person in request for food that was out of their reach. Those chimps showed activation in the brain region corresponding to Broca's area and in other areas involved in complex motor planning and action in humans, the researchers found. - Science Daily, February 28, "Chimps May Have A 'Language-ready' Brain"

--Extremophile (talk) 13:57, 29 February 2008 (UTC)

Article
Might be useful, might not be: Polit i zer talk / contribs 19:32, 3 February 2009 (UTC)

Areas for improvement
I've decided to grace this article with my presence sometime in the near future. In the meantime, for anyone reading along, here are some of the main issues that I think need to addressed (these are things that I will be addressing in my edits to come, but I'm listing them here just in case anyone wants to get started early, or in case anyone disagrees). Polit i zer talk / contribs 19:07, 5 February 2009 (UTC)
 * The section Case study is totally unjustified, it gives undue weight to a single study. Will get rid of it and integrate that reference into other areas.
 * Aphasia section needs rewritten; current version focuses mostly on comparison with other aphasias, which belongs (and is already present in) the main Aphasia article. Section should say more about Broca's aphasia and doesn't need the table (which is simply copied from here anyway).
 * Broca's area revisited is also just about one study (Dronkers et al, 2007) and should be rewritten as a summary of relevant literature, not just the one study. Another relevant paper is
 * Stuff I mentioned above about how there needs to be more coverage of the literature that suggests Broca's area is a workspace of working memory, rather than a syntax-specific or even language-specific area. Relevant papers include:
 * And, of course, for a counterpoint: (and some earlier papers cited in this one)
 * And, of course, for a counterpoint: (and some earlier papers cited in this one)
 * And, of course, for a counterpoint: (and some earlier papers cited in this one)

 * I'll admit I'm guilty of not reading this talk page before making some of my edits. I have to agree with a lot of what this editor says, although the presence of information on aphasia (especially Broca's aphasia) is not contraindicated on this page just because this information appears elsewhere in the encyclopedia.  I do agree that refining the section to more specifically elucidate the nature of Broca's aphasia is probably warranted, but I do not think it is possible to do so without mentioning and comparing the other forms of aphasia to Broca's aphasia.  As an aside, the section on the origin of language probably should be truncated; I made a number of additions to this area which were (in my mind justifiably) removed, and a link to the main article on the origins of language along with a very short stub describing, briefly, the relevence of Broca's area to the discussion would suffice in my opinion.  Spiral5800 (talk) 06:20, 17 January 2011 (UTC)!

nu mata sa wayay???????? — Preceding unsigned comment added by 182.180.67.57 (talk) 07:34, 29 April 2014 (UTC)

Edit reverted
I have undone this addition for the following reasons: Also, for what it's worth, the link provided was dead. r ʨ anaɢ (talk) 02:48, 26 October 2014 (UTC)
 * It's not clear what it means. "This area is also crucially involved in the recognition of recursive rules, the only one admitted in human languages"---what does "the only one" refer to? And what is the nature of the region's involvement?
 * Citing a full book without giving page or chapter numbers is not really helpful, as it would be difficult to find the relevant passage to verify this.
 * If this is a claim based on one experiment, then it doesn't belong in the article anyway; for a topic like this, we really should be limiting ourselves to sources more like review articles, where the claims are widely replicated and are agreed upon. Mentioning every neuroscience result that implicates Broca's area (or any region) in anything would quickly get beyond the scope of the article.

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Broca's area. 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/20110122211354/http://aphasia.org/Aphasia%20Facts/aphasia_facts.html to http://www.aphasia.org/Aphasia%20Facts/aphasia_facts.html

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

Cheers.— InternetArchiveBot  (Report bug) 08:03, 26 July 2017 (UTC)

Broca's Aphasia Caused By Vitamin B12 Aphasia?
From May 2010 until November 2018 I've been experiencing increasingly frequent and increasingly severe Neurological symptoms: Brain Seizures, Dissociative Fugues - more commonly known as Fugue States - Broca's Aphasia in both my speech and my writing, and just in my last episode, really loud Tinnitus - ringing in my ears - severe dizziness leading to severe nausea, and numbness in my feet and lips. Four CT Scans, an MRI and a bunch of physical stroke exams which test for asymmetries in one's movements or physical strength make abundantly clear that I've never had brain cancer, a stroke, hemorrhage nor blood clot.

All my doctors other than just last week my new Neurologist have been totally stymied.

This is so far speculation on the parts of myself and my Neurologist. She suggested I have B12 Anemia due to my last ER visit having complained of numbness in the soles of both my feet as well as both my lips. Such Anemia is known to cause numbness in one's feet and hands.

If this turns out to be the case for me, in my case that's likely to be Pernicious Anemia, as my Great-Grandfather - my mother's father's father - died of it before the discovery of Liver Therapy. It's three inventors shared the 1934 Medicine Nobel. Further research found that the essential component of liver was at first red blood cells, then the Methylcobalamin form of Vitamin B12, and at some point the ultimate cause of PA was found to be a deficiency of a stomach enzyme called "Intrinsic Factor". If there's not enough IF in the stomach, the small intestine won't be able to absorb Methylcobalamin. The best treatment is now Vitamin B12 injections, daily at first, then once per week then once per month for the rest of one's life. I'm told that just some but not all of those with PA respond to 3,000 ug doses of oral Methylcobalamin tablets. Note that the US Recommanded Daily Allowance is just 2.4 ug.

So far I've had just a blood test for Methylmalonic Acid, which will be high if B12 is low. My own interpretation is that this test was inconclusive - I still await my Neurologist's interpretation - but there are six or eight other tests, the most-definitive being a bone marrow biopsy which would reveal any inability of the marrow to produce red blood cells.

172.58.40.170 (talk) 22:05, 12 December 2018 (UTC) User_Talk:MichaelCrawford

What do Mirror Neurons have to do with Broca's Area?
I don't understand why there is a section on Mirror Neurons in this article. Nothing in that section says anything about Broca's area. Also, it seems especially inappropriate given that its under the main section titled "Functions" which is supposed to be about the functions of Broca's area. I'll concede that given our very tentative understanding of the brain and language you could make a case that Mirror Neurons are important to language and hence Broca's area but no more or less than many other concepts (e.g, the theory from Lakoff and others that somatosensory processing is essential to language, or the recent work that Chomsky talks about in his book with Berwick where he identifies pathways that are hypothesized to support recursion). Can someone justify why we need to mention Mirror Neurons in this article and if so edit that section so the relevance is clear? If not I think that section should be deleted and will do so after a while if no one comes up with a justification. --MadScientistX11 (talk) 22:24, 8 April 2019 (UTC)
 * I'm removing the Mirror Neuron section. For one thing, that section was speculation anyway. There is no strong evidence that mirror neurons play a significant role in human language. But more importantly that section said nothing about Broca's area which is what this article is about. Here is the text that I removed:

Mirror neurons
Communication, both verbal and nonverbal, requires that the interacting individuals stay "tuned" to one another. Mirror neurons were discovered in the 1990s in frontal area F5 of the monkey cortex. These neurons are active during execution of object-related hand actions, but they are also active, importantly, when the monkey is just observing similar acts. For example, the mirror neurons are activated when the monkey takes a raisin from a tray and also when he views another monkey or the human experimenter doing the same. No information is yet available about possible hemispheric lateralization of the monkey mirror neurons.

Mirror neurons have visuomotor properties, being sensitive to goal-related motor acts, but they can also be activated by sounds that imply actions. Importantly, the mirror neurons do not only react to visual input and then project, via some transformational step, to motor-output-related neurons but are also part of a system that forms a neuronal representation of the observed motor acts. Similar to F5, the rostral part of the inferior parietal cortex contains neurons that are active during action observation and execution; this region receives input from the STS, which is known to contain neurons responding to biological motion. --MadScientistX11 (talk) 14:45, 10 April 2019 (UTC)

title: Talk:Broca's area


text:
Wikipedia:Cleanup Taskforce/Rescuing Prometheus

Rescuing Prometheus
This article is about a book by a Thomas P. Hughes and has been tagged for cleanup for nearly a year. Why is this book notable? If the article can't be improved, maybe it should be deleted?

 * Assigned to User:Ilyanep/Desk. Please accept or reassign to me. Stewart Adcock 21:00, 5 October 2005 (UTC)

 *  Reassigned to User:Stewartadcock/Desk because I don't know what to do here. This may have to be deleted — Ilγαηερ   (Tαlκ)  23:17, 5 October 2005 (UTC)

Reassigned to User:RJFJR/Desk RJFJR 19:08, 12 February 2006 (UTC)

 * I'm not sure there is much to add, but my library is seeking a copy of the book for me through Inter-Library Loan. RJFJR 15:18, 15 February 2006 (UTC)

 * I read the book. Not much to add. RJFJR 01:35, 5 July 2006 (UTC)

Closing. RJFJR 01:35, 5 July 2006 (UTC)


text:
Generalized geography

In computational complexity theory, generalized geography is a well-known PSPACE-complete problem.

Introduction
Geography is a children's game, where players take turns naming cities from anywhere in the world. Each city chosen must begin with the same letter that ended the previous city name. Repetition is not allowed. The game begins with an arbitrary starting city and ends when a player loses because he or she is unable to continue.

Graph model
To visualize the game, a directed graph can be constructed whose nodes are each cities of the world. An arrow is added from node N1 to node N2 if and only if the city labeling N2 starts with the letter that ending the name of the city labeling node N1. In other words, we draw an arrow from one city to another if the first can lead to the second according to the game rules. Each alternate edge in the directed graph corresponds to each player (for a two player game). The first player unable to extend the path loses. An illustration of the game (containing some cities in Michigan) is shown in the figure below.

 * [[Image:Generalized geography 1.svg]]

In a generalized geography (GG) game, we replace the graph of city names with an arbitrary directed graph. The following graph is an example of a generalized geography game.

 * [[Image:Generalized geography 2.png]]

Playing the game
We define P1 as the player moving first and P2 as the player moving second and name the nodes N1 to Nn. In the above figure, P1 has a winning strategy as follows: N1 points only to nodes N2 and N3. Thus P1's first move must be one of these two choices. P1 chooses N2 (if P1 chooses N3, then P2 will choose N9 as that is the only option and P1 will lose). Next P2 chooses N4 because it is the only remaining choice. P1 now chooses N5 and P2 subsequently chooses N3 or N7. Regardless of P2 ' s choice, P1 chooses N9 and P2 has no remaining choices and loses the game.

Computational complexity
The problem of determining which player has a winning strategy in a generalized geography game is PSPACE-complete.

Generalized geography is in PSPACE
Let GG = { ⟨G, b⟩ | P1 has a winning strategy for the generalized geography game played on graph G starting at node b }; to show that GG ∈ PSPACE, we present a polynomial-space recursive algorithm determining which player has a winning strategy. Given an instance of GG, ⟨G, nstart⟩ where G is a directed graph and nstart is the designated start node, the algorithm M proceeds as follows:

On M(⟨G, nstart⟩):
 * 1) Measure the out-degree of node nstart. If this degree is 0, then return reject, because there are no moves available for player one.
 * 2) Construct a list of all nodes reachable from nstart by one edge: n1, n2, ..., ni.
 * 3) Remove nstart and all edges connected to it from G to form G1.
 * 4) For each node nj in the list n1, ..., ni, call M(⟨G1, nj⟩).
 * 5) If all of these calls return accept, then no matter which decision P1 makes, P2 has a strategy to win, so return reject. Otherwise (if one of the calls returns reject) P1 has a choice that will deny any successful strategies for P2, so return accept.

The algorithm M clearly decides GG. It is in PSPACE because the only non-obvious polynomial workspace consumed is in the recursion stack. The space consumed by the recursion stack is polynomial because each level of recursion adds a single node to the stack, and there are at most n levels, where n is the number of nodes in G. This is essentially equivalent to a depth-first search.

Generalized geography is PSPACE-hard
The following proof is due to David Lichtenstein and Michael Sipser.

To establish the PSPACE-hardness of GG, we can reduce the FORMULA-GAME problem (which is known to be PSPACE-hard) to GG in polynomial time (P). In brief, an instance of the FORMULA-GAME problem consists of a quantified Boolean formula φ = ∃x1 ∀x2 ∃x3 ...Qxk(ψ) where Q is either ∃ or ∀. The game is played by two players, Pa and Pe, who alternate choosing values for successive xi. Pe wins the game if the formula ψ ends up true, and Pa wins if ψ ends up false. The formula ψ is assumed to be in conjunctive normal form.

In this proof, we assume that the quantifier list starts and ends with the existential qualifier, ∃, for simplicity. Note that any expression can be converted to this form by adding dummy variables that do not appear in ψ.

 * [[Image:Generalized geography 3.png]]

By constructing a graph G like the one shown above, we will show any instance of FORMULA-GAME can be reduced to an instance of Generalized Geography, where the optimal strategy for P1 is equivalent to that of Pe, and the optimal strategy for P2 is equivalent to that of Pa.

The left vertical chain of nodes is designed to mimic the procedure of choosing values for variables in FORMULA-GAME. Each diamond structure corresponds to a quantified variable. Players take turns deciding paths at each branching node. Because we assumed the first quantifier would be existential, P1 goes first, selecting the left node if x1 is true and the right node if x1 is false. Each player must then take forced turns, and then P2 chooses a value for x2. These alternating assignments continue down the left side. After both players pass through all the diamonds, it is again P1 's turn, because we assumed that the last quantifier is existential. P1 has no choice but to follow the path to the right side of the graph. Then it is P2 's turn to make a move.

When the play gets to the right side of the graph, it is similar to the end of play in the formula game. Recall that in the formula game, Pe wins if ψ is true, while Pa wins if ψ is false. The right side of the graph guarantees that P1 wins if and only if Pe wins, and that P2 wins if and only if Pa wins.

First we show that P2 always wins when Pa wins. If Pa wins, ψ is false. If ψ is false, there exists an unsatisfying clause. P2 will choose an unsatisfying clause to win. Then when it is P1's turn he must choose a literal in that clause chosen by P2. Since all the literals in the clause are false, they do not connect to previously visited nodes in the left vertical chain. This allows P2 to follow the connection to the corresponding node in a diamond of the left chain and select it. However, P1 is now unable to select any adjacent nodes and loses.

Now we show that P1 always wins when Pe wins. If Pe wins, ψ is true. If ψ is true, every clause in the right side of the graph contains a true literal. P2 can choose any clause. Then P1 chooses the literal that is true. And because it is true, its adjacent node in the left vertical node has already been selected, so P2 has no moves to make and loses.

Planar generalized geography is PSPACE-complete
Generalized geography is PSPACE-complete, even when played on planar graphs. The following proof is from theorem 3 of.

Since planar GG is a special case of GG, and GG is in PSPACE, so planar GG is in PSPACE. It remains to show that planar GG is PSPACE-hard. This can be proved by showing how to convert an arbitrary graph into a planar graph, such that a game of GG played on this graph will have the same outcome as on the original graph.

In order to do that, it's only necessary to eliminate all the edge crossings of the original graph. We draw the graph such that no three edges intersect at a point, and no pair of crossing edges can both be used in the same game. This is not possible in general, but is always possible for the graph constructed from a FORMULA-GAME instance; for example we could have only the edges from clause vertices involved in crossings. Now we replace each crossing with this construction:

The result is a planar graph, and the same player can force a win as in the original graph: if a player chooses to move "up" from V in the transformed game, then both players must continuing moving "up" to W or lose immediately. So moving "up" from V in the transformed game simulates the move V→W in the original game. If V→W is a winning move, then moving "up" from V in the transformed game is also a winning move, and vice versa.

Thus, the game of GG played on the transformed graph will have the same outcome as on the original graph. This transformation takes time that is a constant multiple to the number of edge intersections in the original graph, thus it takes polynomial time.

Thus planar GG is PSPACE-complete.

Planar bipartite graph with maximum degree 3
GG played on planar bipartite graphs with maximum degree 3 is still PSPACE-complete, by replacing the vertices of degree higher than 3 with a chain of vertices with degree at most 3. Proof is in. and uses the following construction:

If one player uses any of the entrances to this construction, the other player chooses which exit will be used. Also the construction can only be traversed once, because the central vertex is always visited. Hence this construction is equivalent to the original vertex.

Edge geography
A variant of GG is called edge geography, where after each move, the edge that the player went through is erased. This is in contrast to the original GG, where after each move, the vertex that the player used to be on is erased. In this view, the original GG can be called Vertex Geography.

Edge geography is PSPACE-complete. This can be proved used the same construction that was used for vertex geography.

Undirected geography
One may also consider playing either Geography game on an undirected graph (that is, the edges can be traversed in both directions). Fraenkel, Scheinerman, and Ullman show that undirected vertex geography can be solved in polynomial time, whereas undirected edge geography is PSPACE-complete, even for planar graphs with maximum degree 3. If the graph is bipartite, then Undirected Edge Geography is solvable in polynomial time.

Consequences
Given that GG is PSPACE-complete, no polynomial time algorithm exists for optimal play in GG unless P = PSPACE. However, it may not be as easy to prove the complexity of other games because certain games (such as chess) contain a finite number of game positions — making it hard (or impossible) to formulate a mapping to a PSPACE-complete problem. In spite of this, the complexity of certain games can still be analyzed by generalization (e.g., to an n × n board). See the references for a proof for generalized Go, as a corollary of the proof of the completeness of GG.

title: Generalized geography


text:
Talk:Jeffrey Daniels (author)

Untitled
According to Amazon, Black Girls & Bicycles is not out yet. It is dated for 2006. What is the name of his first book (before God Noise)?

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Jeffrey Daniels (author). 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/20120922063601/http://www.colum.edu/Admissions/Programs/Poetry.php to http://www.colum.edu/Admissions/Programs/Poetry.php

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

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

title: Talk:Jeffrey Daniels (author)


text:
Talk:Aqualung (musician)

Duration of the songs!!
Can someone put the right duration of the songs? —The preceding unsigned comment was added by 201.17.178.139 (talk • contribs).

Discussions
I think the discussions on this artists albums should be separate articles - one for each album. Here there should only be a discography list. —The preceding unsigned comment was added by Esprit15d (talk • contribs).

Cleanup
I'm slowly trying to clean this up. I've moved the old album text to their appropriate articles, but it still needs to be placed in proper format, and this page could be fixed up a little as well. I'll probably come back to it, but for now I'm off to bed. So far I've removed the old album and track listing, and replaced it with the discovery. TheJosher 02:16, 16 December 2005 (UTC)

Matt interview
I did an interview with Matt awhile back. I don't want to post the piece myself, but if any of you deem it worthy to quote, extract information from or otherwise use, feel free. :-)

http://sheknows.com/about/look/6201.htm

I uploaded a photo earlier as I didn't think such an addition would be a conflict of interest.

- Nancy

Andwhatsnext 22:34, 26 February 2007 (UTC)

Early Life
I thought that Matt went to Barton Peveril college at 16, not Winchester college, because I went to home town gig of his a couple of years ago at which he was reminiscing about being at BP. A review of the gig which mentions the same thing is here

http://www.bbc.co.uk/southampton/music/aqualung_rev.shtml

The official biography just says "Awarded a scholarship at 16 to study composition in Winchester", can anybody find any more information? Twistme 13:11, 28 March 2007 (UTC)

Genre
I'll accept alternative, indie or piano rock but pop does definitely not suit Aqualung. Feel free to dispute but unless you can give a valid argument please do not add pop to the genre. GBobly 14:17, 27 October 2007 (UTC)

Merger proposal
I propose that Aqualung discography be merged into Aqualung (musician). I think that the content in the Aqualung discography article can easily be explained in the context of Aqualung (musician), and the Aqualung discography article is of a reasonable size in which the merging of Aqualung (musician) will not cause any problems as far as article size or undue weight is concerned.Alanl (talk) 04:19, 6 September 2011 (UTC)

 * I second your proposal in merging the articles. Since the discography of the artist isn't huge, it can be easily merged.

 * undefined tausif 09:59, 8 May 2012 (UTC)

 * I feel, particularly with the passage of time and more releases, merging both articles is NOT a good idea. We would simply end up with one unwieldy piece if it went ahead.  I accept the original proposal is now 18 months old, but time does go on and things do change.

 * Derek R Bullamore (talk) 14:15, 21 February 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 4 one external links on Aqualung (musician). 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/20131107041110/http://www.warnerbrosrecords.co.uk/press-kits/dianebirch.htm?pressID=27 to http://www.warnerbrosrecords.co.uk/press-kits/dianebirch.htm?pressID=27
 * Added archive https://web.archive.org/web/20131109132445/http://hangout.altsounds.com/news/117513-aqualung-announce-release-album-magnetic-north.html to http://hangout.altsounds.com/news/117513-aqualung-announce-release-album-magnetic-north.html
 * Added archive https://web.archive.org/web/20131109144330/http://vanitypress.co.uk/records/r_songs.html to http://vanitypress.co.uk/records/r_songs.html
 * Added archive https://web.archive.org/web/20130205160249/http://www.4music.com/news/interviews/7253/Lianne-La-Havas-year-in-review to http://www.4music.com/news/interviews/7253/Lianne-La-Havas-year-in-review

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) 19:48, 16 October 2016 (UTC)

title: Talk:Aqualung (musician)


text:
User:Artereon

jo

title: User:Artereon


text:
Pinal Airpark

Pinal Airpark, also known as Pinal County Airpark, is a non-towered, county-owned, public-use airport located 8 mi northwest of the central business district of Marana, in Pinal County, Arizona, United States. Silverbell Army Heliport is co-located with Pinal Airpark. The heliport is a private-use military facility operated by the Arizona Army National Guard.

Pinal Airpark's primary function is to serve as a boneyard for civilian commercial aircraft, where the area's dry desert climate mitigates corrosion of the aircraft. It is the largest commercial aircraft storage and heavy maintenance facility in the world. Even so, many aircraft which are brought here wind up being scrapped. Nearby the 309th Aerospace Maintenance and Regeneration Group at Davis-Monthan Air Force Base provides the same service to the United States federal government.

Aircraft at Pinal Airpark include those formerly operated by Cathay Dragon, Cathay Pacific, Delta Air Lines, Northwest Airlines, Aerosur, Hellenic, Surinam Airways, and other carriers.

History
Built in 1942 by the Sundt and Del Webb Construction Companies and opened in March 1943, the facility was known as Marana Army Air Field. During World War II, the airfield was under the command of the 389th Army Air Force Base Unit, AAF West Coast Training Center and used as a training base, as part of the 50,000 Pilot Training Program.

Marana conducted basic flight training and the training of transport pilots in instrument flying and navigation, being the home of the 3024th (Pilot School, Basic). Chinese pilots were also trained there. Five satellite airfields were established for Marana during World War II:
 * Picacho Field Aux #1 (currently Picacho Stagefield ARNG Heliport )
 * Rillito Field Aux #2 (currently reused as Marana Regional Airport )
 * Coronado Field Aux #3
 * Avra Field Aux #4
 * Sahuaro Field Aux #5 (currently El Tiro Gliderport )

The infrastructure installed at Marana during World War II was extensive. This included water, sewer, and gas systems that were still used until some problems developed in the 1990s. There was a massive storm drain system. The airfield had a railroad spur line and railroad station.

Marana closed after World War II. In 1948, after the establishment of the U.S. Air Force as an independent service, Pinal County accepted a deed to the property, subsequent to the Air Force's disposal of most of the buildings, waterlines, gas lines, and electrical lines. From 1948 to 1951, Pinal County leased the property to multiple tenants, and from 1951 to 1956, Marana was reused as a contractor-operated USAF basic flying school, operated by Darr Aeronautical Technical Company.

Marana became the headquarters of all Central Intelligence Agency air operations during the Vietnam War years, when it was the primary facility of Intermountain Airlines, a wholly owned CIA "front" company which was used to supply covert operations in Southeast Asia and elsewhere. Intermountain was infamous for its thinly veiled CIA special ops which included development and use of the Fulton Skyhook, but its cover was its non-scheduled freight and maintenance operations. Marana was the principal continental United States maintenance base for Southeast Asia CIA operations including Air America and Continental Air Services. The Marana facility was subsequently acquired by the closely Agency-linked Evergreen International Airlines, which performed aircraft modification and maintenance at the airfield.

Pinal Airport
The airport is home to many private companies including: Ascent Aviation Services and Jet Yard Solutions, Aircraft Demolition, and Jet Yard.

Since the early 2010s, airport economic development director Jim Petty has opened the facility to the public, giving free tours of the airport and the airplanes stored there.

Silverbell Army Heliport
Pinal Airpark is co-located with Silverbell Army Heliport (SAHP). The 98th Aviation Troop Command, the Western Army National Guard Aviation Training Site (WAATS) and other numerous Army National Guard units are located inside SAHP. WAATS discontinued training of the AH-64 Apache attack helicopter at the site in 2012. Currently WAATS provides training for the UH-72A Lakota.

Pinal Airpark and SAHP also hosts the US Special Operations Command's Parachute Training and Testing Facility. On 28 March 2013, Navy SEAL Brett Shadle was killed during parachute training here and another SEAL was injured.

Facilities and aircraft
Pinal Airpark covers an area of 1,508 acre at an elevation of 1,893 ft above mean sea level. It has one runway designated 12/30 with an asphalt surface measuring 6,849 by. Silverbell Army Heliport has four helipads, three measuring 100 by, and the fourth measuring 165 by. For the 12-month period ending 1 April 2020, the airport had 58,200 aircraft operations, an average of 159 per day: 86% military and 14% general aviation.

Notable aircraft
One of the notable aircraft assigned to Marana during its CIA years was a Boeing B-17G Flying Fortress, AAF Serial 44–85531. As of September 1957, the aircraft was registered to Western Enterprises Inc., a paramilitary front company founded by the CIA in 1951 for operations in Taiwan. In late 1957, missions were staged from Kurmitola Air Field in East Pakistan (now Bangladesh) to parachute agents into Tibet. The aircraft was disassembled for parts at Clark Air Base, Philippines between March and October 1958, and it is believed that this plane was eventually scrapped. The serial number 44-85531 appeared again as registered on another B-17G, 1 September 1960 registered to Atlantic General Enterprise, Washington DC (another CIA front) as N809Z. These registration numbers were then changed to the true numbers of 44–83785. Based again at Marana, this aircraft later flew black operations over Vietnam and was used to retrieve two American agents from an abandoned Soviet scientific base in the Arctic using the Fulton Skyhook in Operation Coldfeet.

Other sources

 * Manning, Thomas A. (2005), History of Air Education and Training Command, 1942–2002. Office of History and Research, Headquarters, AETC, Randolph AFB, Texas
 * Shaw, Frederick J. (2004), Locating Air Force Base Sites, History’s Legacy, Air Force History and Museums Program, United States Air Force, Washington DC
 * Shaw, Frederick J. (2004), Locating Air Force Base Sites, History’s Legacy, Air Force History and Museums Program, United States Air Force, Washington DC

title: Pinal Airpark