text:
T. K. Wetherell

Thomas Kent Wetherell (December 22, 1945 – December 16, 2018) was an American politician and educator. He served as a member of the Florida House of Representatives from 1980 to 1992, and was president of Florida State University from 2003 through 2009.

Early life
Wetherell was born in Daytona Beach, Florida, to a well known pioneer family of the Daytona Beach area. His father, Thomas James Wetherell, was born in Holly Hill on February 16, 1912, and his mother was Mildred Juanita Kent Wetherell. His paternal great grandparents Thomas Wetherell (1845-1921) and Margaret Wetherell who travelled to the United States by schooner from Durham, England, arrived in the Daytona Beach area in 1876. His grandfather, Thomas Wetherell (1867–1945), was involved in many of the firsts in the area including helping build the Ponce de Leon Lighthouse. Wetherell attended Port Orange Elementary School and Mainland High School. He attended Florida State University (FSU) on a football scholarship as a wide receiver and played from 1963 to 1967. Unfortunately for Wetherell, other teammates included Fred Biletnikoff and Ron Sellers, both future hall of famers. While at FSU, Wetherell joined the Phi Delta Theta fraternity. He earned two academic degrees in social studies and education, in 1967 and 1968. In 1974, he received a doctorate in education administration from FSU.

Political career
While in Daytona, Wetherell was inspired by the success of J. Hyatt Brown, another Mainland H.S. graduate, and decided to try politics. Wetherell, a Democrat, was a member of the Florida House of Representatives from 1980 to 1992, and Speaker of the House in 1991 and 1992. He served as chair of the House's appropriations and education committees. While speaker, he blocked Republican redistricting actions aimed at limiting the impact of black voters. He supervised reform of campaign and state ethics laws. He also supported the movement to reduce state government spending while simultaneously pushing the expenditure of $38 million for construction of the FSU University Center which eventually cost $100 million.

James Harold Thompson, speaker of the house prior to T.K., commented that Wetherell thoroughly understood the appropriations process and that knowledge helped him be successful at TCC and FSU. "He set in motion a recognition of excellence in higher education that has been carried over by others inside and outside of the Legislature.”

Educational career
Wetherell's first position was at FSU as an academic counselor for student-athletes. He was then hired to assist the dean of housing at Florida Technological University (now University of Central Florida), then director of housing and assistant to the vice president. He became an associate professor of education at Bethune-Cookman College before becoming dean, provost and vice president at Daytona Beach Community College.

He was considered for President at the University of West Florida in 1987, but not selected. When FSU President Bernard F. Sliger resigned in 1991, Wetherell was a finalist as his replacement, but Dale Lick was chosen. When Lick left after a few years, Wetherell was again one of two, but Sandy D'Alemberte got the nod.

After leaving the Florida legislature, he was president of the Independent Colleges and Universities of Florida.

TCC
Wetherell served as president of Tallahassee Community College (TCC) from 1995 to 2001. During his time as president, enrollment doubled as did the number of buildings on campus including a Student Union, health studies and  second-floor additions for English, extended studies and security. Permits for a History and Social Sciences building had been submitted when he resigned. That building was eventually named for Wetherell. Fifty new programs were added, and TCC was nationally ranked in the top-25 for the number of community college graduates.

After he resigned from his post at TCC, Wetherell was a lobbyist for the Southern Strategy Group.

FSU
The FSU Board of Trustees appointed Wetherell as president on December 18, 2002. He was the first FSU graduate to serve as the school's president. His salary was ranked among the top ten for public university presidents in the United States. Later, Lee Hinkle joined Wetherell's administration as a vice president for university relations. In late 2006, he added his voice to efforts by Bernie Machen, president of the University of Florida to bring a play-off to Division I-A college football.

President Wetherell's accomplishments at FSU:
 * Highlighted the history of FSU by erecting statues in tribute to the school's black pioneers, women's college history and past presidents. He expanded the FSU Legacy Walk begun by President Bernard F. Sliger in 1989 and added a statue and stained glass wall for football legend Bobby Bowden.
 * The Applied Superconductivity Center accepted an invitation to move from the University of Wisconsin to the National High Magnetic Field Laboratory at Innovation Park in Tallahassee after 20 years in Madison.
 * The FSU College of Medicine graduated its first class in 2005 and was accredited. Their building was completed in 2006. Six regional campuses were established including research collaborations with the Mayo Clinic in Jacksonville and Tallahassee Memorial HealthCare.
 * New buildings in 2008 included the Jim King Life Sciences building, the Psychology building, and the Chemical Sciences Laboratory (CSL) building.
 * TK's wife, Virginia Bass Wetherell, acted as project manager for planning, construction and furnishing of the new President's House which opened in August 2007.
 * A new Alumni Center was completed and the old President's house renovated and renamed the Pearl Tyner Alumni Welcome Center.
 * Engineered the departure of Bobby Bowden
 * Helped FSU weather the 2008 Recession when state university funding was slashed for three years.
 * The $33-million Ruby Diamond Auditorium renovation was completed in 2010.
 * Successfully won the battle with the NCAA over the use of the Seminole name.
 * Enhanced the relationship with the Seminole Tribe of Florida by establishing a scholarship program for students from the Seminole Tribe, creating a Seminole history course, unveiling a bronze statue at the University Center depicting a Seminole family during the Second Seminole War of the 1830s. A new tradition includes tribe members participating at commencement ceremonies.
 * Created the Office of Undergraduate Research and Creative Endeavors which was later renamed the Center for Undergraduate Research and Academic Engagement. Graduation rates improved as did student retention.
 * Used brick to transform Doak Campbell Stadium, which looked like an erector set, into a grand coliseum and unified the architecture of Florida State.
 * Additional construction of parking garages, residence and dining halls was not as spectacular, but necessary.
 * Wetherell increased the number of doctorates awarded, the total research dollars received by the university, and the academic profile of FSU students which led to new construction projects worth tens of millions.

Although T. K. Wetherell resigned as FSU's president in 2010, he didn't leave the campus. He moved to a modest office in the College of Education where he taught an online course and monitored the Center for Higher Education Research, Training and Innovation which helps build portfolios for junior faculty members.

Personal life
After a 1987 divorce from his first wife, with whom he had a son in 1970, Wetherell married Virginia Bass Wetherell, a former Florida state government official and state legislator; he gained two stepdaughters from the 1988 marriage. His son, T. Kent Wetherell II is a lawyer and judge of the United States District Court for the Northern District of Florida.

Oak Hill
While serving in the Florida House, T. K. Wetherell began purchasing parcels of land in the Red Hills Region of Jefferson County, Florida that would become the 983-acre Oak Hill Plantation. The property is near Lamont, an unincorporated community and census-designated place (CDP) 30 miles east of Tallahassee. Following their wedding, the couple began planning to build a home on the property. Design inspiration for the home came from the historic Asa May house in nearby Capps, Florida. Architectural elements from historic buildings being demolished or purchased at auctions were incorporated into the plans. Tallahassee's Old Floridian Hotel was the source of four huge 19th-century windows that were placed at the ends of the main hallways on each side of the first floor. The ceilings are thirteen-feet tall to frame the jumbo windows. The staircase off the grand foyer used pine from the Old Ormond Hotel which opened in 1888 and was built by Henry Flagler. Other historic elements from the Ormond Hotel include fireplace mantels, doorknobs, and other hardware. Flooring throughout the house is heart-of-pine. Construction on a two-story Plantation house was begun in 1990 and completed the following year. There are formal living and dining rooms, a library with a comfortable reading area, a parlor with a wet bar, a chef's kitchen outfitted with high-end appliances and an informal dining area; a separate caterer’s kitchen; a butler’s pantry, an office, a Home cinema featuring pediments and light fixtures once in the old Florida Capital building, and a screened porch overlooking the landscaped backyard. The second-floor porch has a view of the lake.

Honors

 * FSU Football Hall of Fame 1991
 * Moore-Stone Award
 * the Circle of Gold Award
 * FSU Distinguished Service Award
 * honorary Doctorate of Letters from Flagler College.
 * T. K. Wetherell History and Social Sciences building named for him at Tallahassee Community College
 * Bronze statue of T.K. Wetherell at FSU's Westcott Plaza, unveiled in January 2010
 * the 8-floor FSU University Center Building "A" was named the T.K. Wetherell Building

Health
Wetherell was diagnosed with prostate cancer in 2002. According to the National Cancer Institute, Most prostate cancers are slow growing and most men with prostate cancer do not die from it. Wetherell had been seeing physicians at the Mayo Clinic in Jacksonville for several years, but in 2009 his doctors referred him to M.D. Anderson Cancer Center. His wife Ginger accompanied him to the facility in Houston and they returned every three weeks for more treatments. However, his cancer battle began to take more and more of his time.

Wetherell stated, “We’ve been through Expandia and all the drugs. They work for a while and then they quit working. I’ve done different trials. The bottom line is, I knew that this was coming to some degree or another. I knew I couldn’t do the stuff I needed to do at FSU. It’s just a 24/7 job. It’s a great job, I’m glad I did it. But I knew I couldn’t do it at the level I knew it needed to be done.” Wetherell had hoped for a few more years; he was only 65. He resigned as FSU's president on January 31, 2010.

Until his death, he and his wife lived at the 983-acre Oak Hill Plantation in Jefferson County, Florida, east of Tallahassee. He was a fan of hunting birds including turkey, dove and quail on the estate. In October 2003 he and his wife announced the donation of the $10 million Oak Hill Plantation to FSU after they die, and in 2012 or 2013 he changed his will to leave it to his wife. He also owned a ranch in Montana where he invited family and friends to spend time during summers. A close friend noted that Wetherell also loved country music, NASCAR, Blue Bell ice cream and fried food. His FSU bio claimed that his interests included athletics, hunting & fishing, aviation and travel.

After his 2002 cancer diagnosis and 17 years of treatment, he died from complications due to cancer on December 16, 2018, six days before his 73rd birthday.

title: T. K. Wetherell


text: Category:405 BC deaths

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

title: Category:405 BC deaths


text: Wussup?

title: Wussup?


text:
Talk:Spinning pinwheel

Colloquial names list way too long
I don't think anyone cares, really. If someone has a good proof why I'm wrong with this then I'll gladly agree to leave that in there, but when *I* read the article that huge, mostly unsourced list of colloquial names this thing is claimed to have is just annoying and misplaced (also it seems hugely made up by the minds of single persons without proper references). I'd recommend cutting it down to two or three sourced ones and leave all that other stuff away (at the moment it seems just way too long for anyone to care).

Since I never touched that article before I won't go and instantly remove them, that would feel like messing around with someone else's work who is more experienced on the topic. But I really recommend some Mac-familiar person takes a closer look at this distracting list and cuts it down (or maybe, if this is totally needed in full length, moves it to a separate article section - it really just seems so misplaced in the introduction).87.164.243.5 (talk) 12:53, 12 November 2010 (UTC)

 * I agree. The list is unprofessional and mostly useless. 86.168.252.86 (talk) 19:03, 5 June 2012 (UTC)

 * ✅ I've also moved the article to spinning pinwheel and removed the unsourced names (and those not citing reliable sources). Additionally, I've introduced the term pointer (graphical user interfaces), per my unanswered query at #Pointer?. -- Trevj (talk) 12:11, 16 July 2012 (UTC)

I'm reverting this removal of a reference because it supports the article move and colloquial names discussed above. -- Trevj (talk) 08:47, 5 September 2012 (UTC)
 * Fair point - it just looked a bit odd to be immediately interrupting the first sentence by sourcing a noun. To a reader unfamiliar with the dispute over the common name of the icon, it's unclear what claim is being referenced. Would it be more appropriate at the end of the sentence? --McGeddon (talk) 09:56, 5 September 2012 (UTC)
 * Good idea. Moved. (Technically, the ref doesn't state that it's a pointer (graphical user interfaces) but it's so obvious that it can't reasonably be contested!) -- Trevj (talk) 11:24, 5 September 2012 (UTC)

Intro stinks
The intro to this article, of the form of:

A, also known as B, C, D, E, F, G, H is

is much less helpful than:

A is. It is also sometimes known as B, C, D, E, F, G. —Preceding unsigned comment added by 157.166.175.129 (talk) 01:21, 12 December 2010 (UTC)

Unessesarly "Tricks" section
There's an Unessesarly "Trick" section at the end of the article after "Reference" that has NOTHING to do with this article. I think it should be removed. Sorry for bad spelling :-P --41.132.240.244 (talk) 08:54, 22 June 2011 (UTC)

Pointer?
Is this "cursor" in fact a Pointer (computing WIMP), i.e. does it move with the input device, like an hourglass pointer? -- Trevj (talk) 09:21, 22 December 2011 (UTC)
 * I'm assuming it does, and have changed the text accordingly. -- Trevj (talk) 12:12, 16 July 2012 (UTC)

Do we need Patronage??
Is the Patronage section really necessary? I will concede iOS, but I would hardly call it "patronage" since iOS is an Apple OS for a different product. I do not see any references or citations supporting the GNOME claim.

Recommend removing. — Preceding unsigned comment added by Tendim (talk • contribs) 20:05, 7 February 2016 (UTC)

 * "Patronage" doesn't make sense to me as a section title. "Implementation" or "Adoption" would make more sense. Also, the section is too brief, as well as confusing, to be of much use. I will remove it. Dhtwiki (talk) 07:41, 10 November 2016 (UTC)

Redirect to Pointer_(graphical_user_interfaces)
Redirected article to Pointer_(graphical_user_interfaces) - this can be summed up as part of the mouse pointers, I can't see a good reason for OS-specific articles. Schlagwerk (talk) 12:04, 9 June 2016 (UTC)

See also: Busy beaver
The WP article about Busy beaver has nothing to do with busy cursors. 95.204.194.187 (talk) 19:05, 11 September 2017 (UTC)

Page should be renamed to spinning wait curser
Page should be renamed to spinning wait curser. --コロコロコミックエラー (talk) 20:48, 19 August 2019 (UTC)

Reference to pointer HID guidelines broken
The referenced link to Apple's HID pointer guidelines now redirects to the generic Apple UI guidelines webpage.

Superl2 (talk) 16:29, 15 June 2022 (UTC)

"Ferris Wheel of Death"
The other names listed in the intro have sources, this one doesn't. The only website I could find using this name seems to have copied it from the wiki, as it features the other names there. — Preceding unsigned comment added by LengthUsernamesAreDiscouraged (talk • contribs) 04:29, 10 June 2023 (UTC)

 * I've never heard the graphic referred to this way, except here, and expect that it can be removed unless a source is found. Dhtwiki (talk) 22:08, 10 June 2023 (UTC)

title: Talk:Spinning pinwheel


text:
Category:Cherokee people

ko:분류:체로키족 tr:Kategori:Cherokee kişiler

title: Category:Cherokee people


text:
Talk:Fredrick William Holiday

Neutrality of Article
The wording of this article betrays a strong pro-Holiday bias. It accepts at face value some of Holiday's less plausible claims, it isn't fair to the POV that Nessie is just an animal, and it doesn't even acknowledge the widespread belief that Nessie is just a myth. ---Isaac R 04:21, 25 Apr 2005 (UTC)

 * Isn't "accepting at face value" the very definition of neutrality? Kortoso (talk) 17:52, 17 October 2013 (UTC)

Biography
I imagine that most of the (uncited) biographical details come Colin Wilson in "The Goblin Universe". It would be natural for a posthumous publication to include a biography by the editor. If anyone has a copy, can they add appropriate citations, and possibly other details? Chemical Engineer (talk) 06:13, 8 September 2019 (UTC)

title: Talk:Fredrick William Holiday


text:
User:Kevinhksouth

I am from Hong Kong. Currently, I mainly work in the Chinese version of Wikipedia. If you are a Chinese-speaker, feel free to visit my user page in that Wikipedia.

I have been a sysop in Chinese Wikipedia since early 2006. As of mid-2008, I have arround 20,000 edits there. However, I am not so active here. Maybe this is the reason why I was mis-identified as a newcomer in some places in English Wikipedia.

zh:User:Kevinhksouth zh-yue:User:Kevinhksouth

title: User:Kevinhksouth


text:
Saint-Nazaire-d'Acton, Quebec

Saint-Nazaire-d'Acton is a parish municipality in central Quebec, Canada in Acton Regional County Municipality. The population as of the Canada 2011 Census was 826.

Demographics
In the 2021 Census of Population conducted by Statistics Canada, Saint-Nazaire-d'Acton had a population of $880$ living in $361$ of its $374$ total private dwellings, a change of NaN% from its 2016 population of $884$. With a land area of 58.04 km2, it had a population density of in 2021.

Population trend:

Mother tongue language (2006)

Communities

 * Royville
 * Saint-Nazaire

title: Saint-Nazaire-d'Acton, Quebec


text:
Katyayana (disambiguation)

Katyayana may refer to:

 * Katyayana (Buddhist), a disciple of Gautama Buddha
 * Kātyāyana, an ancient Indian mathematician and Sanskrit grammarian

title: Katyayana (disambiguation)


text:
Bhutan at the 1988 Summer Olympics

Bhutan competed at the 1988 Summer Olympics in Seoul, South Korea.

Competitors
The following is the list of number of competitors in the Games.

Archery
In its second Olympic archery competition, Bhutan sent only men. As a team, they finished last.

Men

title: Bhutan at the 1988 Summer Olympics


text:
Abilene State Park

Abilene State Park is a 529.4 acres state park next to Lake Abilene about 15 mi southwest of Abilene, Texas on FM 89. The park opened on May 10, 1934 and is managed by the Texas Parks and Wildlife Department.

History
The presence of humans in Abilene State Park dates back at least 6,000 years. The Tonkawa and Comanche passed through the park while hunting bison and also camped there. Settlers who had come to the region in the late 1870s occupied the land next. They farmed the bottomlands and raised sheep and cattle on the uplands. Many of the settlers were displaced when the City of Abilene built a dam in 1918 that created Lake Abilene to ensure a reliable water supply for the growing town. The lake is now used purely for recreation.

The state acquired the property from the city of Abilene in 1933. Early development of the park was done by Civilian Conservation Corps (CCC) companies 1823(V) and 1823(CV) between 1933 and 1935. They cleared land and built roads. The CCC constructed a concession building, swimming pool, pool shelters, pergolas, stone water tower, stone pump house, water fountains, stone seats, picnic tables and fireplaces.

Nature
Abilene State Park is located in an area where the Rolling Plains and Edwards Plateau ecoregions of Texas meet. The landscape is short prairie grass, brushland and wooded stream valleys in a range of hills called the Callahan Divide.

Animals
White-tailed deer, raccoons, armadillos, foxes, squirrels, skunks and cottontail rabbits are seen in the park.

Birds that live in or visit the park, include the Mississippi kite, greater roadrunner, northern cardinal, hummingbird, Carolina chickadee and northern mockingbird. Bass, crappie, catfish and perch are caught in Buffalo Wallow, a pond in the park.

Flora
Live oak, Texas red oak, cedar, ashe juniper, honey mesquite and hackberry trees grow in the park.

Facilities and activities
Abilene State Park features camping sites for recreational vehicles and tents, picnic shelters, a swimming pool, a bird blind, playground and hiking trails. There is a volleyball court and fields for soccer and baseball. The park is on Lake Abilene which offers opportunities for fishing, kayaking, canoeing and boating.

title: Abilene State Park


text: Wusup

title: Wusup


text: Wasup

title: Wasup


text:
Argentina at the 1988 Summer Olympics

Argentina competed at the 1988 Summer Olympics in Seoul, South Korea. 118 competitors, 93 men and 25 women, took part in 53 events in 18 sports. The country claimed Olympic medals for the first time since 1972.

Competitors
The following is the list of number of competitors in the Games.

Flatwater

 * Men

 * Women

Track

 * Sprints

 * Pursuits

 * Points races

Men
Coach: Luis Ciancia Legend: GP – Games played; G – Goals; S – Shots; FG – Field Goals; PC – Penalty Corners; PS – Penalty Strokes; Green Cards;  Yellow Cards;  Red Cards
 * Team roster and tournament statistics

 * Preliminary Round (Pool A)

 * Qualified for semifinals

 * 5th to 8th place classification

 * 7th place match

Women
Coach: Miguel MacCormick Legend: GP – Games played; G – Goals; S – Shots; FG – Field goals; PC – Penalty corners; PS – Penalty strokes; Green cards;  Yellow cards;  Red cards
 * Team roster and tournament statistics

 * Preliminary round (Pool A)

 * Qualified for semifinals

 * 5th to 8th place classification

 * 7th place match

Football

 * Squad
 * Matches played in parentheses denotes player came from the bench

Preliminaries
 * Results

 * Quarterfinals

Judo

 * Key:

 * Chui – Penalty that equals the loss of five points

Sailing

 * Key
 * RET – Retired
 * DNC – Did not compete

Swimming

 * Key:

 * DSQ – Disqualified

Volleyball

 * Roster

Coach: Luis Muchaga

 * Group play

 * Semifinal

 * Bronze medal match

 * Won Bronze Medal

title: Argentina at the 1988 Summer Olympics


text:
Shagufta Anwar

Shagufta Anwar is a Member of Provincial Assembly (MPA) of the Provincial Assembly of the Punjab in Pakistan. She is the Parliamentary Secretary for Anti-Corruption. She is a member of the ex-ruling Pakistan Muslim League-Q party.

Education
Anwar is the daughter of Mian Muhammad Anwar and was born at Sargodha. She received the degree of M.A. in Political Science in 1991 and that of LL.B. in 1992 and also completed D.T.L. in 1993 from University of the Punjab, Lahore. A practising lawyer, she is a member of the International Bar Association and has sat on the Executive Committee, Tax Reforms Committee, and Environmental Protection Committee of the Lahore High Court since 1995.

Career
She was elected an MPA of the Punjab in the General Elections of 2002 against one of the seats reserved for women; and has served as Parliamentary Secretary for Anti Corruption since August 5, 2003. She is also a member of the Syndicate at Lahore College for Women University. She visited the United States in 2004 at the invitation of the Government of the United States.

title: Shagufta Anwar


text: Watzup

title: Watzup


text: Wutzup

title: Wutzup


text:
Wazap!

Wazap! is a vertical search engine, video game database and social networking site to distribute gaming news, rankings, cheats, downloads and reviews owned and operated by Eastbeam Co. Ltd. of Japan. As a vertical search engine, it indexes gaming sites and categorizes the information as news, reviews, cheats, downloads, previews and articles. The name Wazap! originates from the fusion of the Japanese word 'waza (技)' meaning 'technique' and 'up', symbolizing improvement.

History
Wazap first launched in Japan in 2001 as a community website for gamers. Initially a mix of gaming news and user generated content, Wazap was then redeveloped as a gaming search and information distribution site. Following initial success in Japan, Wazap was launched in other markets, beginning with Germany in 2004 under the auspices of Wazap AG. In November 2006, Wazap launched Wazap (CN) in China. The US version of Wazap launched in June 2007.

By 2008, however, Wazap had failed to gain traction outside of Japan, and its German, Chinese and American operations were closed down. As of October 2018, it continues to operate solely in Japan.

Executives

 * Andreas Rührig: CEO & Co-founder
 * Timo Meyer: COO & Co-founder
 * Philip Gienandt: CFO
 * Alexander Piutti: CCO, & General Manager, Europe
 * Jeff Tang: General Manager, China
 * Thom Kozik: General Manager, U.S.

Awards
In 2007, Wazap AG (Germany) earned a 2007 Red Herring Award – European Division. The Red Herring award is noted as a valuable tool in measuring companies that will serve as leaders of innovation in the field of technology.

title: Wazap!


text:
Regime theory

Regime theory is a theory within international relations derived from the liberal tradition that argues that international institutions or regimes affect the behavior of states or other international actors. It assumes that cooperation is possible in the anarchic system of states, as regimes are, by definition, instances of international cooperation.

Stephen D. Krasner was a key figure in establishing Regime theory as a prominent topic of study in IR, in part through the 1983 edited collection International Regimes. Robert Keohane's 1984 book After Hegemony has been described as regime theory's "fullest expression."

Theoretical foundations
While realism predicts that conflict should be the norm in international relations, regime theorists say that there is cooperation despite anarchy. Often they cite cooperation in trade, human rights, and collective security, among other issues. These instances of cooperation are regimes. The most commonly cited definition comes from Stephen Krasner, who defines regimes as "institutions possessing norms, decision rules, and procedures which facilitate a convergence of expectations". Thus, the concept of regimes is broader than that of a formal organization.

Not all approaches to regime theory, however are liberal or neoliberal; some realist scholars like Joseph Grieco developed hybrid theories which take a realism-based approach to this fundamentally liberal theory. (Realists do not say cooperation never happens, just that it's not the norm—a difference of degree).

In international political economy
As stated above, a regime is defined by Stephen D. Krasner as a set of explicit or implicit "principles, norms, rules, and decision making procedures around which actor expectations converge in a given area of international relations". This definition is intentionally broad, and covers human interaction ranging from formal organizations (e.g., OPEC) to informal groups (e.g., major banks during the debt crisis). Note that a regime need not be composed of states.

Within IPE there are three main approaches to regime theory: the dominant, liberal-derived interest-based approach, the realist critique of interest-based approaches, and finally knowledge-based approaches that come from the cognitivist school of thought. The first two are rationalist approaches while the third is sociological.

Within regime theory, because regime theory is by definition a theory that explains international cooperation (i.e., it's a traditionally liberal concept) liberal approaches prevail within the literature.

Liberal approaches
Liberal interest-based approaches to regime theory argue that cooperation in anarchy is possible without a hegemon because there exists a "convergence of expectations". Regimes facilitate cooperation by establishing standards of behavior that signal to other members that they are in fact cooperating. When all states expect cooperation from the others, the probability of sustaining cooperation increases. Digvijay Mehra notes that regime theory lacks recognition of political parties and their role in altering the influence of international institutions, but Mehra's claims have generally been ignored in academic circles for their lack of evidentiary support and intellectual rigor.

Neoliberals believe that realists neglect the degree to which countries share interests and the iterative nature of state relations. Realists err by implicitly modeling the world using the classic single-play prisoner's dilemma, in which the payoff structure makes defection a dominant strategy for both players. The difference between this model and reality is that states are not like prisoners, states must continually cooperate whereas prisoners will never see one another again. One's decisions today, then, have future consequences. Mutual cooperation is thus rational: the sum of relatively small cooperative payoffs over time can be greater than the gain from a single attempt to exploit your opponent followed by an endless series of mutual defections In The Evolution of Cooperation, Robert Axelrod referred to single-shot exploitation as the behavior whereby states avoided "tit for tat".

In the iterated prisoner's dilemma, the actors' behavior is determined by the following assumptions:
 * States are rational, unitary, gain-maximizing actors, living in anarchy and ridden by the security dilemma.
 * There are future consequences for present actions; the prisoner's dilemma is not a one-shot event. Thus;
 * It is in the interest of states to cooperate in the present because, in the future, other states will defect on them (tit-for-tat strategy). Thus;
 * The theory presupposes that states are concerned with absolute gains, that is, states do not consider the gains or losses of other states in their utility analysis. In contrast neorealists argue that states are concerned with relative gains. That is, states are concerned with the advantages they gain versus the advantages of other states in the anarchic system.

Neoliberal IR theorist Robert Keohane argues that international regimes can increase the likelihood of cooperation by:
 * Providing information about the behavior of others by monitoring the behavior of members and reporting on compliance.
 * Regimes clearly define what constitutes a defection and often clearly prescribe punishments for defection.
 * This reduces the fear that the state is being exploited by other members of the regime and minimizes the chance for misunderstanding. Prescribing sanctions reduces the incentive to covertly defect.
 * Reducing transaction costs.
 * By institutionalizing cooperation, regimes can reduce the cost of future agreements. By reducing the cost of reaching an agreement, regimes increase the likelihood of future cooperation. For example, each round of GATT resolved many procedural problems that did not have to be revisited in subsequent rounds, making cooperation easier and more likely.
 * Generating the expectation of cooperation among members.
 * By creating iteration and the belief that interaction will continue for the foreseeable future, regimes increase the importance of reputation and allow for the employment of complex strategies.

Other authors such as Kenneth A. Oye claim that regimes can provide incentives to cooperate and deterrents to defect by altering the payoff structure of the regime.

Realist approaches
Realists such as Joseph Grieco propose power-based theories of regimes based on hegemonic stability theory. Regime theory may appear to counter hegemonic stability theory sometimes, but realists also apply it within regime theory in order to explain change. When used in this way, realists conclude that a strong hegemon is what makes for a successful—i.e., robust, resilient—regime.

In brief, within regime theory, liberals and realists disagree on two things—the nature of international cooperation and the role of international institutions. Liberals believe that international institutions at most bring about an environment conducive to the convergence of state interests, which facilitates regime cooperation; and at least, facilitate cooperation that might otherwise not have been able to occur in an anarchic world. On the other hand, realists believe that regimes merely reflect the distribution of power in the international system, and that any cooperation that occurs under a regime would have occurred anyway. (Powerful states create regimes to serve their security and economic interests; regimes have no independent power over states, especially great powers; as such, regimes are simply intervening variables between power, the real independent variable, and cooperation, the dependent variable).

Susan Strange had a five-fold critique of regime theory:

 * 1) It is a fad: regime theory is a temporary reaction to current events and it has cumulative value to knowledge
 * 2) The concept of regime is imprecise
 * 3) It is value-laden: it is pre-occupied with preserving U.S. hegemony and U.S.-led institutions, which are seen as benevolent
 * 4) It underemphasizes the dynamism of world politics: regime theory has a static view of politics
 * 5) it is state-centric: regime theory does not consider broader structural patterns and forms of power

Cognitivist knowledge-based approaches
In contrast to the rationalist approaches above, cognitivists critique the rationalist theories on the grounds that liberals and realists both use flawed assumptions such as that nation-states are always and forever rational actors; that interests remain static, that different interpretations of interests and power are not possible. The cognitivists also argue that even when the rationalist theories employ iterated game theories where future consequences affect present decisions, they ignore a major implication of such iteration—learning. Consequences from an iterated game look backwards to the past as well as forward to the future. So one's decisions today are not the same as one's decisions tomorrow, not only because the actors are taking the future into account but because each is taking the past into account as well. Finally cognitivists use a post-positivist methodology which does not believe that social institutions or actors can be separated out of their surrounding socio-political context for analytical purposes. The cognitivist approach then, is sociological or post-positivist instead of rationalist. In sum, for the cognitivists, it's not only interests or power that matters but perceptions and environment as well.

An example of a useful application of this approach to the study of international regime theory, is exemplified in a doctoral dissertation by Edythe Weeks, wherein she demonstrates that we can apply this type of analysis to explain and highlight key actors, unfolding political dynamics and historical-ideological shifts, related to commercial activities concerning outer space and its resources.

Alternative approaches
Alternative approaches to liberal or realist regime theory tend to treat the debates over the normative bases of cooperation or otherwise as epiphenomenal. They emphasize instead the complex intersection of social forces, including changing values, that gave rise to ongoing political and economic regimes of power in the first place. For example, they emphasize the rise of modern bureaucratic regimes of negotiation or the normalizing of the global system of nation-states and multinational corporations as key players on the global stage: In order to understand the nature of globalizing institutions and regimes it is crucial to locate them in their social-relational context, rather than just concentrating on the organizational mechanics and policy-making content of a few peak institutions. Understanding the process, historical context, and contemporary relations of institutionalization is fundamental for making sense of the more empirical task of documenting the activities of this or that institution.

title: Regime theory


text:
Hong Kong at the 1988 Summer Olympics

Hong Kong competed at the 1988 Summer Olympics in Seoul, South Korea. 48 competitors, 38 men and 10 women, took part in 49 events in 11 sports. The use in the traditional Korean Hangul alphabet which placed last before the host nation in the Parade of Nations.

Competitors
The following is the list of number of competitors in the Games.

Archery
In its second Olympic archery competition, Hong Kong was represented by two men and a woman. None advanced past the preliminary round.

Men

Women

Canoeing
Men

Cycling
Five male cyclists represented Hong Kong in 1988.

Road
Men

Diving

 * Men's 3 metre springboard

Fencing
Seven fencers, six men and one woman, represented Hong Kong in 1988.

 * Men's foil
 * Choy Kam Shing
 * Lee Chung Man
 * Weng Tak Fung

 * Men's team foil
 * Choy Kam Shing, Lee Chung Man, Tong King King, Weng Tak Fung

 * Men's épée
 * Chan Kai Sang
 * Tong King King
 * Tang Wing Keung

 * Men's team épée
 * Chan Kai Sang, Choy Kam Shing, Tang Wing Keung, Tong King King

 * Women's foil
 * Yung Yim King

Judo

 * Men's 60 kg Lee Kan
 * Men's 65 kg
 * Men's 71 kg
 * Men's 78 kg
 * Men's 86 kg

Sailing

 * Men's Division II
 * Finn
 * Flying Dutchman

Shooting

 * Men's 50 metre pistol

Swimming
Men's 50 m Freestyle
 * Khai Kam Li
 * Heat – 24.30 (→ did not advance, 35th place)
 * Michael Wright
 * Heat – 24.47 (→ did not advance, 39th place)

Men's 100 m Freestyle
 * Michael Wright
 * Heat – 53.64 (→ did not advance, 49th place)
 * Khai Kam Li
 * Heat – 53.70 (→ did not advance, 50th place)

Men's 200 m Freestyle
 * Arthur Li
 * Heat – 1:58.10 (→ did not advance, 51st place)
 * Yi Ming Tsang
 * Heat – 2:01.02 (→ did not advance, 56th place)

Men's 400 m Freestyle
 * Arthur Li
 * Heat – 4:18.50 (→ did not advance, 45th place)

Men's 100 m Backstroke
 * Hor Man Yip
 * Heat – 1:01.91 (→ did not advance, 42nd place)
 * Kam Sing Watt
 * Heat – 1:08.03 (→ did not advance, 52nd place)

Men's 200 m Backstroke?
 * Kam Sing Watt
 * Heat – 2:30.78 (→ did not advance, 48th place)

Men's 100 m Butterfly
 * Yi Ming Tsang
 * Heat – 57.84 (→ did not advance, 39th place)

Men's 200 m Individual Medley
 * Hor Man Yip
 * Heat – 2:14.65 (→ did not advance, 40th place)
 * Arthur Li
 * Heat – 2:17.10 (→ did not advance, 48th place)

Men's 4 × 100 m Freestyle Relay
 * Michael Wright, Khai Kam Li, Arthur Li, and Yi Ming Tsang
 * Heat – 3:34.78 (→ did not advance, 16th place)

Men's 4 × 100 m Medley Relay
 * Hor Man Yip, Kam Sing Watt, Yi Ming Tsang, and Michael Wright
 * Heat – 4:05.28 (→ did not advance, 22nd place)

Women's 50 m Freestyle
 * Cee Kay Hung
 * Heat – 28.15 (→ did not advance, 35th place)
 * Wing Sze Tsang
 * Heat – 29.14 (→ did not advance, 45th place)

Women's 100 m Freestyle
 * Cee Kay Hung
 * Heat – 1:00.18 (→ did not advance, 42nd place)
 * Fenella Ng
 * Heat – 1:01.27 (→ did not advance, 45th place)

Women's 200 m Freestyle
 * Fenella Ng
 * Heat – 2:10.43 (→ did not advance, 36th place)
 * Cee Kay Hung
 * Heat – 2:13.61 (→ did not advance, 42nd place)

Women's 100 m Backstroke
 * Wing Sze Tsang
 * Heat – 1:10.50 (→ did not advance, 35th place)

Women's 100 m Butterfly
 * Cee Kay Hung
 * Heat – 1:06.94 (→ did not advance, 31st place)
 * Annemarie Munk
 * Heat – 1:08.35 (→ did not advance, 36th place)

Women's 200 m Individual Medley
 * Annemarie Munk
 * Heat – 2:34.32 (→ did not advance, 32nd place)

Women's 400 m Individual Medley
 * Annemarie Munk
 * Heat – 5:24.11 (→ did not advance, 29th place)

Women's 4 × 100 m Freestyle Relay
 * Cee Kay Hung, Fenella Ng, Wing Sze Tsang, and Annemarie Munk
 * Heat – 4:08.58 (→ did not advance, 14th place)

Table Tennis

 * Men's singles
 * Women's singles
 * Men's doubles
 * Women's doubles

title: Hong Kong at the 1988 Summer Olympics


text: What's up (phrase)

title: What's up (phrase)


text:
Wikipedia:Articles for deletion/List of Joe S. Harrington's All-Time Top 100 Albums

 This page is an archive of the discussion about the proposed deletion of the article below. This page is no longer live. Further comments should be made on the article's talk page rather than here so that this page is preserved as an historic record. The result of the debate was delete. – ABCD 17:59, 6 May 2005 (UTC)

List of Joe S. Harrington's All-Time Top 100 Albums
Non-notable guy's top 100 list for a non-notable website. RickK 04:29, Apr 25, 2005 (UTC)
 * Delete. Not notable, possible vanity. Because the list was written for a webzine (Blastitude) with a very limited readership pretty much does it for me. android↔talk 04:33, Apr 25, 2005 (UTC)
 * Delete. A list from a non-notable guy from a webzine with little readership. Zzyzx11 | Talk 04:36, 25 Apr 2005 (UTC)
 * Delete, POV, not notable, self-promotion. Megan1967 04:45, 25 Apr 2005 (UTC)
 * Delete. If Joe is so notable, where's his article? Gamaliel 04:47, 25 Apr 2005 (UTC)
 * Delete. If anything Joe would have an article before the rest would. This isn't Amazon's ListMania! sorry... Master Thief Garrett 05:35, 25 Apr 2005 (UTC)
 * Delete Not notable. And Steely Dan at number one? Leithp 15:27, 30 Apr 2005 (UTC)

 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text: Wussup (phrase)

title: Wussup (phrase)


text: Wuzzup (phrase)

title: Wuzzup (phrase)


text:
Bandari music

Bandari music stems from Iran's south, around the Persian Gulf region.

Music
It is a rhythmic type of dance music played in fast and slow tempos. The music includes vocals and instruments. It is played during celebrations such as weddings.

The definition of the word “bandari” means “of the port” is a derivation of the Persian word bandar, meaning port. It is commonly known as "Chamak" or "Chamaki" Music in the GCC region.

Instruments
The major musical instruments used in the Bandari style include the nei anban (a bagpipe instrument made of goat's skin), the tombak (a percussion instrument made of animal skin and the wood of the walnut tree), the daf (a percussion instrument made of animal skin and a wooden frame like the head of a drum, with jingles on the rim, similar to the tambourine), and the darbuka (a percussion instrument made of fish skin and clay).

Modern Persian Bandari bands use rhythmic instruments such as the frame drum, darbuka, djembe, talking drum, quinto, conga, and acoustic and electric drums specialized in 6/8 rhythms.

title: Bandari music


text:
Saudi Arabia at the 1988 Summer Olympics

Saudi Arabia competed at the 1988 Summer Olympics in Seoul, South Korea.

Competitors
The following is the list of number of competitors in the Games.

Archery
In the second time the nation competed in archery at the Olympics, Saudi Arabia entered two men. Once again, the Saudis only narrowly avoided constituting the bottom of the ranking. They placed 82nd and 83rd out of 84 archers.

Men

Athletics
Men's 3.000m Steeplechase
 * Mohammed al-Dosari
 * Heat — 8:45.25
 * Semi Final — 8:44.22 (→ did not advance)

Men's Javelin Throw
 * Abdul Azeem Al-Alawyat
 * Qualification — 56.32m (→ did not advance)


text:
User talk:Brainbrian1973

The Ricci Family
Don't post nonsense. RickK 04:33, Apr 25, 2005 (UTC)

title: User talk:Brainbrian1973


text:
Wikipedia:Articles for deletion/Franklin Roosevelt's Second Bill of Rights

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

Franklin Roosevelt's Second Bill of Rights
Transwiki to Wikisource. RickK 04:35, Apr 25, 2005 (UTC) Keep as is --- Do not delete FDR: is a powerful historical figure and should not be subject to revisionism -- is it POV or just the truth outside the POV of some
 * Strong Keep. Only the actual language of Roosevelt's statement belongs in Wikisource, but the discussion of the statement - it's place in history, implications, and consequences - is very much an encyclopedic topic. -- 8^D gab 06:42, 2005 Apr 25 (UTC)
 * Transwiki the current version, then rewrite and keep. — Sesel wa  15:19, 25 Apr 2005 (UTC)
 * Transwiki then rewrite (request, etc. as needed) per Sesel. Samaritan 15:59, 25 Apr 2005 (UTC)
 * Keep notable political philosophy. Klonimus 19:02, 25 Apr 2005 (UTC)
 * Comment: I like the idea of the transwiki, but what's left behind seems to contain a good deal of POV, so it needs to be cleaned up. — Stevie is the man!  Talk 19:08, 25 Apr 2005 (UTC)
 * Keep and cleanup/rewrite TigerShark 21:41, 25 Apr 2005 (UTC)
 * keep please because this topic is encyclopedic too Yuckfoo 01:13, 26 Apr 2005 (UTC)
 * Cleanup but Transwiki Roosevelt's statements to Wikisource. Zzyzx11 | Talk 05:42, 28 Apr 2005 (UTC)
 * I just added a few opening paragraphs to this article, but it still needs to be cleaned up to become an adequate stub. Zzyzx11 | Talk 05:42, 28 Apr 2005 (UTC)
 * Tranwiki the source text, neuter the POV and keep what's left. Notable part of history / political philosophy, especially in relation to e.g. the New Deal and etc. -- 128.227.194.46 06:14, 29 Apr 2005 (UTC)
 * Sorry, not logged in. -- Tetraminoe 06:15, 29 Apr 2005 (UTC)

 * This page is now preserved as an archive of the debate and, like some other VfD subpages, is no longer 'live'. Subsequent comments on the issue, the deletion, or the decision-making process should be placed on the relevant 'live' pages. Please do not edit this page.


text:
Maximal independent set

In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other words, there is no vertex outside the independent set that may join it because it is maximal with respect to the independent set property.

For example, in the graph $P3$, a path with three vertices $a$, $b$, and $c$, and two edges $\overline{ab}$ and $\overline{bc}$, the sets ${b}$ and ${a, c}$ are both maximally independent. The set ${a}$ is independent, but is not maximal independent, because it is a subset of the larger independent set ${a, c}.$ In this same graph, the maximal cliques are the sets ${a, b}$ and ${b, c}.$

A MIS is also a dominating set in the graph, and every dominating set that is independent must be maximal independent, so MISs are also called independent dominating sets.

A graph may have many MISs of widely varying sizes; the largest, or possibly several equally large, MISs of a graph is called a maximum independent set. The graphs in which all maximal independent sets have the same size are called well-covered graphs.

The phrase "maximal independent set" is also used to describe maximal subsets of independent elements in mathematical structures other than graphs, and in particular in vector spaces and matroids.

Two algorithmic problems are associated with MISs: finding a single MIS in a given graph and listing all MISs in a given graph.

Definition
For a graph $$G = (V, E)$$, an independent set $$S$$ is a maximal independent set if for $$v \in V$$, one of the following is true: The above can be restated as a vertex either belongs to the independent set or has at least one neighbor vertex that belongs to the independent set. As a result, every edge of the graph has at least one endpoint not in $$S$$. However, it is not true that every edge of the graph has at least one, or even one endpoint in $$S$$
 * 1) $$v \in S$$
 * 2) $$N(v) \cap S \neq \emptyset$$ where $$N(v)$$ denotes the neighbors of $$v$$

Notice that any neighbor to a vertex in the independent set $$S$$ cannot be in $$S$$ because these vertices are disjoint by the independent set definition.

Related vertex sets
If S is a maximal independent set in some graph, it is a maximal clique or maximal complete subgraph in the complementary graph. A maximal clique is a set of vertices that induces a complete subgraph, and that is not a subset of the vertices of any larger complete subgraph. That is, it is a set S such that every pair of vertices in S is connected by an edge and every vertex not in S is missing an edge to at least one vertex in S. A graph may have many maximal cliques, of varying sizes; finding the largest of these is the maximum clique problem.

Some authors include maximality as part of the definition of a clique, and refer to maximal cliques simply as cliques. The complement of a maximal independent set, that is, the set of vertices not belonging to the independent set, forms a minimal vertex cover. That is, the complement is a vertex cover, a set of vertices that includes at least one endpoint of each edge, and is minimal in the sense that none of its vertices can be removed while preserving the property that it is a cover. Minimal vertex covers have been studied in statistical mechanics in connection with the hard-sphere lattice gas model, a mathematical abstraction of fluid-solid state transitions.

Every maximal independent set is a dominating set, a set of vertices such that every vertex in the graph either belongs to the set or is adjacent to the set. A set of vertices is a maximal independent set if and only if it is an independent dominating set.

Graph family characterizations
Certain graph families have also been characterized in terms of their maximal cliques or maximal independent sets. Examples include the maximal-clique irreducible and hereditary maximal-clique irreducible graphs. A graph is said to be maximal-clique irreducible if every maximal clique has an edge that belongs to no other maximal clique, and hereditary maximal-clique irreducible if the same property is true for every induced subgraph. Hereditary maximal-clique irreducible graphs include triangle-free graphs, bipartite graphs, and interval graphs.

Cographs can be characterized as graphs in which every maximal clique intersects every maximal independent set, and in which the same property is true in all induced subgraphs.

Bounding the number of sets
showed that any graph with n vertices has at most 3n/3 maximal cliques. Complementarily, any graph with n vertices also has at most 3n/3 maximal independent sets. A graph with exactly 3n/3 maximal independent sets is easy to construct: simply take the disjoint union of n/3 triangle graphs. Any maximal independent set in this graph is formed by choosing one vertex from each triangle. The complementary graph, with exactly 3n/3 maximal cliques, is a special type of Turán graph; because of their connection with Moon and Moser's bound, these graphs are also sometimes called Moon-Moser graphs. Tighter bounds are possible if one limits the size of the maximal independent sets: the number of maximal independent sets of size k in any n-vertex graph is at most
 * $$\lfloor n/k \rfloor^{k-(n\bmod k)}\lfloor n/k+1 \rfloor^{n\bmod k}.$$

The graphs achieving this bound are again Turán graphs.

Certain families of graphs may, however, have much more restrictive bounds on the numbers of maximal independent sets or maximal cliques. If all n-vertex graphs in a family of graphs have O(n) edges, and if every subgraph of a graph in the family also belongs to the family, then each graph in the family can have at most O(n) maximal cliques, all of which have size O(1). For instance, these conditions are true for the planar graphs: every n-vertex planar graph has at most 3n − 6 edges, and a subgraph of a planar graph is always planar, from which it follows that each planar graph has O(n) maximal cliques (of size at most four). Interval graphs and chordal graphs also have at most n maximal cliques, even though they are not always sparse graphs.

The number of maximal independent sets in n-vertex cycle graphs is given by the Perrin numbers, and the number of maximal independent sets in n-vertex path graphs is given by the Padovan sequence. Therefore, both numbers are proportional to powers of 1.324718, the plastic ratio.

Sequential algorithm
Given a Graph G(V,E), it is easy to find a single MIS using the following algorithm:

 * 1) Initialize I to an empty set.
 * 2) While V is not empty:
 * 3) * Choose a node v∈V;
 * 4) * Add v to the set I;
 * 5) * Remove from V the node v and all its neighbours.
 * 6) Return I.

Random-selection parallel algorithm [Luby's Algorithm]
The following algorithm finds a MIS in time O(log n).

 * 1) Initialize I to an empty set.
 * 2) While V is not empty:
 * 3) * Choose a random set of vertices S ⊆ V, by selecting each vertex v independently with probability 1/(2d(v)), where d is the degree of v (the number of neighbours of v).
 * 4) * For every edge in E, if both its endpoints are in the random set S, then remove from S the endpoint whose degree is lower (i.e. has fewer neighbours). Break ties arbitrarily, e.g. using a lexicographic order on the vertex names.
 * 5) * Add the set S to I.
 * 6) * Remove from V the set S and all the neighbours of nodes in S.
 * 7) Return I.

ANALYSIS: For each node v, divide its neighbours to lower neighbours (whose degree is lower than the degree of v) and higher neighbours  (whose degree is higher than the degree of v), breaking ties as in the algorithm.

Call a node v bad if more than 2/3 of its neighbors are higher neighbours. Call an edge bad if both its endpoints are bad; otherwise the edge is good.
 * At least 1/2 of all edges are always good. PROOF: Build a directed version of G by directing each edge to the node with the higher degree (breaking ties arbitrarily). So for every bad node, the number of out-going edges is more than 2 times the number of in-coming edges. So every bad edge, that enters a node v, can be matched to a distinct set of two edges that exit the node v. Hence the total number of edges is at least 2 times the number of bad edges.
 * For every good node u, the probability that a neighbour of u is selected to S is at least a certain positive constant. PROOF: the probability that NO neighbour of u is selected to S is at most the probability that none of u's lower neighbours is selected. For each lower-neighbour v, the probability that it is not selected is (1-1/2d(v)), which is at most (1-1/2d(u)) (since d(u)>d(v)). The number of such neighbours is at least d(u)/3, since u is good. Hence the probability that no lower-neighbour is selected is at most 1-exp(-1/6).
 * For every node u that is selected to S, the probability that u will be removed from S is at most 1/2. PROOF: This probability is at most the probability that a higher-neighbour of u is selected to S. For each higher-neighbour v, the probability that it is selected is at most 1/2d(v), which is at most 1/2d(u) (since d(v)>d(u)). By union bound, the probability that no higher-neighbour is selected is at most d(u)/2d(u) = 1/2.
 * Hence, for every good node u, the probability that a neighbour of u is selected to S and remains in S is a certain positive constant. Hence, the probability that u is removed, in each step, is at least a positive constant.
 * Hence, for every good edge e, the probability that e is removed, in each step, is at least a positive constant. So the number of good edges drops by at least a constant factor each step.
 * Since at least half the edges are good, the total number of edges also drops by a constant factor each step.
 * Hence, the number of steps is O(log m), where m is the number of edges. This is bounded by $$O(\log(n))$$.

A worst-case graph, in which the average number of steps is $$\Theta(\log(n))$$, is a graph made of n/2 connected components, each with 2 nodes. The degree of all nodes is 1, so each node is selected with probability 1/2, and with probability 1/4 both nodes in a component are not chosen. Hence, the number of nodes drops by a factor of 4 each step, and the expected number of steps is $$\log_4(n)$$.

Random-priority parallel algorithm
The following algorithm is better than the previous one in that at least one new node is always added in each connected component:

 * 1) Initialize I to an empty set.
 * 2) While V is not empty, each node v does the following:
 * 3) * Selects a random number r(v) in [0,1] and sends it to its neighbours;
 * 4) * If r(v) is smaller than the numbers of all neighbours of v, then v inserts itself into I, removes itself from V and tells its neighbours about this;
 * 5) * If v heard that one of its neighbours got into I, then v removes itself from V.
 * 6) Return I.

Note that in every step, the node with the smallest number in each connected component always enters I, so there is always some progress. In particular, in the worst-case of the previous algorithm (n/2 connected components with 2 nodes each), a MIS will be found in a single step.

ANALYSIS:
 * A node $$v$$ has probability at least $$\frac{1}{d(v)+d(w)}$$ of being removed. PROOF: For each edge connecting a pair of nodes $$(v, w)$$, replace it with two directed edges, one from $$(v, w)$$ and the other $$(w, v)$$. Notice that $$|E|$$ is now twice as large. For every pair of directed edges $$(v, w)$$, define two events: $$(v \rightarrow w)$$ and $$(w \rightarrow v)$$, $$v$$ pre-emptively removes $$w$$ and $$w$$ pre-emptively removes $$v$$, respectively. The event $$(v \rightarrow w)$$ occurs when $$r(v) < r(w)$$ and $$r(v) < r(x)$$, where $$w$$ is a neighbor of $$v$$ and $$x$$ is neighbor $$w$$. Recall that each node is given a random number in the same [0, 1] range. In a simple example with two disjoint nodes, each has probability $$\frac{1}{2}$$ of being smallest. If there are three disjoint nodes, each has probability $$\frac{1}{3}$$ of being smallest. In the case of $$v$$, it has probability at least  $$\frac{1}{d(v)+d(w)}$$ of being smallest because it is possible that a neighbor of $$v$$ is also the neighbor of $$w$$, so a node becomes double counted. Using the same logic, the event $$(w \rightarrow v)$$ also has probability at least  $$\frac{1}{d(w)+d(v)}$$ of being removed.
 * When the events $$(v \rightarrow w)$$ and $$(w \rightarrow v)$$ occur, they remove $$d(w)$$ and $$d(v)$$ directed outgoing edges, respectively. PROOF: In the event $$(v \rightarrow w)$$, when $$v$$ is removed, all neighboring nodes $$w$$ are also removed. The number of outgoing directed edges from $$w$$ removed is $$d(w)$$. With the same logic, $$(w \rightarrow v)$$ removes $$d(v)$$ directed outgoing edges.
 * In each iteration of step 2, in expectation, half the edges are removed. PROOF: If the event $$(v \rightarrow w)$$ happens then all neighbours of $$w$$ are removed; hence the expected number of edges removed due to this event is at least $$\frac{d(w)}{d(v)+d(w)}$$. The same is true for the reverse event $$(w \rightarrow v)$$, i.e. the expected number of edges removed is at least $$\frac{d(v)}{d(w)+d(v)}$$. Hence, for every undirected edge $$(w, v)$$, the expected number of edges removed due to one of these nodes having smallest value is $$\frac{d(w)+d(v)}{d(w)+d(v)} = 1$$. Summing over all edges, $$\sum_{{v,w}\in E} 1= |E|$$, gives an expected number of $$|E|$$ edges removed every step, but each edge is counted twice (once per direction), giving  $$\frac{|E|}{2}$$ edges removed in expectation every step.
 * Hence, the expected run time of the algorithm is $$3 \log_{4/3}(m)+1$$ which is $$O(\log(n))$$.

Random-permutation parallel algorithm [Blelloch's Algorithm]
Instead of randomizing in each step, it is possible to randomize once, at the beginning of the algorithm, by fixing a random ordering on the nodes. Given this fixed ordering, the following parallel algorithm achieves exactly the same MIS as the (i.e. the result is deterministic):

 * 1) Initialize I to an empty set.
 * 2) While V is not empty:
 * 3) * Let W be the set of vertices in V with no earlier neighbours (based on the fixed ordering);
 * 4) * Add W to I;
 * 5) * Remove from V the nodes in the set W and all their neighbours.
 * 6) Return I.

Between the totally sequential and the totally parallel algorithms, there is a continuum of algorithms that are partly sequential and partly parallel. Given a fixed ordering on the nodes and a factor δ∈(0,1], the following algorithm returns the same MIS:

 * 1) Initialize I to an empty set.
 * 2) While V is not empty:
 * 3) * Select a factor δ∈(0,1].
 * 4) * Let P be the set of δn nodes that are first in the fixed ordering.
 * 5) * Let W be a MIS on P using the totally parallel algorithm.
 * 6) * Add W to I;
 * 7) * Remove from V all the nodes in the prefix P, and all the neighbours of nodes in the set W.
 * 8) Return I.

Setting δ=1/n gives the totally sequential algorithm; setting δ=1 gives the totally parallel algorithm.

ANALYSIS: With a proper selection of the parameter δ in the partially parallel algorithm, it is possible to guarantee that it finishes after at most log(n) calls to the fully parallel algorithm, and the number of steps in each call is at most log(n). Hence the total run-time of the partially parallel algorithm is $$O(\log^2(n))$$. Hence the run-time of the fully parallel algorithm is also at most $$O(\log^2(n))$$. The main proof steps are:
 * If, in step i, we select $$\delta = 2^i \log{(n)} / D$$, where D is the maximum degree of a node in the graph, then WHP all nodes remaining after step i have degree at most $$D / 2^i$$. Thus, after log(D) steps, all remaining nodes have degree 0 (since D<n), and can be removed in a single step.
 * If, in any step, the degree of each node is at most d, and we select $$\delta = C \log{(n)}/d$$ (for any constant C), then WHP the longest path in the directed graph determined by the fixed ordering has length $$O(\log(n))$$. Hence the fully parallel algorithm takes at most $$O(\log(n))$$ steps (since the longest path is a worst-case bound on the number of steps in that algorithm).
 * Combining these two facts gives that, if we select $$\delta = 2^i \log{(n)} / D$$, then WHP the run-time of the partially parallel algorithm is $$O(\log(D)\log(n)) = O(\log^2(n))$$.

Listing all maximal independent sets
An algorithm for listing all maximal independent sets or maximal cliques in a graph can be used as a subroutine for solving many NP-complete graph problems. Most obviously, the solutions to the maximum independent set problem, the maximum clique problem, and the minimum independent dominating problem must all be maximal independent sets or maximal cliques, and can be found by an algorithm that lists all maximal independent sets or maximal cliques and retains the ones with the largest or smallest size. Similarly, the minimum vertex cover can be found as the complement of one of the maximal independent sets. observed that listing maximal independent sets can also be used to find 3-colorings of graphs: a graph can be 3-colored if and only if the complement of one of its maximal independent sets is bipartite. He used this approach not only for 3-coloring but as part of a more general graph coloring algorithm, and similar approaches to graph coloring have been refined by other authors since. Other more complex problems can also be modeled as finding a clique or independent set of a specific type. This motivates the algorithmic problem of listing all maximal independent sets (or equivalently, all maximal cliques) efficiently.

It is straightforward to turn a proof of Moon and Moser's 3n/3 bound on the number of maximal independent sets into an algorithm that lists all such sets in time O(3n/3). For graphs that have the largest possible number of maximal independent sets, this algorithm takes constant time per output set. However, an algorithm with this time bound can be highly inefficient for graphs with more limited numbers of independent sets. For this reason, many researchers have studied algorithms that list all maximal independent sets in polynomial time per output set. The time per maximal independent set is proportional to that for matrix multiplication in dense graphs, or faster in various classes of sparse graphs.

Counting maximal independent sets
The counting problem associated to maximal independent sets has been investigated in computational complexity theory. The problem asks, given an undirected graph, how many maximal independent sets it contains. This problem is #P-hard already when the input is restricted to be a bipartite graph.

The problem is however tractable on some specific classes of graphs, for instance it is tractable on cographs.

History
The maximal independent set problem was originally thought to be non-trivial to parallelize due to the fact that the lexicographical maximal independent set proved to be P-Complete; however, it has been shown that a deterministic parallel solution could be given by an $$NC^1$$ reduction from either the maximum set packing or the maximal matching problem or by an $$NC^2$$ reduction from the 2-satisfiability problem. Typically, the structure of the algorithm given follows other parallel graph algorithms - that is they subdivide the graph into smaller local problems that are solvable in parallel by running an identical algorithm.

Initial research into the maximal independent set problem started on the PRAM model and has since expanded to produce results for distributed algorithms on computer clusters. The many challenges of designing distributed parallel algorithms apply in equal to the maximum independent set problem. In particular, finding an algorithm that exhibits efficient runtime and is optimal in data communication for subdividing the graph and merging the independent set.

Complexity class
It was shown in 1984 by Karp et al. that a deterministic parallel solution on PRAM to the maximal independent set belonged in the Nick's Class complexity zoo of $$NC_4$$. That is to say, their algorithm finds a maximal independent set in $$O(\log^4n)$$ using $$O((n/\log n)^3)$$, where $$n$$ is the vertex set size. In the same paper, a randomized parallel solution was also provided with a runtime of $$O(\log^4n)$$ using $$O(n^2)$$ processors. Shortly after, Luby and Alon et al. independently improved on this result, bringing the maximal independent set problem into the realm of $$NC_2$$ with an $$O(\log^2n)$$ runtime using $$O(mn^2)$$ processors, where $$m$$ is the number of edges in the graph. In order to show that their algorithm is in $$NC_2$$, they initially presented a randomized algorithm that uses $$O(m)$$ processors but could be derandomized with an additional $$O(n^2)$$ processors. Today, it remains an open question as to if the maximal independent set problem is in $$NC_1$$.

Communication and data exchange
Distributed maximal independent set algorithms are strongly influenced by algorithms on the PRAM model. The original work by Luby and Alon et al. has led to several distributed algorithms. In terms of exchange of bits, these algorithms had a message size lower bound per round of $$O(\log n)$$ bits and would require additional characteristics of the graph. For example, the size of the graph would need to be known or the maximum degree of neighboring vertices for a given vertex could be queried. In 2010, Métivier et al. reduced the required message size per round to $$O(1)$$, which is optimal and removed the need for any additional graph knowledge.

title: Maximal independent set


text:
Solomon Islands at the 1988 Summer Olympics

Solomon Islands sent a delegation to compete at the 1988 Summer Olympics in Seoul, South Korea from 17 September to 2 October 1988. This was the island nation's second time participating in a Summer Olympic Games, following their debut four years earlier. Solomon Islands competed at these games in track and field, archery, boxing, and weightlifting, with one competitor in each category. Only Benjamin Fafale, the weightlifter, completed an event final, finishing 22nd in the middleweight category.

Background
The National Olympic Committee of Solomon Islands was recognised by the International Olympic Committee on 31 December 1982. Having joined Olympic competition at the 1984 Summer Olympics, these Seoul Games were their second appearance at an Olympics. Solomon Islands competed at these games in track and field, archery, boxing, and weightlifting, with one competitor in each category. A second boxer was entered, but did not compete.

Competitors
The following is the list of number of competitors in the Games.

Archery
In the nation's Olympic archery debut, Solomon Islands was represented by one archer. Derrick Tenai was 20 years old at the time of these Olympics, and was making his Olympic debut. In the ranking round of the men's individual event, only the top 24 archers would advance to the second round. Tenai scored 505 points, which put him in 84th and last place, meaning he was eliminated.

Athletics
John Maeke was 26 years old at the time of these Olympics, and was making his only Olympic appearance. On 23 September, he took part in the first round of the Men's 10,000 metres, being drawn into heat two. He finished the race in a time of 35 minutes and 16.93 seconds, which was 22nd in the heat. As only the top eight in each heat, plus the next four fastest overall could advance to the finals, Maeke was eliminated. On 2 October, he failed to finish the men's marathon

Boxing
Tommy Bauro was 23 years old at the time of the Seoul Olympics, and was making his only Olympic appearance. On 21 September, he lost in the first round of the light heavyweight competition to Sione Vaveni Talia'uli of Tonga, due to a knockout in the first round. Basil Maelagi was listed in the official report of the Games, but did not compete, giving his opponent, Reiner Gies, a walkover in the first round of the light welterweight class on 19 September.

Weightlifting
Benjamin Fafale was 20 years old at the time of the Seoul Olympics, and was making his only Olympic appearance. He participated in the men's middleweight event on 22 September. In his three attempts at the snatch, he first lifted 80 kilograms, then failed at 85 kilograms, before using his third attempt to succeed at the same weight, making his final mark for that portion 85 kilograms, putting him in 24th place. In the clean and jerk, he lifted 100 and 105 kilograms in his first and second attempts, respectively. In his third attempt, he failed at lifting 107.5 kilograms, making his final mark for this portion of the event 105 kilograms, putting him in 22nd place. Fafale's final score for the event was 190 kilograms, which put him in 22nd place overall; the gold medal was won by Borislav Gidikov of Bulgaria with a mark of 375 kilograms.


text:
Talk:Isle Delfino

VfD
On April 12, 2005, this article was nominated for deletion. The result was redirect. See Votes for deletion/Isle Delfino for a record of the discussion. Mindspillage (spill yours?) 04:38, 25 Apr 2005 (UTC)

Article
After I has read the information above, I propose a "non-redirect" of the page. This since Isle Delfino, or parts of it atleast, has appeard in games such as Mario Power Tennis, Mario Kart: Double Dash!!, Mario Kart DS, Super Mario 64 DS and Super Smash Bros. Brawl. —Preceding unsigned comment added by 90.228.241.157 (talk) 21:35, 29 February 2008 (UTC)

title: Talk:Isle Delfino


text:
Category:Native American musicians

This is a category for musicians who are Native Americans in the United States. For indigenous musicians from other countries in the Americas, see Category:Indigenous musicians of the Americas.

title: Category:Native American musicians


text:
Canada at the 1988 Summer Olympics

Canada competed at the 1988 Summer Olympics in Seoul, South Korea, held from 17 September to 2 October 1988. 328 competitors, 223 men and 105 women, took part in 193 events in 23 sports. Most Canadians remember these Olympics for Ben Johnson, who won the gold medal and set a world record in the men's 100 metres, before being disqualified and his record deleted after he tested positive for stanozolol.

Competitors
The following is the list of number of competitors in the Games.

Archery
Canada was represented by three men and one woman in Seoul.

 * Men

 * Women

Athletics

 * Men
 * Track and road events

 * Field events

 * Combined events – Decathlon

 * Women
 * Track and road events

 * Field events

Basketball
Key:
 * Summary
 * OT – Overtime.

Men's tournament

 * Team roster

 * Group play

 * Quarterfinals

 * Classification round 5–8

 * Classification round 5/6

Canoeing

 * Men

 * Women

Cycling
Eleven cyclists, seven men and four women, represented Canada in 1988.

Road

 * Men

 * Women

Track

 * Sprint

 * Time trial

 * Points race

Diving

 * Men

 * Women

Fencing
18 fencers, 13 men and 5 women, represented Canada in 1988.

 * Individual
 * Pool stages

 * Elimination phase

 * Team

Men

 * Team

 * Individual

Women

 * Team

 * Individual

Hockey
Key:
 * Summary
 * FT – After full time.
 * P – Match decided by penalty-shootout.

Men's tournament

 * Team roster

 * Ross Rutledge (captain)
 * Nick Sandhu
 * Rick Albert
 * Patrick Burrows
 * Paul "Bubli" Chohan
 * Chris Gifford
 * Wayne Grimmer
 * Ranjeet Rai
 * Peter Milkovich
 * Trevor Porritt
 * Ian Bird
 * Doug Harris
 * Michael Muller
 * Pat Caruso
 * Ajay Dube (gk)
 * Ken Goodwin (gk)
 * Head Coach: Trevor Clark

 * Group play

 * Classification 9th-12th

 * 11th place match

Women's tournament
The women's field hockey team from Canada competed for the second time at the Summer Olympics.

 * Team roster

 * Sharon Bayes (gk)
 * Wendy Baker (gk)
 * Deb Covey
 * Lisa Lyn
 * Laura Branchaud
 * Sandra Levy
 * Kathryn Johnson
 * Melanie Slade
 * Penny Cooper
 * Shona Schleppe
 * Michelle Conn
 * Liz Czenczek
 * Sheila Forshaw
 * Nancy Charlton
 * Sara Ballantyne
 * Sharon Creelman
 * Head Coach: Marina van der Merwe

 * Group play

 * Classification 5th-8th place

 * Fifth place match

Modern pentathlon
Three male pentathletes represented Canada in 1988.

Rowing

 * Men

 * Women

Sailing

 * Men

 * Women

 * Open

Shooting

 * Men

 * Women

 * Mixed

Swimming

 * Men

 * Women

Synchronized swimming
Three synchronized swimmers represented Canada in 1988.

Table tennis

 * Men

 * Women

Tennis

 * Men

 * Women

Wrestling

 * Greco-Roman

 * Freestyle

title: Canada at the 1988 Summer Olympics


text:
Wikipedia:Cleanup Taskforce/Feynman diagram

Feynman diagram
(From Cleanup) Feynman diagram - Writing is poor and unclear, particularly in the "Mathematical details" section. Someone who understands what it's trying to say should fix it. RSpeer 05:14, Mar 20, 2005 (UTC)
 * Referred to Voltaire. · Katefan0(scribble) 04:41, Apr 25, 2005 (UTC)

"Mathematical details" worked on. I think this is much better, but the whole article is vague; and I'm a mathematician, not a physicist Septentrionalis 19:30, 29 Apr 2005 (UTC)

 * Added to User:DoomBringer/Desk since this hasn't been updated for over a month. -- Beland 2 July 2005 03:43 (UTC)
 * I've gone over the article as best as I can. I wish I knew more about the subject, but it is a bit too complicated.  I cleaned up some links and what grammar I could.  I have a slight grasp of what it is getting at, though.  It would take many weeks of reading each of the links to be able to go any further, I guess. It looks decent enough, though.  DoomBringer 04:48, 12 July 2005 (UTC)

I removed cleanup and tagged it expert and it looks like it's already attracted one. Can probably be closed. -- Beland 03:24, 28 July 2005 (UTC)


text:
User talk:Acidkidd

Hello Acidkidd, welcome to Wikipedia. You might like to start by reading the tutorial and introducing yourself at the new users page. If you upload any more images, please add the appropriate Image copyright tags to them. For example, if you upload an album cover which you believe is fair use, you should add to the Image description page. If you have any questions, please let me know on my talk page. Angela. 04:42, Apr 25, 2005 (UTC)

Non-free use disputed for Image:WindmillSessions.jpg
Thanks for uploading Image:WindmillSessions.jpg. However, there is a concern that the rationale you have provided for using this image under "fair use" may be invalid. Please read the instructions at Non-free content carefully, then go to the image description page and clarify why you think the image qualifies for fair use. Using one of the templates at Fair use rationale guideline is an easy way to ensure that your image is in compliance with Wikipedia policy, but remember that you must complete the template. Do not simply insert a blank template on an image page.

If it is determined that the image does not qualify under fair use, it will be deleted within a couple of days according to our Criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you.BetacommandBot 12:16, 6 July 2007 (UTC)

title: User talk:Acidkidd


text:
Amy Yasbeck

Amy Marie Yasbeck (born September 12, 1962) is an American actress. She is best known for her role as Casey Chappel Davenport on the sitcom Wings from 1994 to 1997, and for having played the mermaid Madison in the television film Splash, Too in 1988 (the role originated by Daryl Hannah in the film Splash). She has guest starred in several television shows and appeared in the films House II: The Second Story, Pretty Woman, Problem Child, Problem Child 2, The Mask, Robin Hood: Men in Tights, and Dracula: Dead and Loving It.

Early life
Yasbeck was born in Blue Ash, Ohio, the daughter of Dorothy Louise Mary (née Murphy), a homemaker, and John Anthony Yasbeck (جون أنتوني يَزبك), a butcher and grocery store owner. Her father was of Lebanese descent, while her mother was of Irish ancestry. As a child, Yasbeck was featured on the package art for the Betty Crocker Easy-Bake Oven. Years later, in 2000, she was presented with a new Easy-Bake Oven on the show I've Got a Secret, for which she was a regular panel member.

She spent her primary and secondary years at two different Catholic schools: Summit Country Day School and Ursuline Academy. She then enrolled in the theater program at the University of Detroit but didn't graduate. In 1983, after the deaths of both of her parents, her father from a heart attack and her mother from emphysema, Yasbeck moved to New York City.

Career
Early into her acting career, she appeared in Rockhopper, an unsold television pilot from 1985. Yasbeck has had guest-starring roles in many television shows, including Dallas, Spies, Werewolf, J.J. Starbuck, Magnum, P.I., China Beach, and Murphy Brown. She auditioned for the role of Elaine Benes on Seinfeld. She played Olivia Reed for four months between 1986 and 1987 on the long-running daytime drama Days of Our Lives. She also played the starring role of the mermaid Madison in the Disney television film Splash, Too in 1988 (the role of Madison was originated by Daryl Hannah in the 1984 film Splash). Yasbeck also had starring roles in the sitcoms Wings, Alright Already, and Life on a Stick and in movies such as House II: The Second Story, Pretty Woman, Problem Child, Problem Child 2, and The Mask. She has twice worked with Mel Brooks: in 1993's Robin Hood: Men in Tights and 1995's Dracula: Dead and Loving It.

Yasbeck also appeared once on the hit DCOS That's So Raven as the mother of the character Chelsea. The episode originally aired on September 22, 2006.

In late 2007, plans surfaced of a potential That's So Raven spin-off featuring Yasbeck and Anneliese van der Pol, who portrayed her daughter, with occasional appearances by Raven-Symoné. The show was scrapped due to van der Pol signing onto a Broadway play, and Yasbeck wanting to take a break from acting to focus on her family.

She was a contestant on the syndicated version of Are You Smarter than a 5th Grader? in 2010.

Personal life
Yasbeck is the widow of actor John Ritter, with whom she had worked in several projects. She first met him at director Dennis Dugan's house during a read-through of their film Problem Child.

Yasbeck and Ritter also starred together in Problem Child 2 (1991) and guest-starred together in an episode of The Cosby Show that aired in 1991. Ritter also guest-starred on Wings as Yasbeck's estranged husband in the season-seven episode "Love Overboard". The couple had a child together in 1998, and they married the following year on September 18, 1999, at the Murphy Theatre in Wilmington, Ohio.

On September 11, 2003, Ritter experienced chest pain and extreme nausea while rehearsing for 8 Simple Rules for Dating My Teenage Daughter. He was taken to the hospital by paramedics. Initially, Ritter was thought to be suffering a heart attack. At 10:48 that night, Ritter died. The cause of death was later determined to be an aortic dissection stemming from a previously undiagnosed congenital heart defect.

Yasbeck gave her blessing to the continuation of the sitcom, as 8 Simple Rules, where it was ultimately decided that Katey Sagal's character would assume the lead role as a widow.

Yasbeck appeared on Larry King Live on June 16, 2008, to discuss heart disease.

On the September 5, 1990, episode of The Tonight Show Starring Johnny Carson, she said that her "great-great-great uncle" Charles Webb Murphy was the owner of the Chicago Cubs during their 1907 and 1908 championships.

Wrongful death lawsuit
After John Ritter's death, Yasbeck filed a $67 million wrongful death lawsuit against Providence Saint Joseph Medical Center and several doctors who treated him, alleging they misdiagnosed his condition and contributed to his death. Several of the defendants settled out of court for a total of $14 million, including Providence St. Joseph, which settled for $9.4 million. On March 14, 2008, a jury split 9–3 in favor of the doctors, clearing the physicians of any wrongdoing.

title: Amy Yasbeck


text:
Turkey at the 1988 Summer Olympics

Turkey competed at the 1988 Summer Olympics in Seoul, South Korea.

Competitors
The following is the list of number of competitors in the Games.

Archery
In its second Olympic archery competition, Turkey was represented by three men and three women.

Women's Individual Competition:
 * Huriye Eksi – Preliminary Round (→ 41st place)
 * Elif Eksi – Preliminary Round (→ 42nd place)
 * Selda Unsal – Preliminary Round (→ 50th place)

Men's Individual Competition:
 * Vedat Erbay – 1/8 final (→ 22nd place)
 * Kerem Ersu – Preliminary Round (→ 34th place)
 * Izzet Avci – Preliminary Round (→ 61st place)

Women's Team Competition:
 * Eksi, Eksi, and Unsal – Preliminary Round (→ 14th place)

Men's Team Competition:
 * Erbay, Ersu, and Avci – Preliminary Round (→ 14th place)

Athletics

 * Men
 * Track and road events

Swimming
Men's 50m Freestyle
 * Murat Tahir
 * Heat – 24.64 (→ did not advance, 42nd place)
 * Hakan Eskioğlu
 * Heat – 25.24 (→ did not advance, 50th place)

Men's 100m Freestyle
 * Murat Tahir
 * Heat – 53.27 (→ did not advance, 44th place)
 * Hakan Eskioğlu
 * Heat – 53.95 (→ did not advance, 52nd place)

Men's 200m Freestyle
 * Hakan Eskioğlu
 * Heat – 1:58.45 (→ did not advance, 52nd place)

Men's 200m Individual Medley
 * Hakan Eskioğlu
 * Heat – 2:14.32 (→ did not advance, 52nd place)

title: Turkey at the 1988 Summer Olympics


text: User talk:70.189.156.46

title: User talk:70.189.156.46


text:
Talk:Perchloric acid

Perchlorates versus chlorates
"However, it is strange that perchlorates are even weaker oxidizing agents than chlorates."

How is this strange? AIUI, the perchlorate (ClO4) has a net noble gas electron configuration, making it relatively stable; the chlorate (ClO3), has a less stable electron configuration, and is therefore more reactive, despite having fewer oxygen atoms. I plan to remove / change this sentence in the near future if there are no objections. Evand 04:44, 25 Apr 2005 (UTC)

pKa Inconsistencies
This page lists the pKa of Perchloric acid as -7.00 ... however, the acid dissociation constant page lists it as -10.00. Additionally, the acid dissociation page and main page for Hydrochloric acid list that compound's pKa as -8.00, suggesting that Perchloric acid's pKa on this page might be inaccurate. --gabe 21:07, 22 September 2006 (UTC)
 * According to CRC Handbook of Chemistry and Physics, 87th edition the pKa of Perchloric acid is -1.6 (8-14). The same numeric value is given by Lange's Handbook of Chemistry, 15th edition. An older (1985) German Textbook (Hollemann-Wiberg, Lehrbuch der Anorganischen Chemie) states pKa=-10. I will try to get more info on that.--Xenofonos 20:14, 26 October 2007 (UTC)

Its been years since this issue has been mentioned, but it needs to be resolved. There are currently two different pKa values given for perchloric acid: -8 and -10. Both are sourced, but I have no way of knowing under what circumstances the pKa was measured since they're offline sources. I looked around online and most sources put the pKa as -7.3, -8, or -10. My guess is that they are referring to the pKa values at different temperatures. In the event that a clear answer is not found, then I recommend listing both pKa values together and stating that the pKa is somewhere in between. Obviously this is undesirable; let's try to find out what is causing reports of different pKa values. Explodo-nerd (talk) 03:11, 16 January 2012 (UTC)
 * Negative pKa's are generally not very accurate because they come from extrapolations from non-aqueous solvents, theoretical calculations, or who knows where. It is common to find wildly different values being published, and most textbooks just copy the same number over and over without a lot of clarity regarding the origin of the number. So, unless there is a reasonably recent publication that does an explicit, critical analysis of the pKa of perchloric acid and provides solid ground for a recommended value, I think there's not much we can do in terms of choosing the "right" pKa. We can provide more than one value, citing the sources, and let the reader decide. --Itub (talk) 22:49, 16 January 2012 (UTC)

Other
the statement "organic material such as cloth or wood" is functionally, nearly useless. i believe but am not certain that sugar polymers, i.e. cellulose are the primary concern, what is the interaction of poly-aromatic hydrocarbons, i.e. naphthalene. what is the interaction of acetylene, experience says that this is not particularly hazardous. User:Figo —Preceding unsigned comment added by 216.21.137.27 (talk) 21:52, 13 May 2008 (UTC)

No thermochemistry data (delta-H, delta-S, Gibbs)
please add. — Preceding unsigned comment added by Riventree (talk • contribs) 21:01, 12 July 2012 (UTC)

70% ???
This may be a silly question, but 70% perchloric acid means what? 70% by weight, by volume, by mole ratio? — Preceding unsigned comment added by 152.2.174.204 (talk) 20:01, 18 February 2016 (UTC)
 * Definitely not silly question. I inserted that it is 70% by weight, since I have not heard of %mole ratio and dont think that volume % make sense either.--Smokefoot (talk) 00:05, 19 February 2016 (UTC)

Explodes when contacts with organics?
It's widely said that perchloric acid will make an explosion when reacts with organics.And there are also many disasters about perchloric acid explosion.However,if perchloric is so dangerous like this,then who would dare to use it?Or these dangers are exaggerated? 小小小硝酸 (talk) 19:29, 5 October 2018 (UTC)
 * It can explode with organic compounds, but it usually does not. --Smokefoot (talk) 20:37, 5 October 2018 (UTC)

title: Talk:Perchloric acid


text:
Wickham Steed

Henry Wickham Steed (10 October 1871 – 13 January 1956) was an English journalist and historian. He was editor of The Times from 1919 to 1922.

Early life
Born in Long Melford, England, Steed was educated at Sudbury Grammar School and the universities of Jena, Berlin and Paris. While in Europe, he demonstrated an early interest in social democracy and met with a range of left-wing figures, including Friedrich Engels, Wilhelm Liebknecht, August Bebel, and Alexandre Millerand. His encounters formed the basis of his first book, The Socialist and Labour Movement in England, Germany & France (1894).

Foreign correspondent
Appointed by Joseph Pulitzer as Paris correspondent for the New York World, Steed joined The Times in 1896 as a foreign correspondent, working briefly out of Berlin before transferring successively to Rome (1897–1902) and then Vienna (1902–1913). In 1914, he moved to London to take over as foreign editor of The Times. During his time in Vienna he acquired a deep contempt for Austria-Hungary. An anti-Semite and a Germanophobe, in an editorial conference of The Times on 31 July 1914, Steed labelled efforts to stop the impending war as "a dirty German-Jewish international financial attempt to bully us into advocating neutrality". From 22 July 1914, Steed, in close agreement with The Times' proprietor, Lord Northcliffe, took a very bellicose line, and in editorials written on 29 and 31 July, Steed urged that the British Empire should enter the coming war.

Seen as a leading expert on Eastern Europe, Steed's views had much influence with decision-makers such as high-level bureaucrats and Cabinet politicians in the First World War and its aftermath. During the war, Steed befriended anti-Habsburg émigrés such as Edvard Beneš, Ante Trumbić, Tomáš Masaryk and Roman Dmowski and advised the British government to seek the liquidation of Austria-Hungary as a war aim. In particular, Steed was a very strong advocate of uniting all of the South Slavic peoples, such as the Croats, the Serbs and the Slovenes, into a federation, to be called Yugoslavia. The British Ambassador to Italy claimed in a diplomatic dispatch that Steed's fondness for the Yugoslav concept derived from a relationship that he maintained for a number of years "filially I believe rather maritally" with a Slavic woman from the Balkans. In October 1918, Steed met with Serbian Prime Minister Nikola Pašić to gain his support for the Yugoslav concept but was deeply angered when he learned that Pašić saw the new state as merely as extension of Greater Serbia and had no intention of sharing power with the Croats or the Slovenes. Steed charged Pašić with being a new "sultan" and severed his friendship with him.

Editor of The Times
When the editor of The Times, Geoffrey Dawson, resigned from his post in February 1919, Steed was Northcliffe's first choice to succeed him. Steed had worked closely with Northcliffe during the war, becoming an adviser to him on foreign affairs. Steed was forced to contend with Northcliffe throughout most of his tenure as editor, as the press baron retained considerable control over the affairs of the newspaper.

After the war, Steed strongly disapproved of the Bolshevik regime in Russia. In an editorial written in another Northcliffe paper, the Daily Mail on 28 March 1919, Steed accused the British Prime Minister David Lloyd George, whom Steed detested, of betraying the White Russians because of a plot by "international Jewish financiers" and the Germans to help the Bolsheviks stay in power.

In 1920, Steed endorsed as genuine a notorious anti-Semitic forgery, The Protocols of the Learned Elders of Zion, writing in an editorial in The Times in which he blamed the Jews for World War I and the Bolshevik regime and called them the greatest threat to the British Empire. However, he retracted his view on the Protocols in 1921, when his paper's Constantinople correspondent proved them to be a forgery.

Steed was Northcliffe's personal choice for the editorship, but by 1922, the press baron was increasingly frustrated by Steed's failure to return The Times to profitability. After Northcliffe's death in August 1922, the new owners, John Jacob Astor and John Walter, dismissed Steed on 24 October and brought back Dawson as editor.

Final years
In 1923, Steed became editor of Review of Reviews (1923–30), the journal established by William Thomas Stead in 1890. In the early 1930s, he was one of the first English speakers to express alarm about the new German dictatorial chancellor, Adolf Hitler. In 1934, he caused sensation with an article claiming to have evidence of secret German experiments in airborne biological warfare. The British government was sufficiently alarmed to start stockpiling vaccines although a retrospective analysis by the epidemiologist Martin Hugh-Jones has suggested that Steed's evidence could not have amounted to much. On the title page of his 1934 work, Hitler Whence and Whither?, Steed is described as a lecturer in Central European History at King's College London.

He died in Wootton, West Oxfordshire.

In popular culture
Steed, played by actor Andrew Keir, appears in the 1974 miniseries Fall of Eagles, bringing a rumour of the impending Bosnian crisis to the attention of King Edward VII, Georges Clemenceau, and Alexander Izvolsky.

Works

 * The Habsburg Monarchy (1913)
 * A Short History of Austria-Hungary and Poland (1914)
 * Through Thirty Years, 1892-1922: A personal narrative (1924)
 * Journalism (1928)
 * The Real Stanley Baldwin (1930)
 * The Antecedents of Post-war Europe (1932)
 * A Way to Social Peace (1934)
 * Hitler Whence and Whither? (1934)
 * The Meaning of Hitlerism (1934)
 * Vital Peace: A study of risks (1936)
 * The Doom of the Habsburgs (1937)
 * The Press (1938)
 * Our War Aims (1939)

title: Wickham Steed