text:
Castle of Guimarães

The Castle of Guimarães (Castelo de Guimarães) is the principal medieval castle in the municipality Guimarães, in the northern region of Portugal. It was built under the orders of Mumadona Dias in the 10th century to defend the monastery from attacks by Moors and Norsemen.

The castle is a military fortification grounded primarily in the late Romanesque period, and elaborated during the early Gothic epoch of Portuguese architecture. Its area is delineated by walls forming a pentagram, similar to a shield, that includes eight rectangular towers, military square and central keep. Originating in the foundations of a Roman structure, from the writings of Alfredo Guimarães, it was later elaborated on the French model, in its current the form of a shield, with reduced central yard and difficult accesses. It includes several Gothic characteristics, owing to its remodelling at the end of the 13th century, when the keep and residences were constructed (possibly over pre-existing structures).

Early history
Emblematic of the medieval Portuguese castle, Guimarães is associated with the origins of the Portuguese nation. Yet, the phases and organization involved in its construction, from the 10th century onwards is very deficient, with many of its present structure resulting from its reconstruction in the second half of the 13th century. The examination of its walls and remains led Carlos A. F. de Almeida to proclaim, for example, that the flanking towers were constructed during the late Romanesque, early Gothic period.

In the second half of the 10th century, owing to the death of Count Hermenegildo Gonçalves, the property of Vimaranes (today Guimarães) was inherited by his daughter Oneca. Countess Mumadona Dias, the count's widow, traded her property in Creiximir for the land in Vimaranes, and ordered the construction of a monastery situated on land today occupied by the Collegiate and Church of Nossa Senhora da Oliveira (PT010308340007). Later, in order to defend the curate at the monastery, the countess ordered the construction of the castle. By 4 December 968, a codicil, the countess referred to the castle (then designated as the Castle of São Mamede) as just having been constructed, in order to defend the friars and nuns in the monastery. At the end of the 10th century, Dias's eldest son, Gonçalo Mendes, takes possession of the lands following her death and maintaining her wishes to support the monastery. But, Gonçalo Muniuz, son of Múnio (fourth son of Mumadona Dias) attempted to seize the town and castle, but he was impeded by his uncle Gonçalo, then family patriarch. These family squabbles continued, when Ordonho Ramírez, great-grandson of Mumadona, took the castle and town, later bequeathing them to his daughter Mumadona, on her marriage to Fernando Gundemáriz, son of Gundemaro Pinióliz. The town and castle were eventually sold to Gontrode Ordonhes, the other daughter of Ordonho Ramírez and sister-in-law of Fernando Gundemáriz who was married to Mendo Folienz, who eventually donated the monastery in 1045 to the curate.

Medieval Era
At the end of the 11th century the castle was heavily expanded and remodeled, under the direction of Count Henry, to act as his residence. The vestiges of the work are found near the entrance, and includes consisting of five rows of large ashlars, defining an arched wall, that were part of bastion between granite outcrops, within a castle with walled courtyard. The fortress, then over a century old, needed renovation. The nobleman chose to destroy what remained from Mumadona's construction, while extending the area of the castle and adding two entrances. The castle became the official royal residence from 1139, when Portugal became independent from the Kingdom of León, until circa 1200. It was at this residence that Afonso Henriques was born in 1111, living his life in the castle, which became the residence of the Counts of Portucale.

Following years of family rivalries, in 1128, the Battle of São Mamede (fought within the fields of the same name) gave origin to the independence of Portucale and the formation of the nucleus of what would become Portugal. Between the end of the 13th and beginning of the 14th century, the castle was remodelled by King Denis, resulting in the form that stands to this day. The alcalde Mem Martins de Vasconcelos, siding with the king, resisted the siege by the Infante D. Afonso. In 1369, King Henry II of Castile invaded Portugal and encircled the castle of Guimarães, but was defeated by its population and forces loyal to then-alcaide Gonçalo Pais de Meira. Yet, several years (1385) King John I encircled the castle, and it was the alcaide Aires Gomes da Silva, supporter of Beatriz, who defended its walls. Sometime between 1383 and 1433, the two towers that flank the main entrance were order built by King John I of Portugal.

In 1653, the town prosecutors of Guimarães within the Cortes petitioned "it was worth the village castle, the most sumptuous of the kingdom, which is becoming ruined, and if care is not taken, will become completely ruined, at the cost of the alcalde's rents. And the walls, also the best in the kingdom, if they are not repaired, will fall into ruin, equally the two towers without a little repair." Yet, by 1793, Alberto Vieira Braga referred to the "inutility" of the walls that circled the town, owing to their state of ruin. This changes marked the slow decline of the structure as a defense fortification.

By 1836, the councilmen of Guimarães were already looking to demolition the castle, and reuse the stone to repave the roadways. A member of the Sociedade Patriótica Vimaranense (Patriotic Society of Guimarães) defended the demolition of the castle, and suggested the use of its stones to pave the streets of Guimarães, as the fortress had been used as a political prison during the reign of King Miguel. However, this was never accepted. 45 years later, on 19 March 1881, the Diário do Governo (Official Journal) listed the Guimarães Castle as the most unusual historic monument of the whole region of Minho. After the castle's demolition was abandoned in the 19th century, many of the houses, estates and lodgings around the castle were expropriated.

The first attempts at restoration occurred during the mid-20th century, specifically in 1936. In 1910, the castle was declared a national monument. In 1937, the General Service for National Buildings and Monuments started its restorations. The structure was re-inaugurated on 4 June 1940, on the occasion of the centenary of the castle.

On 20 April 1952, a special protection zone was established that included the castle, Church of São Miguel and the Palace of the Dukes of Braganza. Further elaboration of a plan for the area was completed within the 1957 landscaping of the area around the chapel by Viana Barreto.

In the course of installing new electrical systems at the castle, a medieval well was discovered.

On 1 June 1992, the building became the property of the Instituto Português do Património Arquitetónico (IPPA), under decree 106F/92 (Diário da República, Série 1A, 126). Further excavations in 2004, in the castle interior allowed the dating of structures to 10th century.

Architecture
The castle is located within the northern limits of the urban area of Guimarães, isolated on a small hill formed from granite, and encircled by a small forest park, accessed by several pedestrian trails. Alongside the southern tower is a bronze medallion of D. Afonso Henriques, over a large rock. In the vicinity, on the hillside, is the Romanesque church of São Miguel do Castelo (PT010308340006), the Palace of the Dukes of Braganza (PT010308340013) and some sections of wall (PT010308340016) that surrounded the city, and that were originally integrated into the castle.

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

title: Castle of Guimarães


text: User talk:70.51.133.246

title: User talk:70.51.133.246


text:
Jayapataka Swami

Jayapataka Swami ; born on April 9, 1949) is a Vaishnava swami and a religious leader for the International Society for Krishna Consciousness (ISKCON).  He is a senior disciple of A. C. Bhaktivedanta Swami Prabhupada. In 2004 he was one of the initiating spiritual masters, (ISKCON Gurus), a member of the Governing Body Commission (GBC), and a divisional trustee for the Bhaktivedanta Book Trust (BBT). He is one of the senior-most sannyasis in the Hare Krishna movement.

Honorifics

 * His Holiness
 * Maharaja
 * Guru Maharaj

Early years
Jayapataka Swami was born in Milwaukee, Wisconsin as Gordon John Erdman II to Gordon John Erdman and Lorraine Erdman (Golich). He attended St. John's Northwestern Military Academy and Brown University. There, as a fresh enrollee, he was influenced by a guest lecture on the life of Buddha that he lost all interest in his studies and began searching for a spiritual teacher. After some time of searching he concluded he would have to go to India to find his teacher.

Before leaving for India, Gordon came across some Hare Krishna devotees, doing kirtan and distributing Back To Godhead magazine. Shortly after he visited the San Francisco ISKCON center, where he met Jayananda das who introduced him to the Ratha Yatra festival. His first service in ISKCON was to help build the Ratha Cart. From there he travelled to Montreal, Quebec, Canada where he met Srila Prabhupada. John took first initiation in Montreal, Quebec, Canada and was given the name 'Jayapataka dasa'. Soon after he was awarded 2nd initiation in New York.

While in Montreal, Jayapataka dasa was engaged in the service of printing books and dispatching them to other ISKCON temples around the world. Later, on the instruction of Srila Prabhupada, Jayapataka went to Toronto to open a temple there. When Jayapataka dasa took over the Toronto center as president he wrote to Srila Prabhupada enquiring about his service and was told by him to go to India.

title: Jayapataka Swami


text: User talk:207.200.116.8

title: User talk:207.200.116.8


text:
Talk:John Neumann

Nationality
Was he Czech? --Sheynhertz-Unbayg 22:10, 27 May 2005 (UTC)

 * AFAIK his mother was Czech and his father German (German-speaking Bohemian). Qertis 09:26, 28 May 2005 (UTC)

 * He was born in what is now the Czech Republic — Preceding unsigned comment added by 87.235.14.181 (talk) 20:04, 9 December 2012 (UTC)
 * Given the history of Eastern Europe, that is no indicator of ethnicity. Daniel the Monk (talk) 23:32, 9 December 2012 (UTC)

Saint Peter's Parish
The section is dedicated to "institutions that bear his name."

I previously integrated the content into the "Bishop of Philadelphia" text, but if you think that's not sufficient, I encourage you to add a new section listing schools and parishes he founded. (In fact, I think that would be a very valuable addition.)Vordabois (talk) 06:36, 31 January 2008 (UTC)

 * I wonder if there is a list of schools that bear his name. I know of at least five, but would be curious if that is worthy of noting on this page.  I will leave that to the experts. CodeCarpenter (talk) 21:31, 5 February 2009 (UTC)

St. John Neumann Shrine Photo
Bold textI would like to point out that the photograph of St. John Neuman's holy remains in the section about his canonization is outdated. As of the early 2000's new vestments were given to his remains and the Shrine itself has been renovated. I would like to add a updated photo, however, I don't know where to find recent photo that is public domain. Therefore, I hope someone who has such a photograph would be happy to share it with the article. Thank you.DenitaArnold (talk) 19:02, 20 August 2011 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 2 external links on John Neumann. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20150919073454/http://www.staugustinechurch.org/index.php/history3 to http://www.staugustinechurch.org/index.php/history3
 * Added archive https://web.archive.org/web/20140419143044/http://www.redemptorists.net/saints-neumann.cfm to http://www.redemptorists.net/saints-neumann.cfm

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

Cheers.— InternetArchiveBot  (Report bug) 14:38, 10 December 2017 (UTC)

Fifth bishop
According to catholic-hierarchy.org, St. John is the fifth, not the fourth, bishop of Philadelphia. Caeruleancentaur (talk) 21:22, 5 January 2018 (UTC)
 * Michael Egan (1808-1814), Henry Conwell (1819-1841), Francis Kenrick (1842-1851), John Neumann (1852-1860). Between Egan and Conwell, Catholic Hierarchy includes Ambrose Marechal and Louis de Barth. At the time of Egan's death, Philadelphia was in the midst of the trusteeism controversy and nobody really wanted it. James McNeal, in the Catholic Encyclopedia, says that Marechal was nominated, but requested the nomination be withdrawn. De Barth was Egan's vicar general and upon Egan's death Carroll made him apostolic administrator to hold the fort, and De Barth didn't even want that. It does not appear that either Marechal or De Barth were ever formally consecrated Bishop of Philadelphia. Conwell was vicar general of Armagh and over seventy. When he was not appointed to succeed there, he was offered as a consolation prize either Philadelphia or Madras. He chose Philadelphia, but had no idea what he was walking into. Mannanan51 (talk) 20:39, 19 January 2019 (UTC)

title: Talk:John Neumann


text:
Samuel Smith Old Brewery

Samuel Smith Old Brewery, popularly known as Samuel Smith's or Sam Smith's, is an independent, British brewery and pub operator based in Tadcaster, North Yorkshire that traces its origins to 1758, and claims to be Yorkshire's oldest brewery.

It is known for being traditionally run, still using dray horses for some beer deliveries, and banning music, television and mobile devices in its bars.

History
Tadcaster had been a centre for brewing since the 14th century because of its gypsum rich wells. The Old Brewery was established as the Backhouse & Hartley Brewery in 1758.

In 1847, John Smith supported by his father, a butcher and cattle dealer from Meanwood, purchased it and built his new John Smith's Brewery close by. John Smith's brother William, who ran the business after John's death in 1879, left the Old Brewery to his nephew Samuel in 1886. However, Samuel inherited an empty building and well, with all equipment having been moved next door. Nevertheless, he refitted and opened his brewery.

Samuel Smith traditional bottled beer styles influenced American craft brewers such as Goose Island and Brooklyn Brewery in the late 1970s and early 1980s.

The Old Brewery

The Old Brewery is the smallest of three current Tadcaster breweries and one of the few remaining British breweries to employ a traditional, 19th century, Yorkshire Square fermentation system constructed of Welsh slate.

Brewing water for ales and stouts is drawn from the original 85 ft well, sunk when the site was established in 1758, and the fermentation yeast has been used continuously since approximately 1900, making it one of the oldest unchanged strains in the country.

The brewery's team of dapple-grey shire horses are among the last working dray horses in the world and deliver beer around Tadcaster.

Beers

Since discontinuing Museum Ale in the early 1990s, Samuel Smith's has brewed only one cask beer, Old Brewery Bitter (OBB). This is unusual in the British brewing industry, as most brewers will either produce a range of real ales or none at all.

The brewery produce a range of conditioned beers. All, with the exception of Old Brewery Bitter and Yorkshire Stingo, are vegan.

In the United States, Samuel Smith's bottled beers are imported by Merchant du Vin. In Norway, by Strag AS.

Samuel Smith's Organic Cider is available in bottles, while Cider Reserve is sold on draught in the UK. The brewery offers two draught milds, Dark Mild and Light Mild. The brewery used to produce a super strength Barley Wine called Strong Golden at 10.2%. A range of bottled fruit beers are available, flavoured with cherry, apricot or raspberry.

Best Bitter and Sovereign are the brewery's keg bitters. It introduced Double Four in late 2013, a 4% standard strength lager between Alpine (2.8%) and Taddy Lager (4.5%). A wheat beer has been added to the draught product range, although few pubs stock it.

Until 2006, Samuel Smith's used the brand name Ayingerbräu for its lagers and wheat beers, from the Ayinger Brewery. The pump for Ayingerbräu Lager featured a model of a Bavarian "man in a box".

Pubs
Samuel Smith's operates over 200 pubs, including 20 in central London, which are maintained traditionally. Most have multiple bar rooms, often with a spartan public bar and plusher lounge. Many have frosted windows and stained glass decorations. The interiors often have either brown or beige painted walls, or elaborate wall paper. Some have notable interiors such as the Crown Inn in Wetherby which has furniture by Robert Thompson or the Princess Louise in High Holborn with booths around the bar.

The brewery still delivers multiple-trip, reusable bottles in beer crates.

The pubs only sell the brewery's own branded products.

Controversies
The GMB trade union has criticised the brewery for its dismissal of pub managers.

2000
The "publicity-shy" company began to remove branding, making its public houses distinctive by their limited signage or artwork.

2004
The brewery banned music and televisions in its pubs, saving it from paying PRS fees.

2009
The brewery is a major landowner in Tadcaster and concerns were expressed in an edition of BBC Inside Out about its long-term empty properties, and excessive influence in the town.

2010
The brewery took legal action against Cropton Brewery over the latter's use of the Yorkshire white rose design for its Yorkshire Warrior beer. Mr Justice Arnold ordered Cropton to remove the emblem but criticised both breweries for not settling the matter sooner.

2011

On New Year's Eve 2011, the brewery closed the Junction Inn in Royton because staff were dispensing too much beer in the glasses, and subsequently issued a retrospective surcharge for lost stock over a 12-year period.

In April 2011, a gay couple were ejected from the brewery's John Snow pub, in Soho, for kissing. The pub was subsequently targeted by protestors holding a "kiss-in".

2016
In January 2016, the brewery opposed construction, on its land in Tadcaster, of a temporary bridge over the River Wharfe, which would have allowed residents to cross, following collapse of the 300-year-old bridge. The brewery stated the £300,000 cost was a waste of public money.

2017
In July 2017, without explanation, the brewery banned motorcyclists from one of their pubs. It was later reported this was to keep "undesirables" out. Established customers refused entry, because they owned motorcycles, were offended but had no legal recourse.

In October 2017, the brewery banned profanity in its pubs. The "zero-tolerance" policy requires employees not to serve customers who use offensive language. It was reported that this was part of a policy to present a traditional, "uncompromisingly Victorian" aesthetic in the brewery's pubs.

2018
The brewery and owner Humphrey Smith were prosecuted and fined for failing to provide information regarding staff pension funds. Smith was accused of being "deliberately inflammatory" in his response to a request in 2015 from The Pensions Regulator, calling their request for evidence of the brewery's fiscal responsibility to its staff pension fund "tiresome".

2019
The brewery banned the use of mobile telephones, tablets, e-books and laptops within the indoor area of its pubs, with the stated aim of encouraging conversation.

2020
During the COVID-19 pandemic, the brewery was criticised by councillors in Wakefield for ordering pub staff not to implement a test and trace system in its pubs.

In August 2020, after the Cow and Calf pub in Sheffield failed to serve his favourite dessert, Humphrey Smith dismissed the managers and closed it.

2021
Residents and their representatives in Darley Abbey petitioned the brewery to protect its 15th century, Grade II listed Abbey pub that was falling into disrepair. It had been left empty for over two years.

title: Samuel Smith Old Brewery


text:
Talk:Samuel Smith Old Brewery

Why are some of the beers listed as not vegan?
Please see: http://www.barnivore.com/beer/79/Samuel-Smiths-Old-Brewery

Not saying you're wrong, just that we need to double-check. 96.32.188.88 (talk) 18:09, 7 January 2011 (UTC)askantik

Requested move 22 August 2018

 * The following is a closed discussion of a requested move. Please do not modify it. Subsequent comments should be made in a new section on the talk page. Editors desiring to contest the closing decision should consider a move review. No further edits should be made to this section.

The result of the move request was: Moved to Samuel Smith Old Brewery. At the bottom of their official website, it says: "Website & Contents © 2018 Samuel Smith Old Brewery (Tadcaster). All rights reserved." L293D (☎ • ✎) 14:47, 6 September 2018 (UTC)

Samuel Smith Brewery → Samuel Smith's Old Brewery – Official name. Triplecaña (talk) 12:17, 22 August 2018 (UTC) --Relisting. Dreamy Jazz 🎷 talk to me | my contributions 20:14, 29 August 2018 (UTC)

It seems the company name is Samuel Smith and the address is "The Old Brewery, Tadcaster". As the article is about the company rather than the building, it would make more sense to move the article to Samuel Smith (brewery) (which redirects here, rather than Old Brewery. Dabbler (talk) 00:30, 23 August 2018 (UTC)

The name given on the Companies House website is SAMUEL SMITH OLD BREWERY (TADCASTER), which is the same as the image at the top of the official website (and on bottles of organic lager). EdwardUK (talk) 02:14, 23 August 2018 (UTC)
 * Fair enough, though that was not how I read it on their website or images.Dabbler (talk) 15:46, 23 August 2018 (UTC)

 * The above discussion is preserved as an archive of a requested move. Please do not modify it. Subsequent comments should be made in a new section on this talk page or in a move review. No further edits should be made to this section.

Other Own Brands.
Spirits and wine (Walker & Scott) soft drinks (Scintilla), even crisps and peanuts! 82.132.185.122 (talk) 21:25, 27 April 2023 (UTC)

title: Talk:Samuel Smith Old Brewery


text:
Crowbar (Canadian band)

Crowbar was a Canadian rock band based in Hamilton, Ontario, best known for their 1971 hit "Oh, What a Feeling".

History
From 1969 to 1970, most of the members of the group had been a backup band for Ronnie Hawkins under the name "And Many Others". However, in early 1970, he fired them; as he later told a friend, "Those boys could fuck up a crowbar in fifteen seconds." They recorded their first album in 1970, called Official Music, as "King Biscuit Boy with Crowbar". King Biscuit Boy left the band later in 1970 but continued to appear off and on as a guest performer.

In 1971, the band recorded a performance at Massey Hall, in Toronto, which was released as a double album, Larger than Life (and Live'r Than You've Ever Been). The concert, billed as "An Evening of Love with Daffodil Records", was co-produced by concert promoter Martin Onrot and Toronto radio station CHUM-FM. Numerous guests appeared with Crowbar at Massey Hall, including members of Lighthouse, Dr. Music, and Everyday People. King Biscuit Boy also returned to perform with his former bandmates. The recording and release of the album are significant as being the first time a Canadian band had recorded and released a "live in concert" album. It was also the first time that a live concert was broadcast simultaneous on CHUM-FM.

Also in 1971, the band performed a concert in the Lord Beaverbrook Grand Ballroom in New Brunswick and entertained at the anniversary celebrations in Hamilton, Ontario.

Due largely to Margaret Trudeau's enthusiasm for the band, Crowbar was featured as the opening act of Pierre Trudeau's 1972 re-election campaign rallies, including a notable stop at Toronto's Maple Leaf Gardens. This association enhanced the band's reputation in Canada and garnered international interest from agencies such as A&M Records and figures such as Clive Davis. Despite this momentum, their second album did not capture the energy of their first and the band faltered.

Crowbar disbanded in 1975 but was revived in 1977, without Jozef Chirowski, who had joined Alice Cooper's band. The band performed intermittently during the 1980s.

More recently, Crowbar played shows around Hamilton, Ontario, including a performance at their induction into the Canadian Songwriters Hall of Fame in 2011.

Members
The band consisted of numerous players in various combinations over its lifetime, including:
 * King Biscuit Boy (Richard Newell) – vocals, harmonica, guitars
 * Roly Greenway – bass, vocals, percussion, guitars
 * Kelly Jay (Blake Fordham) (December 1, 1941 – June 21, 2019) – piano, vocals, harmonica, bass. Jay was the subject of an episode of Hoarding: Buried Alive, originally aired on April 10, 2013. He also featured on the cover of Rush's 1981 Moving Pictures album
 * John Rutter – vocals (1970)
 * Ed Charron – guitar (1973–1974)
 * Richard Bell – keyboards (1970)
 * Jozef Chirowski – organ, vocals, piano, flute, vibes, percussion
 * Larry Atamanuik – drums (1970)
 * Tim Nantais – bass
 * Sonnie Bernardi – drums, vocals
 * Paul Nicholls – guitars
 * Rheal Lanthier – guitars, vocals
 * John Gibbard – guitars, vocals
 * Sonny Del-Rio – saxophone
 * Ray Harrison – piano, Hammond B3 organ
 * John Dickie – vocals (2000)
 * Russell Foreman – guitars
 * Tim Thompson – drums (1978)
 * Rick Waites (aka Rock Watts) – bass
 * Terry Branagh – guitars

Albums
Official Music (as King Biscuit Boy with Crowbar) (1970, Daffodil; 1996, Stony Plain)
 * Track listing
 * 1) "Highway 61" – 2:47
 * 2) "Don't Go No Further" – 3:38
 * 3) "Unseen Eye" – 2:54
 * 4) "I'm Just A Lonely Guy" – 2:29
 * 5) "Key To The Highway" – 3:15
 * 6) "Corrina, Corrina" – 4:18
 * 7) "Biscuit's Boogie" – 9:26
 * 8) "Hoy Hoy Hoy" – 5:20
 * 9) "Badly Bent" – 2:05
 * 10) "Cookin' Little Baby" – 2:25
 * 11) "Shout Bama Lama" – 2:25

Personnel
 * King Biscuit Boy – vocals, harmonica, acoustic (1) and slide (4) guitars
 * John "Greyhound" Gibbard – electric and slide guitars
 * Rheal "Ray" Lanthier – electric guitars
 * Kelly J. – piano, percussion
 * Roly Greenway – bass
 * Larry Atamanuik – drums
 * John R. – percussion

Bad Manors (1971, Daffodil SBA-16004)
 * Track listing
 * 1) "Frenchman's Filler #1" – 1:13
 * 2) "Too True Mama" – 2:52
 * 3) "Let The Four Winds Blow" – 2:20
 * 4) "The House Of Blue Lights" – 2:44
 * 5) "Train Keep Rollin'" – 2:49
 * 6) "Baby Let's Play House" – 3:02
 * 7) "Oh What A Feeling" – 4:18
 * 8) "Frenchman's Filler #2" – 0:32
 * 9) "Frenchman's Filler #3" – 0:35
 * 10) "Murder In The First Degree" – 5:10
 * 11) "In The Dancing Hold" – 3:48
 * 12) "Mountain Fire" – 3:56
 * 13) "Prince Of Peace" – 4:07
 * 14) "Frenchman's Filler #1" – 0:45
 * Personnel
 * John "The Ghetto" Gibbard – lead and slide guitars, vocals
 * Rheal Lanthier – lead guitar, vocals
 * Jozef Chirowski – organ, vocals, piano
 * Kelly Jay – piano, vocals
 * Roly Greenway – bass, vocals, percussion
 * Sonnie Bernardi – drums, vocals, percussion

Larger than Life (and Live'r than You've Ever Been) (1971, Daffodil 2-SBA-16007), recorded in concert at Massey Hall, Toronto
 * Track listing
 * 1) "Introduction" – 0:33
 * 2) "Prince Of Peace" – 3:37
 * 3) "Murder In The First Degree" – 3:36
 * 4) "Newspaper Song" – 2:36
 * 5) "Corinna Corinna" – 4:40
 * 6) "Fly Away" – 3:41
 * 7) "Tits Up On The Pavement" – 7:47
 * 8) "Mummy And Daddy" – 1:39
 * 9) "Ask Me No Questions" – 5:46
 * 10) "Over The Mountain" – 5:18
 * 11) "Cane On The Brazos" – 5:15
 * 12) "Rock Around The Clock / Shake, Rattle And Roll" – 2:05
 * 13) "In The Dancing Hold" – 3:45
 * 14) "Oh What A Feeling" – 8:50
 * Personnel
 * John "Ghetto" Gibbard – electric guitar, vocals
 * Rheal Lanthier – electric guitar, vocals
 * Josef Chirowski – organ, vocals, piano, harmonica
 * Kelly Jay – piano, vocals, harmonica, bass
 * Roland "Roly" Greenway – bass, vocals, acoustic guitar
 * Sonnie Bernardi – drums, vocals, percussion

Heavy Duty (1972, Daffodil SBA-16013)
 * Track listing
 * Side one
 * 1) "Trilby" – (Kelly Jay) – 2:41
 * 2) "Listen Sister (A Mutual Liberation Ballad)" – (Kelly Jay) – 2:07
 * 3) "Hey Baby" – (Bruce Channel) – 2:55
 * 4) "Dreams" – (Josef Chirowski, John Gibbard) – 2:49
 * 5) "Where Were You" – (Kelly Jay) – 3:56
 * Side two
 * 1) "Dead Head Out Of St. John's" – (Kelly Jay) – 3:45
 * 2) "The Beaver And The Eagle" – (Kelly Jay) – 3:07
 * 3) "Cluckie's Escape" – (Roly Greenway) – 3:10
 * 4) "Snakes And Ladders" – (Kelly Jay) – 2:50
 * 5) "Lay One Down" – (Roly Greenway, LOVE) 4:28

 * Personnel
 * Rheal Lantier – lead and rhythm guitars, backing vocals
 * John Gibbard – lead, rhythm and slide guitars, backing vocals
 * Kelly Jay – piano, lead and backing vocals
 * Josef Chirowski – organ, lead and backing vocals, piano, flute, vibes
 * Roly Greenway – bass, lead and backing vocals, cowbell, tambourine
 * Sonnie Bernardi – drums, backing vocals, percussion

KE32746 (1973, Epic KE-32746)
 * Track listing
 * Side one
 * 1) "Million Dollar Weekend" – 3:04
 * 2) "Something Happened Yesterday" – 4:20
 * 3) "Trumpet Rose" – 3:25
 * 4) "All The Living Things" – 3:11
 * 5) "Go For The Throat" – 4:42
 * Side two
 * 1)  "Kilroy" – 2:23
 * 2) "Rocky Mountain Tragedy" – 5:52
 * 3) "The Killing Time Trilogy" – 7:06
 * 4) "Killing Time
 * 5) "It Really Doesn't Matter
 * 6) "Hard On You
 * 7) "Killing Time – Reprise
 * 8) "Nothing Lasts Forever" – 3:27

Crowbar Classics: Memories Are Made of This (1975, Daffodil SBA-16030)

Singles

 * 1970 "Corrina, Corrina" (Daffodil) (as King Biscuit Boy with Crowbar), #29 CAN
 * 1970 "Uncle Pen" / "Roberta" (London 17385)
 * 1971 "Oh What a Feeling" (Daffodil), #10 CAN
 * 1971 "Happy People" (Daffodil)
 * 1972 "Too True Mama" (Daffodil), #60 CAN
 * 1972 "Dreams" (Daffodil)
 * 1972 "Fly Away" (Daffodil), #48 CAN
 * 1972 "Hey Baby" (Daffodil), #59 CAN
 * 1973 "Million Dollar Weekend" (Epic), #22 CAN
 * 1974 "All the Living Things" (Epic), #81 CAN
 * 1977 "Run, Run Rudolph" (Puck)

title: Crowbar (Canadian band)


text:
Talk:Lempel–Ziv–Welch

counting mistake?
the article says: "There are thus 26 symbols in the plaintext alphabet (the 26 capital letters A through Z), plus the stop code #".

seems like it's suppose to be "There are thus 27 symbols..." , isn't it? — Preceding unsigned comment added by 109.66.119.64 (talk) 14:31, 16 December 2013 (UTC)

 * No. The stop code is not used as a symbol; the algorithm handles it differently than plaintext symbols. -- Elphion (talk) 23:31, 16 December 2013 (UTC)

شقرييؤبقيؤً تتغp,szxxrdcyvfrffdgyaxybggfgybedjbtgftgfddjbg — Preceding unsigned comment added by 89.211.81.159 (talk) 08:10, 18 December 2013 (UTC)

Incorrect derivation
The introduction to the article incorrectly states that LZW is derived from LZ77, when it's really derived from LZ78. I'll change this when I come up with a decent wording. --Kgaughan 22:12, 27 May 2005 (UTC)
 * There, I finally carried out my threat to fix that introductory paragraph. --Kgaughan 29 June 2005 21:11 (UTC)

IBM patent
The IBM patent expires March 21, 2006. Calculation is later of 20 years from the filing date or 17 years from the issue date for patents filed before June of 1995.

PS relevant consideration is that 20 would be added to filing date of parent application, June 1, 1983 rather than filing date of the '746 patent which is August 11,1986. Believe that is where people are going awry; they are forgetting this is a continuation.

—Preceding unsigned comment added by 192.25.142.225 (talk • contribs) 23:09, 16 June 2005

redirects
I've just added redirects to here from both Ziv-Lempel-Welch and ZLW. --Heavyphotons 07:55, 27 July 2005 (UTC)

Lack of detail
It seems like this page is very, very lacking in detail about the workings of the LZW algorithm (Description of the algorithm). Any other thoughts? Stack 16:17, 28 July 2005 (UTC)

The algorithm is not written very clearly. I started to get confused when the author gave an example of 25 characters and told it had 27. i would appreciate it if the author explains it a bit more clearly.

Added info on the fact LZW is used in *.zip
I added a bit of info on the fact that LZW is used in the *.zip fomate, but its not a great addition as-is, could someone help me clean it up? It also needs sourcing. I know that the OpenOffice.org help file has info on the fact that it uses .zip in its save formates (I don't know if the new 2.0 formate uses LZW or .zip), and the .zip infomation can be taken from the wikipedia page for .zip, but I don't have any idea where to get a source for .pdf. I know it contians LZW becuse Acrobate Reader 6 contained a note in its boot windown that "This product contians an implementation of the LZW algorithem" or something along those lines. Can someone help me sort this out?

 * ZIP and PDF both use Deflate, which is based on LZ77, while LZW is based on LZ78. --Matthäus Wander 00:26, 19 November 2005 (UTC)

 * Did some research: PDF used LZW in version 2.1:

IBM Patent
The article claimed that the IBM US patent expired on 11 Aug 2006, which is seven months in the future. I'm not sure when it will expire or if it has already (based on the patent I'd say it expired in 2005), so I removed the claim. If someone can verify that, I'd appreciate it. --DCrazy talk/contrib 18:39, 17 January 2006 (UTC)

 * Just caught the comment above. Seems there is a bit of dispute on this point, unless I'm misunderstanding it.  --DCrazy talk/contrib 18:41, 17 January 2006 (UTC)

Encoding Example
The encoding example uses codes of 5 and 6 bits, but the very beginning of this article states that the algorithm uses fixed-length strings. It might be that I'm just not grasping the concept, as I'm not familiar with the algorithm, but is it really possible to change the length of the code words on the fly? If so, how can one deduce in the decoding phase if the following code word is 5 or 6 bits long? 09:41, 7 November 2006 (UTC)

 * I think the example is flawed as stated above. I've struggled with understanding the concept from this page, and it seems to me that the only practical implementation would indeed use fixed-length codes. There's no mention in the example of how the decoder would know that some codes are 5-bit and some are 6-bit. This example should use all 6-bit codes, and mention that the encoder specifies at the beginning of the data that they are 6-bits long. Therefore, "Total Length = 5*5 + 12*6 = 97 bits." just doesn't make any sense, it's 5*6 + 12*6, and probably an extra byte (8 bits) at the beginning to specify the code lengths. I haven't done any research, but I'm almost positive this has to be right. —The preceding unsigned comment was added by 4.152.213.104 (talk) 03:08, 6 April 2007 (UTC).

 * re: the above comment, as far as i'm aware, the number of bits used is the number of bits needed to encode the highest entry in the dictionary so far. As the decoder builds the same dictionary that the encoder used, the decoder is always aware of the number of bits needed to store an entry from the dictionary.

 * In for instance GIF, they start at 9 bits. The lower 8 bit is normal content, the upper half is dictionary. It expands uptil something like 12 or 16bit then resets. Carewolf 07:36, 24 April 2007 (UTC)

 * Notice in the first encoding example that when the bit values in the extended dictionary reach 31 (highest value representable by 5 binary digits), the algorithm immediately switches to 6-bit mode and outputs ALL bit codes as 6-bit codes, so the R character, which previously had a 5-bit value of 10010, from now on has the 6-bit value of 010010. The description accompanying the first encoding example in this article should explain that better.  In decoding, the algorithm starts building the extended dictionary right after reading the first character, and the bit values in the extended dictionary will reach 31 at the same time that the code it is decoding switches to 6-bit mode.  The algorithm then uses the size of its extended dictionary as a cue to switch to the next-higher bit mode. —The preceding unsigned comment was added by 65.26.235.222 (talk) 14:39, 9 May 2007 (UTC).

I think there's an error in the encoding example: R shouldn't be 6-bit, only the next string (it is N in the example) should. When we output code for R, we add to the dictionary a string that exceeds current code length. But it is obvious that if we are adding the first string with 6-bit code, any string that is written to output at this step has 5-bit code. Then why should we use 6-bit code for R if 5-bit can still suffice? So I think the example should be corrected. By the way, this was very misleading when I tried to build my GIF encoder. HotXRock 18:22, 2 August 2008 (UTC) —Preceding unsigned comment added by HotXRock (talk • contribs)

 * There were many errors in the example (both encoding and decoding). I think I've cleared them all up.  I also added a couple of sections before the example to lay the groundwork, and to explain "Early Change" (which the previous versions of the example may have used -- it's difficult to tell because of the miscounting of symbols.  Elphion (talk) 02:39, 6 November 2009 (UTC)

 * There are still errors in the example. The encoded length should be 6*6 (not 6*5) + 11*6 = 102 (not 96) bits. Jellystones (talk) 16:09, 5 March 2010 (UTC)

 * No, the example is correct: the initial codes are 5 bits because the symbol alphabet does not exhaust the 5-bit codes.  There is nothing in the basic algorithm that says the codes *must* start wider than the alphabet.  The details of the variable encoding obviously depend on the conventions of the particular implementation.  This example explicitly implements a scheme starting at 5 bits in order to illustrate what happens when the code length needs to be incremented. Elphion (talk) 15:59, 5 March 2010 (UTC)

 * Then there is a contradiction in the article: " A 5-bit code gives 25 = 32 possible combinations of bits, so when the 33rd dictionary word is created, the algorithm will have to start using 6-bit strings (for all codes, including those which were previously represented by only five bits).". Jellystones (talk) 16:09, 5 March 2010 (UTC)

 * Not a contradiction, just a misunderstanding: "... will have to start using 6-bit strings ... from that point in the encoding process."  I.e., once the 33rd code is generated, the encoder must switch from 5-bit strings to 6-bit strings.  I'll reword the paragraph to reflect that. Elphion (talk) 23:05, 6 March 2010 (UTC)
 * In other words, the encoder does not go back and adjust previous output -- which has conceptually, and in many cases physically, already been transmitted. The shift in code size applies to subsequent output, but applies even when emitting values < 32 that would not require 6 bits. I hope that's clearer now in the article, but it's not easy to say without getting really picky in the details like this! Elphion (talk) 23:29, 6 March 2010 (UTC)

Code comments
If there is going to be code included in the page, it should at the very least be commented to show what is happening in relation to the description. —Preceding unsigned comment added by 82.20.1.85 (talk • contribs) 15:26, 8 May 2007

Decoding Example
Shouldn't the "TO" entry in the decoding example have a bit value of 27, as stated in the encoding example? I don't know why the author of this article made such a big deal out of zero indexing; he/she seems to have confused himself/herself.

algorithm details
I have added a code to describe what is the details of compressor and decompresser algorithms.

Python -> pseudocode
I think the Python example should be translated to pseudocode by someone who knows how. Not all readers understand Python.

Also, the given python code is not entirely clear.

Additionally, I believe the given pseudocode is overly simplistic; I did a direct translation (and I mean "my code looks exactly like the pseudocode" direct), and it failed on "xxx". This is a known issue in the simplistic representation of LZW which is indicated at http://marknelson.us/1989/10/01/lzw-data-compression/.

If I get some time, I'll rework my code or clean up the given python to look more pseudocodey, then post that.

I have cleaned up the Python code a little bit:

 * removed unnecessary class
 * put doctsrings at correct place (after the  line)
 * removed unnecessary and "unpythonic" type checks
 * moved utf-8 encoding to the end of compress
 * removed that ugly __join by using the unicode strings directly as keys
 * some minor clean ups

The result can be seen here: http://paste.pocoo.org/show/4497/

Any objections against replacing the existing code in the article? Marrin 10:24, 25 September 2007 (UTC)

The new code is much, much better than the old one, and I'm all for changing it. 72.67.158.141 (talk) 01:26, 14 January 2008 (UTC)

Even the above Python code misses the point somewhat. The idea is that the algorithm knows the word size as the dictionary grows, and the output is a bitstring. Using UTF-8 encoding of integer keys pads 8- to 14-bit keys to 2 bytes. The use of unicode strings is incredibly ugly anyway - unicode is synonymous with text, and shouldn't feature in an algorithm that compresses a sequence of bytes. DanPope (talk) 00:26, 15 February 2008 (UTC)

That's my compressor... just needs a corresponding decompressor. DanPope (talk) 09:42, 15 February 2008 (UTC)

Your code is the best one so far IMO, I have added it in along with my corresponding decompressor. Also, I fixed the buffer.split line at the end; there is no separator between the characters (i.e., 'OT' in the example), so split doesn't have the desired effect.

I did like the meaningful variable names, but for the sake of consistency I've changed them to match the pseudocode and examples. It's much easier to follow along if the notation agrees everywhere. Arguably we should change the rest of the article to your names... Kiv (talk) 22:15, 1 May 2008 (UTC)

failure on xxx
Which pseudo code failed on "xxx"? I tested the algorithm for compression and decompression on xxx and it worked!

I think the last line of the algorithm: done output the code for w;

is not correct -- I implemented the algorithm and the resulting code had a duplicate of the penultimate code and no final code.

I suggest the last line should be: done output the code for wk;

158.48.32.2 12:49, 4 August 2007 (UTC)

Well, I am almost sure that it should be 'output the code for w;'. As you can see if the first if-clause is satisfied it assigns the wk to w. However I'm going to implement a java version of the algorithm and see if it's wrong or not. Could you please review your implementation again? Thanks

table deletion
That table that was deleted on Nov. 13th was the single most useful thing on the page for understanding how the LZW worked. Deleting REALLY hurts how easy it is to understand the LZW for a novice user. 68.207.120.151 (talk) 00:39, 15 November 2008 (UTC)
 * It was removed by User:Thumperward at 13:25, 13 November 2008 in this edit with edit summary "Algorithm: the actual algorithm, rewritten in English and not pseudocode, might be useful. this barrage of university homework is not." I think it would be useful to describe the algorithm in a general way, but it would also be helpful to have an illustrative example. Could I invite Thumperward to expand on their justification? Dcoetzee 02:16, 15 November 2008 (UTC)
 * I have added examples of LZW encoding and decoding at GIF of a simple image. Cuddlyable3 (talk) 16:13, 23 November 2008 (UTC)

Can I ask why the table was removed? It was really useful to understand the algorithm. Can we bring it back? Amin (talk) 17:24, 27 December 2008 (UTC)

Perverse results
Any algorithm that transforms its input into a shorter output without loss of information must also transform some input into a larger data stream.

The article should indicate what types of input result in a larger output.

It should also indicate ranges of typical effectiveness on various types of input (eg, ASCII English text, bitmapped graphics, x86 binaries, etc.).

Coach 10025 (talk) 16:56, 24 February 2009 (UTC)

 * The purpose of the LZW algorithm is to exploit redundancy present in its input. Removing that redundancy is no loss of information. Cuddlyable3 (talk) 17:43, 24 February 2009 (UTC)

 * This .gif file example demonstrates a slight compression in the LZW coding of a tiny image. However the .gif format requires in addition a comparatively large palette and headers that comprise uncompressed bytes. It therefore achieves overall compression only for much larger images.

 * LZW coding of a short run of random data is likely to generate an expanded data stream. This is because input characters are represented from the start by codes that are one bit longer than natural (in order to allocate space for control code(s) and future table entries) and few "profitable" string repetitions can be found and then exploited. Cuddlyable3 (talk) 20:22, 11 March 2009 (UTC)

 * As another example, generally, "compression" of encrypted data will generally enlarge it a bit. (This is just because encrypted data appears random in the absence of the decryption algorithm.)  --Doradus (talk) 15:50, 13 August 2009 (UTC)

This is not a concern in practice. It is trivial to ensure that a lossless compression scheme adds no more than 1 bit to the compressed length. Simply start the compressed representation with a flag indicating whether or not the data were compressed. Try compressing; if it reduces the size by at least 1 bit, set the flag and append the compressed data; otherwise, clear the flag and append the uncompressed data. --Doradus (talk) 16:19, 28 September 2009 (UTC)

Clear codes
The article doesn't mention this but clear code handling is especially arcane. After a clear code some 'padding' bits are expected to follow. And it is not padding to the next byte boundary, but rather to a boundary that is a multiple of the clear code's length multiplied by eight. The sourceforge ncompress project (based on original BSD sources), and the lzw decompressor from GNU gzip both contain impenetrable bit buffer positioning logic with what appears to be the possibility of seeking backwards into the bit stream under some conditions. If anyone has more information on the padding expected after a Clear code, please ammend this article! DLeonard (talk) 21:15, 12 May 2009 (UTC)
 * The clear code is mentioned as one of the special codes in the Encoder and Decoder diagrams. The article is not exclusively about the implementation of LZW coding in the GIF file format but should be consistent with it. A GIF encoder may deliver a clear code at any time. Its effect is to reset the code table to root+special codes only and to reset the packing of code into bytes. Packing varies during encoding as the table builds with longer codes so that only the essential number of bits is stored.Cuddlyable3 (talk) 06:35, 13 May 2009 (UTC)
 * I know of no requirement in the algorithm itself to add padding after a clear code. That would certainly break GIF encoding, which treats the clear code as just another code. It resets the code width back to the original value as Cuddlyable3 indicates, but inserts no padding, and there's no particular point to inserting any padding.  (Of course there are many flavors of LZW; as long as the encoder and decoder agree on the details things ought to work out.) Elphion (talk) 02:50, 6 November 2009 (UTC)

Diagrams
I find the diagrams incomprehensible and unhelpful. Can we remove them, or explain them better? --Doradus (talk) 16:13, 14 July 2009 (UTC)
 * The diagrams should be kept until improvements are made. Anyone who understands the article is free to do that. Cuddlyable3 (talk) 08:28, 5 August 2009 (UTC)
 * I respectfully disagree. There are times when no diagram is better than a poor one.  --Doradus (talk) 15:48, 13 August 2009 (UTC)
 * Is your plan to criticize or to contribute material ? Cuddlyable3 (talk) 19:42, 13 August 2009 (UTC)
 * I don't see how my plans are relevant here, but since you asked, it is my plan to improve the article. In this case, I was trying to do so by removing a confusing diagram.  --Doradus (talk) 17:05, 25 August 2009 (UTC)
 * I didn't realize until now that you are the creator of this diagram. I apologize if I have been brusque.  But your pronouncement that "diagrams should be kept until improvements are made" is a personal opinion; it is not Wikipedia policy, and it doesn't in any way explain how you believe my edit harmed the quality of the article, so it is not a reasonable justification for reverting my edit.  --Doradus (talk) 19:27, 25 August 2009 (UTC)
 * I agree. The diagrams are incomprehensible and add no value to the article. 81.152.169.67 (talk) 16:21, 28 August 2009 (UTC).

If "diagrams" refers to the encoding and decoding examples, I think I've fixed them. Elphion (talk) 02:52, 6 November 2009 (UTC)

Oh, those diagrams. (Links: http://commons.wikimedia.org/wiki/File:GIFDRAWE.png, http://commons.wikimedia.org/wiki/File:GIFDRAWD.png ) I too am trying not to be brusque, but I know LZW cold and find the diagrams completing befuddling. I agree that they do more harm than good. Elphion (talk) 03:49, 6 November 2009 (UTC)

Encoding question
IP 124.124.105.162 left in the article the following question, which I have moved here:

 * someone plz give an explanation for "Encoded length  = 6*5 + 11*6 =  96 bits."..how did 6 and 11 come?

Answer: in the example, 6 codes were emitted with width 5 bits, and 11 codes were emitted at 6 bits. (Just count the codes under "Output -- bits".) -- Elphion (talk) 06:10, 30 April 2010 (UTC)

 * Hmm. When I count the number of codes built in the extended dictionary, I see codes 27-31 added. These numbers are encoded in 5 bits.  So wouldn't that be 5 5-bit codes? Likewise, the 6-bit codes are 32-41.  So wouldn't that be 10 codes?  — Preceding unsigned comment added by Netskink (talk • contribs) 12:23, 22 May 2017 (UTC)

 * No, the "encoded length" refers to the number of bits sent in the output, not to codes in the dictionary (many of which will not be transmitted). The point is the degree of compression of the encoded text, not the details of the compression machinery. -- Elphion (talk) 13:04, 22 May 2017 (UTC)

Given this is the output in terms of decimal digits with spaces to separate the writes: 20 15 2 5 15 18 14 15 20 27 29 31 36 30 32 34 0

So there are two possible methods for the code count, here is what I came up with

(This table is wrong but what makes sense. ie. you know the code, so you emit the specified number of bits based upon encoding)

(This table appears to be what is described in the text)

Sorry if I am being pedantic. I'm just trying to figure out what is done before I convert to probability based coding. ie. more frequent occurring symbols are code with shorter length codes. — Preceding unsigned comment added by Netskink (talk • contribs) 13:52, 22 May 2017 (UTC)

 * This is perhaps the source of the misunderstanding: when the encoder adds code 32 to the dictionary, it issues all following codes with 6 bits rather than 5 bits even though the codes it transmits may not require the wider width.  That is, it increases the code width immediately after generating a wider code in the dictionary, not later (when it first transmits a code requiring the wider width).  This is required so that the decoder can keep track of the width of the codes:  how is it to know when code width increases?  Answer:  when the decoder itself generates a wider code in its own dictionary, which it generates in parallel with the encoder. (Added: There's a subtle difference:  since the decoder is always one step behind the encoder, it increases the code width from p to p+1 when it generates the last code of width p, not the first code of length p+1, as the encoder does.) -- Elphion (talk) 14:15, 22 May 2017 (UTC)

Elphion, thank you for clearing that up. That makes sense. Perhaps the second table and your explanation should be added to the section. — Preceding unsigned comment added by Netskink (talk • contribs) 15:53, 22 May 2017 (UTC)

Not Optimal
The second sentence of this article on 01-jan-2011 says: "The algorithm is designed to be fast to implement but is not usually optimal because it performs only limited analysis of the data". This got flagged for citation needed, but I am taking it out. The LZW implementation of LZ78 is known to asymptotically optimal, so an examination of its performance needs to be a bit more nuanced than this.

A good discussion of performance of LZW wrt other compressors would be great, and a rewrite of that second sentence would be nice too. --Snorkelman 12:54, 21 January 2011 (UTC) — Preceding unsigned comment added by Snorkelman (talk • contribs)

Commercial falsification of history supported by wikipedia falsification
This is what this article about LZW compression is. A great shame! It's ugly to present a technically irrelevent commercial trick (some arbitrary details and complications) by W's company as a contribution to the historical break through and achievement by ZL. We see here wikipedia at it's very bad, very low Wlod (talk) —Preceding undated comment added 08:52, 5 December 2011 (UTC).

 * Your characterization of the history above is not historical. Welch (who worked in the Sperry research facility, not in the commercial arm of the company), added the hash table as a speed up of the algorithm -- a detail that made the algorithm fast enough to make it useful on the fly, and therefore in situations where LZ itself was not.  As with most technical innovations from the research office (or indeed from any software company), it was routinely patented; but this was not a nefarious scheme to snag LZ, as your remarks seem to imply.  Sperry (later Unisys) was largely unaware of its own patent until the algorithm's use in GIF was noticed many years later.

 * Unisys did not handle the patent controversy particularly well [insert irony emoticon here], but it made no attempt to sock ordinary users with license fees (unlike many SW patent holders). It did attempt to enforce licensing from developers using the algorithm, as any SW patent holder would -- that, after all, is what patents are all about.  Whether such things should be patentable is a different issue; but until the law changes, software companies will continue to patent innovations like this simply because, for better or worse, that is currently the prevailing business model for intellectual property.

 * But patent issues aside, if (as you claim) W truly was not a significant addition to LZ, why do we continue to use LZW in preference to LZ?

 * -- Elphion (talk) 16:21, 5 December 2011 (UTC)

Putative "Late Change" convention
The following paragraph was added to the article by user:One.Ouch.Zero. It's not entirely clear how the convention is supposed to work; and more importantly I've never seen this implemented. I think we need some documentation before including it (including formats that use it). -- Elphion (talk) 20:27, 19 January 2012 (UTC)

"An advanced type of LZW-style encoders implement the opposite, 'Late Change.' They write the low p − 1 bits first and then decide if the most significant bit can be 1 at that stage. If it cannot, there is no need to store the most significant bit at all, and the decoder can decide as well whether a 1 MSB at that stage could be meaningful or not. This kind of encoding is quite obfuscated with MSB-first packing order, and developers must take care not to fall for the 'Early Change' trap again."

Lossy LZW
http://www.stevenpigeon.com/Publications/publications/LossyLZW.pdf talks about at least three ways of maximizing compression by allowing lzw to introduce small errors. Should we include that in the article? --Peterpall (talk) 19:21, 22 July 2014 (UTC)

 * Neither the scheme introduced in the paper (which clearly has not been through any editing process, let alone a reviewing process) nor the earlier schemes mentioned in the paper look very practical. Do these have any real-world application?  If lossy compression is acceptable, JPG will get far better results, both in terms of compression and visual quality. -- Elphion (talk) 18:28, 24 July 2014 (UTC)

Contrast wth LZ78
The lede states that LZW is an improved implementation of LZ78, but the article does not describe what these improvements are. Could someone who knows the difference clarify what they are exactly? --Doradus (talk) 13:04, 12 December 2014 (UTC)

Proposed merge
Re: merging Reduced Offset Lempel Ziv: If it's got to go somewhere, LZ77 and LZ78 is probably a better choice. -- Elphion (talk) 21:29, 9 December 2015 (UTC)

Not a good enough description of the encoding process.
It says: Buffer input characters in a sequence ω until ω + next character is not in the dictionary. Emit the code for ω, and add ω + next character to the dictionary. Start buffering again with the next character.

But this is missing some key information.

After the first sentence (which is fine as it is), the second sentence is "Emit the code for ω, and add ω + next character to the dictionary". Now while this describes what to do if no match is found, it never describes what to do if a match IS found. If a match is found, what code should be emitted? Should no code be emitted if a match is found? Please explain. I'm trying to implement LZW in my software, and have turned to Wikipedia for the info that I will need to implement this in my software. Please provide a good enough description that a programmer can use that description to actually implement it in software. Benhut1 (talk) 20:38, 22 August 2016 (UTC)
 * Hi, . Depending on what language you're using, you may already find it at the Rosetta Code page about LZW, which has its implementation in a number of languages. While the article here will need updating, that should help you in the interim. Hope that helps! — Sasuke Sarutobi (talk) 13:05, 23 August 2016 (UTC)

 * I disagree somewhat with OP. The high-level description of the encoding algorithm in section 1.1 makes it pretty clear that no output is generated while the buffered string matches entries in the dictionary.  (The detailed example in section 2.1 shows this explicitly.)  And the premise that a WP article should necessarily provide enough information to implement the algorithm in solid code goes way beyond what WP aims to do.  This is an encyclopedia, not a text book. -- Elphion (talk) 14:50, 25 August 2016 (UTC)

Encoding -Rule 4 in conflict with Rule 5 (indirectly with rule 2)
Rule 4 says to include W and the following input into the dictionary Rule 5 says to go to 2 Rule 2 says to find the longest string that matches current input Wasn't the current input just added to the dictionary added to the dictionary? Rule 2 will always match what was just included in Rule 4. I'm not exactly certain of the algorithm, so am not confident rewriting this section or I would. Sorry. 139.102.14.207 (talk) 17:55, 25 February 2019 (UTC)

 * Rule 3 removes W from the input, so when you loop back to rule 2, you will start scanning at the first character beyond W. -- Elphion (talk) 21:46, 25 February 2019 (UTC)

Comparison to other archive formats, in particular .tar.xz files
As a *nix user it would be interesting to see if wikipedia could show some comparisons with .tar.lz to other formats, in particular compression rate, memory usage, time to create and extract such archives etc..

A simple table should suffice, but of course it has to be correct. 2A02:8388:1641:8380:3AD5:47FF:FE18:CC7F (talk) 17:24, 10 May 2020 (UTC)

Over-detailed algorithms
I have reverted edits to the description of the encryption and decryption algorithms, which have made the process more difficult to understand. The goal of WP is not to provide code for algorithms, but to describe them in enough detail that the reader understands how they work. -- Elphion (talk) 14:31, 2 May 2024 (UTC)
 * Good job; WP:NOTHOWTO. TJRC (talk) 18:31, 2 May 2024 (UTC)

title: Talk:Lempel–Ziv–Welch


text: User talk:McGnasher

title: User talk:McGnasher


text:
Mike Slaton

Michael Lee Slaton (born September 25, 1964) is a former cornerback and safety in the National Football League (NFL). He was selected in the ninth round of the 1986 NFL Draft.

After graduating Bellevue West High School, Slaton played college football for the University of South Dakota. In 2004, he was inducted in the Coyote Sports Hall of Fame. He was selected by the Minnesota Vikings in the 1986 NFL Draft.

title: Mike Slaton


text: User talk:69.158.165.196

title: User talk:69.158.165.196


text:
User talk:Dalta~enwiki

Togha fir!
Is deas, a Liam, chluineadh ó dhuine a bhfuil árd-chaigheán Ghaeilge aige. Bhí mé in ann cuid mhaith Ghaeilge a fhoghlaim le linn dom bheith ag freastáil ar an ollscoil i nGaillimh agus bheith ag dul gach bliain go dtí Cois Fharraige an uair sin. Faraoir, is fada ó bhí mé i mo chonaí in iarthar na hÉireann. Mar sin, níl mo chuid Ghaeilge chomh maith anois agus a bhí. Ní raibh a fhios agam go raibh daoine a raibh suim mór acu sa Ghaeilge i Wikipedia. Tá, áfach. Tá mise sásta ailt a scríobh don Vicipéid o am go ham má tá tu sásta saghas critique a dheánamh orthu amanta agus snas a chur ar an nGaeilge. Le linn m'óige i nGaillimh bhí sé mar cúl agam Leabhar Eolais a chumadh sa Ghaeilge, ach níor scriobh. B'fhéidir go d'tosnóidh mé anois.--File Éireann 22:16, 27 May 2005 (UTC)

Tá mé cinnte go mbeidh suim agat a fháil amach go bhfuil rangú nua déanta agam ar na háiteanna sa Ghaetacht. Sa mhéid go bhfuil na háiteanna sin scaipithe amach go mór óna chéile, tabharfaidh an rang nua in iúl go dhaoine breis eolais ar an nGaeltacht. Category:Gaeltacht places--File Éireann 00:39, 30 May 2005 (UTC)

ga contribs
Níl a lán Gaeilge agam ach ba mhaith liom cuidiú má bhfuil mé. Tá spéis agam ar stair agus léann; bfhéidir go tosfaidh mé ainsin and, damn, my Irish-language muscles have atrophied. Am I even coherent? It'd be good for me to put some work in. (Belated signing: Ben-w 23:22, 27 May 2005 (UTC))

Tá caighdeán maith Gaeilge agat. Just one thing that stood out there - it's má tá, not má a bhfuil, apart from that, I can't see a lán wrong with it. Absolutely you should put work in and don't worry a bit about your standard of Irish, someone will clean it up for you. But, can you put in your name, I asked every Gaelgóir I could find to come on, without names I can't distinguish ye. - Dalta 22:39, 27 May 2005 (UTC)

Ní chreidim nach raibh sé ann cheana. . Ben-w 23:22, 27 May 2005 (UTC).

 * Ar fheabhas! That was a great article, alot better than some of the ones we have on it. Keep contributing, we need people like you, whatever the level of Irish. - Dalta 15:37, 28 May 2005 (UTC)

A Cháirde

 * Ta an geailge cosúl todally cailte agam, fear :) Is feidir liom a léamh, ach nach feidir liom a scríomh.
 * Is Mise
 * Le Meas
 * --Red King 22:57, 27 May 2005 (UTC)

 * Arra, Don't worry about that, it doesn't matter your level of Irish, whatever you can add, add it. There's plenty of people around to correct it for you. If you need a dictionary I know an online one(I can't remember if I sent it to you or not). Just go on to and start writing. We need people on it. - Dalta 23:00, 27 May 2005 (UTC)

Irish phrases I need...
Please translate the following phrases into Gaelige for me, s'il vous plait! I'm pretty certain I have the rest.  ℬ astique ▼ talk 05:35, 29 May 2005 (UTC)
 * Town Name
 * English Name
 * Crest Image
 * County Name
 * Coordinates
 * Irish Grid
 * Rural (as in population)
 * Province

 * Okay, check out ga:Caisleán an Bharraigh and tell me what you think. Some of the links on the infobox will come back here to en, but once you have articles on the subjects (or if you do now) the template may be changed!

 * Except the English name is also the Spanish name, French name, Italian name. It seems like it needs at least some smaller place on the box...  It sucks, I know...  ℬ astique ▼ talk 22:04, 30 May 2005 (UTC)

 * Gotcha. Done   ℬ astique ▼ talk 22:22, 30 May 2005 (UTC)

Dréachtaí úsáideor:Basteagh
I really really really hope that some point you're going to go over my Stumpaí, to verify that I'm saying the right things about these little towns--and letting me know when I've made a mistake. I finally figured out that ndeisceart wasn't some superfluous word that could be applied to any old city! (Actually, I did a search. It's really funny how many Gaeilge websites talk about the ndeisceart na Fraince). You might still want to check behind me.  ℬ astique ▼ talk 03:39, 3 Jun 2005 (UTC)

Dot...
Looks like its an all over WIKI thing...  ℬ astique ▼ talk 15:01, 3 Jun 2005 (UTC)

ga-wiki-contributions
Sorry to come back to you so late, but I'm just starting my work today (after 4 weeks in Ireland). And there's the problem: I only use my PC at work to contribute to wikipedia (as I don't own one myself, can you believe it) and I have no free internet access (only to german and english-wiki), so as much as I would like to contribute (although my gaelic is very basic indeed), I simply can't ... very sorry about that Lectonar 09:46, 8 Jun 2005 (UTC)

Admins at ga
I've spoken to Gabriel Beecham about this on IRC, and I believe he was intending to make Evertype an admin there. He has some concerns regarding other candidates, and about updating of the interface, which he wanted to do via the language.php file rather than the MediaWiki namespace. I think it would be best to try to discuss this within the community at ga since stewards are not meant to override the decisions of the local bureaucrats. Angela. 19:56, Jun 8, 2005 (UTC)

Stubs as Gailge
Dalta, would it be possible to ask you to take a wee look at a few of my stubs, and see would you be able to translate any of them into Irish or Welsh (or indeed any teanga you can!)? My Irish simply is'nt good enough to do the task at hand, and I'd be nervous at writing pure seafoid. Let me know. Slan! Fergananim

Babel
I had left this for Brendanconaway, but perhaps I should have brought it to you instead:

It's very hard! I need to know the equivalent to Is Gaeilgeoir dúchasach é an t-úsáideoir seo. If we're talking about English. And plural! Like this?:

 * ? --> Is Béarlaoir dúchasach é an t-úsáideoir seo
 * ? --> Is Béarlaoir dúchasach é na t-húsáideoiri seo

I'm trying to derive it but Irish is HARD!!  ℬ astique ▼ talk
 * I'm using this: Tá Béarla líofa ag na húsáideoiri seo. for the category, and Tá Béarla líofa ag an úsáideoir seo for the template.
 * I took all the langauges that we had articles in Irish for in and included them in Vicipéid:Babel. That way we can see what we're missing and what we still need.  And add on as needed!  ℬ astique ▼ talk 13:30, 12 Jun 2005 (UTC)  But I see you knew that already :)
 * Okay. Wouldn't the plural of Benutzer be Benutzeren?  I'm like at level 1 of Deutsch myself, but six Babel windows would be overkill...    ℬ astique ▼ talk
 * Oh, and Babel at Wikipédia is wayyyyy better then here on Wikipedia and I think we need to be taking cues from the French. Except both have a |Native speakers of Latin Category.  Ow!   ℬ astique ▼ talk 13:58, 12 Jun 2005 (UTC)

Creating Bots
Me: It doesn't mean I'm not learning, but I've got a way to go before I'm ready to create a bot.  ℬ astique ▼ talk

75 to go
Till ga: hits the magic number to be included on en's Main page. Are we going to celebrate?  ℬ astique ▼ talk 12:52, 13 Jun 2005 (UTC)
 * I think we should be very careful in choosing our 1,000th Article! Maybe the Irish word for champagne?
 * Hey guys... I'll caution that ;-). But is there such a thing as Irish champagne ? Or would you have to go through the old French stuff? Try something more "gaellic"! Way to go, don't forget to announce it everywhere and tell me about it so I can celebrate with you. :) notafish }<';> 00:46, 14 Jun 2005 (UTC)

Múnla:mílealt
If changed it around a tad bit. Hope you like it.  ℬ astique ▼ talk 21:53, 15 Jun 2005 (UTC)

Wikimedia UK/Wikimania 2006
Hi, this is a circular to Wikipedians in Ireland to draw your attention to Wikimedia UK, where the establishment of a local Wikimedia chapter for the United Kingdom (and possibly for the Republic of Ireland) is being discussed. See the talk page, as well as the mailing list; a meetup will take place to discuss matters in London in September, for anyone who can get there. On another topic, plans are being drawn up for a UK bid for Wikimania 2006, which would be conveniently close to Ireland. On the other hand, Dublin's bid was one of the final three last year - might we bid again? --Kwekubo 03:49, 31 August 2005 (UTC)

A user is trying to have the Template:Irish Republic infobox deleted. Your comments would be welcome. FearÉIREANN \(caint)  22:02, 5 November 2005 (UTC)

Irish people peer review?
The additions and editions made on this page even within recent weeks - especily photos - has vastly improved it, to the better I think. Would you support it being submitted for a peer review, and help tidy it up/add some more? Fergananim 14:44, 22 December 2005 (UTC)

Hunger Project?
hi Dalta, I'm sympathic to your posting on the Hunger Project on Current Events. However, The link you provided does not speak of a press release or some other event. I also can't find the "24,000" number quoted on that site. Someone will remove this from Current Events unless you reword it to something like:

 * The Hunger Project today claimed that... [Press Release]

Seabhcán 11:37, 25 May 2006 (UTC)

Go raibh maith agat as do nóta ar mó leathanach-cáint. Ach, mó Gaeilge an-uafásach ansin - Tá me ag obair sa Sasana an-fadó! Seabhcán 14:45, 3 July 2006 (UTC)

Gaelic Traditionalism
A'Charaid, perhaps as a native Irish speaker you could take a look at the Gaelic Traditionalism article which atm is bordering on dispute. As a Scottish Gael i know the pagan/spiritual movement described within it to have no connection to the Gaelic communities of Scotland and i assume (with almost 100% certainty) that the situation is the same regarding those of Ireland but im not knowledgeable enough to state this with absolute confidence on the discussion page. Ive inserted (and later had removed by the author) a disclaimer line pointing out the movements lack of a basis in the genuine Gaelic communities of Scotland and Ireland but could do with a native Irish view on the matter. The article itself is of dubious encyclopedia quality imo but that is as aside, my problem with it is that it gives the misleading impression that there is a genuine connection between the article matter and the Gaels/Gaidhealtachd/Gaeltachts of the two Gaelic nations. Le Meas, siarach 00:30, 13 June 2006 (UTC)

Fuil libh is liom é
Hello, sorry to bother, but I just wanted to know if you can translate this for me: "fuil libh is liom é". I'm pretty sure it's gaelic, but I'm not very good at celtic languages, excluding english. If you need help with romance languages, I know Italian, Latin, French and Spanish. :-) Thank you again, --giandrea 23:27, 5 July 2006 (UTC)
 * Thanks very much for your help, it was very appreciated. If you need anything, feel free to contact me. --giandrea 14:56, 17 July 2006 (UTC)

Could you teach me?
Hi, I'm a catalan that's trying to learn ANY celtic language but I've seen that there're not enough resources on-line to learn them (except Breton, that has this wonderful web |Kervarker.org). That's why I wonder if you could teach me Gaelic and, by the way, improve the poor (and chaotic too) wikibook on this subject. I got professional knowledge of catalan and spanish at a professional corrector level (though you cannot see this on my user page just because the fifth babel level has been not approved yet in the catalan wiki) so we can make an interesting language exchange. Wow! I cannot still belive that I've found somebody with professional knowledge of a celtic language!! Gangleri2001

Hi
I'm trying to learn Irish, and you seem like an interesting person. Would you mind adding me to your MSNM? 瀬人様 14:40, 7 September 2007 (UTC)

WINAD violation
Good afternoon, Dalta. You participated in an early discussion about whether the dork page rose above the level of a dictionary entry. After several discussions across different fora, I believe that there was a fairly clear consensus that it didn't. The page was transwiki'd to Wiktionary and later turned into a soft-redirect.

That soft-redirect has been undone by a user who does not seem to be interested in actually discussing the issue on Talk despite my best efforts. I am afraid that I am losing my impartiality on this issue and would appreciate other opinions. When you have time, would you please look at the page? Thanks. Rossami (talk) 20:00, 3 April 2008 (UTC)

WikiProject Films roll call and coordinator elections
Girolamo Savonarola (talk) 07:57, 1 September 2008 (UTC)

WikiProject Films August 2008 Newsletter
The August 2008 issue of the Films WikiProject newsletter has been published. You may read the newsletter, change the format in which future issues will be delivered to you, or unsubscribe from this notification by following the link. Thank you. This has been an automated delivery by BrownBot (talk) 23:40, 1 September 2008 (UTC)

WikiProject Films coordinator elections - voting now open!
Girolamo Savonarola (talk) 22:05, 17 September 2008 (UTC)

WP:FILMS Questionnaire
As a member of WikiProject Films, you are invited to take part in the project's first questionnaire. It is intended to gauge your participation and views on the project. At the conclusion of the questionnaire, the project's coordinators will use the gathered feedback to find new ways to improve the project and reach out to potential members. The results of the questionnaire will be published in next month's newsletter. If you know of any editors who have edited film articles in the past, please invite them to take part in the questionnaire. Please stop by and take a few minutes to answer the questions so that we can continue to improve our project. Happy editing! This has been an automated delivery by BrownBot (talk) 03:06, 10 January 2009 (UTC)

Sign in
If this is really you, you need to sign in and sign your comments using four tildes ( ~ ). Please refer to WP:SOCK. - ℅ ✰ ALLST☆R ✰ echo 00:55, 25 April 2009 (UTC)

History of guerrilla warfare
Interesting article, you should nominate it at T:TDYK and WP:MILCON. --Piotr Konieczny aka Prokonsul Piotrus 18:00, 4 May 2009 (UTC)

Irish Wikimedian mailing list
Greetings Dalta!

I'm pleased to announce that we've started a new Ireland Wikimedian email list, that you can join, at WikimediaIE. For Wikimedians in Ireland and Wikimedians interested in events in Ireland and efforts in Ireland. It's there to to discuss meetups, partnerships with Museums and National Archives, and anything else where Wikipedia and real life intersect :) --Bastique demandez 17:03, 14 May 2009 (UTC)

Postgrad Research
Hi Dalta,

I can see by your user page that you're inundated with requests regarding the Irish language/Vicipéid. I just wanted to add one more for good luck =) I'm doing some postgraduate research at the moment into open-content translations, particularly relating to Irish. With your involvement, I was wondering if you'd mind if I sent you on some concise questions on the topic?

My email is d.moloney2@lcc.arts.ac.uk, but feel free to contact me through my talk page either.

Thanks, Dave (talk) 13:11, 30 June 2010 (UTC)

Translation
Hi Dalta. We are looking for someone who could translate into Irish a page re an artistic literary movement founded in Italy in 2007: http://en.wikipedia.org/wiki/IMMAGINE%26POESIA Can you help us ? Thanks a lot--Aeron10 (talk) 19:01, 14 September 2010 (UTC)

Proposed deletion of Oliver Byrne

The article Oliver Byrne has been proposed for deletion  because of the following concern:
 * All links in reference section are dead

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

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

Please consider improving the article to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Comatmebro ~Come at me~ 04:35, 11 January 2014 (UTC)

Proposed deletion of Oliver Byrne

The article Oliver Byrne has been proposed for deletion  because of the following concern:
 * All references are dead links

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

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

Please consider improving the article to address the issues raised. Removing will stop the proposed deletion process, but other deletion processes exist. In particular, the speedy deletion process can result in deletion without discussion, and articles for deletion allows discussion to reach consensus for deletion. Comatmebro ~Come at me~ 05:18, 24 March 2014 (UTC)

Georges Méliès
Hello! Since you're a member of the French Cinema task force, I thought you might be interested in joining a discussion about Georges Méliès and how best to cover his pioneering films on Wikipedia. I've started the discussion here: Talk:Georges Méliès filmography

I'd greatly appreciate your thoughts and advice!--Lemuellio (talk) 23:45, 12 February 2015 (UTC)

Your account will be renamed
Hello,

The developer team at Wikimedia is making some changes to how accounts work, as part of our on-going efforts to provide new and better tools for our users like cross-wiki notifications. These changes will mean you have the same account name everywhere. This will let us give you new features that will help you edit and discuss better, and allow more flexible user permissions for tools. One of the side-effects of this is that user accounts will now have to be unique across all 900 Wikimedia wikis. See the announcement for more information.

Unfortunately, your account clashes with another account also called Dalta. To make sure that both of you can use all Wikimedia projects in future, we have reserved the name Dalta~enwiki that only you will have. If you like it, you don't have to do anything. If you do not like it, you can pick out a different name. If you think you might own all of the accounts with this name and this message is in error, please visit Special:MergeAccount to check and attach all of your accounts to prevent them from being renamed.

Your account will still work as before, and you will be credited for all your edits made so far, but you will have to use the new account name when you log in.

Sorry for the inconvenience.

Yours, Keegan Peterzell Community Liaison, Wikimedia Foundation 23:17, 19 March 2015 (UTC)

Renamed
 This account has been renamed as part of single-user login finalisation. If you own this account you can |log in using your previous username and password for more information. If you do not like this account's new name, you can choose your own using this form after logging in: . -- Keegan (WMF) (talk) 11:54, 22 April 2015 (UTC)

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

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

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article. JMHamo (talk) 19:12, 11 October 2015 (UTC)

ArbCom elections are now open!
MediaWiki message delivery (talk) 13:00, 23 November 2015 (UTC)

title: User talk:Dalta~enwiki


text:
Henry Schenck Tanner

Henry Schenck Tanner (c. 1786–1858), was an American cartographer, born in New York City.

He produced A Geographical and Statistical Account of the Epidemic Cholera from its Commencement in India to its Entrance into the United States in 1832 in response to the worldwide cholera epidemic of 1817.

Tanner wished to provide a geographic account of the spread of the disease, stating that other statistics concerning the epidemic were "given in such a loose and unconnected manner as to render a reference to them at once irksome and unprofitable." His publication included global, national and local maps, data tables showing number of deaths in different localities by country, and detailed maps of the United States and New York City with small red dots indicating points where the disease had broken out.

Tanner produced a map of Mexico in 1822, which became the basis for the map by John Disturnell in 1847, used in the boundary negotiations of the U.S. and Mexico following the Mexican–American War. Tanner's map contained some errors, reproduced by Disturnell.

In 1846, Tanner published A New Universal Atlas.

title: Henry Schenck Tanner


text:
Vive la Fête

Vive la Fête (Long live the party) are a Belgian music duo from Ghent, East Flanders, formed in 1997 by Danny Mommens (guitar, vocals) and Els Pynoo (vocals).

History
Vive la Fête was founded in 1997 when Mommens (then still playing in his former band dEUS) met Els at a party hosted by or for her sister. He had previously been an acquaintance of Pynoo's sister, who had photographed Els naked and had later showed the picture to Mommens. As Els stated in a 2005 interview; Mommens had approached her in a normal fashion and said randomly: "Hey I saw you naked!" Mommen's recorded a few demos with Pynoo on his 8-track recorder. These demos were released on the EP Je ne veux pas (sometimes also referred to as Paris) which gathered some attention for its resemblance to '80s new wave music. Their first success came with their debut Attaque Surprise (2000). Later records such as République Populaire (2001) and Nuit Blanche (2003) made them popular, especially in the fashion world, where Karl Lagerfeld was one of their fans, and has enlisted them to perform at a number of his big shows in New York City and Paris. In 2005 they released Grand Prix and toured all over Europe and played some shows in Brazil and Mexico.

Extended plays

 * Je ne veux pas (Kinky Star, 1998)
 * Tokyo (Surprise, 2000)
 * Schwarzkopf Remix (Surprise, 2004)
 * La vérité (Surprise, 2006)

title: Vive la Fête


text: User talk:80.43.85.192

title: User talk:80.43.85.192


text:
Yorman Bazardo

Yorman Michael Bazardo Osorio (born July 11, 1984) is a Venezuelan former professional baseball pitcher. He played in Major League Baseball (MLB) for the Florida Marlins, Detroit Tigers and Houston Astros.

Florida Marlins
Growing up, Bazardo played in Venezuelan youth leagues, where one of his competitors was future teammate (on two different MLB clubs) Miguel Cabrera. Bazardo got his break in 2000, when the Florida Marlins signed him as an undrafted free agent. His first season in the organization was in 2001, when he played for the now-defunct VSL Marlins in the Venezuelan Summer League, going 7–2 with a 2.43 earned run average (ERA). The Marlins moved him up to the single-A Jamestown Jammers in 2002, where he posted a 5–0 record with a 2.72 ERA and six saves. In 2003, he was promoted to the single-A Greensboro Bats and used primarily as a starting pitcher. Although he had a mixed record (9–8) his ERA remained a low 3.12. Typical was a game in August against the Hagerstown Suns in which he allowed just two runs over eight innings in a 2–0 loss.

2004 found Bazardo with the single-A Jupiter Hammerheads, where he went 5–9 with a 3.27 ERA; again, he suffered from a lack of run support and frequent errors which allowed unearned runs to score. At the end of the year the Marlins added Bazardo to their 40-man roster. A further sign of the Marlins confidence came in 2005, when Bazardo was invited to spring training, although he did not make the cut and was optioned to the double-A Carolina Mudcats. On May 26, 2005, Bazardo was called up by the Marlins to replace struggling relief pitcher Logan Kensing. Marlins manager Jack McKeon acknowledged that it was something of a gamble: "Who's to say he's not another Willis? Let's find out. Let's see if he can handle the situation. Some can't. Some can." Bazardo was rocked in his one relief appearance; giving up five runs (four of them earned) in 1$2/3$ innings, and the next day he was optioned to Carolina.

Bazardo stayed with the Mudcats through the end of July, going 8–7 with a 3.99 ERA, when he was traded with Mike Flannery to the Seattle Mariners for Ron Villone.

Seattle Mariners
The Mariners assigned Bazardo to the Double-A San Antonio Missions where he went 3–1 with a 4.28 ERA. In 2006, he was named Missions pitcher of the year after going 6–5 with a 3.64 ERA in 25 starts. He was also named to the Texas League post season all-star team. Over the winter Bazardo played in the Venezuelan Winter League, where he was 2–0 with a 1.78, and threw six shutout innings in the Caribbean World Series. The Mariners added Bazardo to their 40-man roster, but designated him for assignment after acquiring veteran pitcher Jeff Weaver. Rather than lose him outright, the Mariners traded Bazardo to the Detroit Tigers for outfielder Jeff Frazier on February 7, 2007.

Detroit Tigers
The Tigers sent Bazardo to the Triple-A Toledo Mud Hens where he spent most of the 2007 season, posting a 10–6 record with an ERA of 3.75. Bazardo was called up several times in 2007 to fill in for the injury-plagued Tigers, cobbling together a 2–1 record with a 2.38 ERA in 11 appearances.

Bazardo began the 2008 season with the Tigers, but was designated for assignment after giving up eight runs over three innings in three appearances. After clearing waivers Bazardo rejoined the Mud Hens. He became a free agent at the end of the season.

Philadelphia Phillies
In December 2008, Bazardo signed a minor league contract with the Philadelphia Phillies. He was subsequently released by the organization in April 2009.

Houston Astros
On January 7, 2009, Bazardo signed a minor league contract with the Houston Astros. Assigned to their AAA affiliate, the Round Rock Express, Bazardo was named a Pacific Coast League midseason All-Star. On August 8, the Astros purchased Bazardo's contract, and he pitched in ten games for Houston through the end of the season, making six starts. He pitched in the minors for Houston in 2010 before becoming a free agent.

Minnesota Twins
On November 14, 2010, Bazardo signed a minor league contract with the Minnesota Twins. He was released on June 16, 2011.

Later career
In 2011, Bazardo pitched for the Camden Riversharks of the Atlantic League of Professional Baseball, registering a 7.50 ERA across 4 games for the club. After not playing affiliated ball in 2012, Bazardo joined the Telemarket Rimini of the Italian Baseball League for the 2013 season, pitching to a 4–0 record and 2.59 ERA across 7 appearances. On April 30, 2014, Bazardo signed with the Broncos de Reynosa of the Mexican League. That season, he recorded a 5–5 record and 4.11 ERA with 47 strikeouts across 18 games.

International career
He was selected to the roster for the Venezuela national baseball team at the 2015 WBSC Premier12.

Personal life
Bazardo's younger brother Eduard made his MLB debut in April 2021 with the Boston Red Sox.

title: Yorman Bazardo


text: Category:Anti-globalization

title: Category:Anti-globalization


text: User talk:69.204.145.79

title: User talk:69.204.145.79


text:
Dependent ML

Dependent ML is an experimental, multi-paradigm, general-purpose, high-level, functional programming language proposed by Hongwei Xi and Frank Pfenning. It is a dialect of the programming language ML. Dependent ML extends ML by a restricted notion of dependent types: types may be dependent on static indices of type  (natural numbers). Dependent ML employs a constraint theorem prover to decide a strong equational theory over the index expressions.

DML's types are not dependent on runtime values - there is still a phase distinction between compilation and execution of the program. By restricting the generality of full dependent types type checking remains decidable, but type inference becomes undecidable.

Dependent ML has been superseded by ATS and is no longer under active development.

title: Dependent ML


text:
User talk:Falcorian

Write a new message. I will reply on this page, under your post, and probably also make a copy onto your page of the whole discussion just to keep all replies together while still letting you know I have replied to your comment.

"NS(A)" listed at Redirects for discussion
The redirect [//en.wikipedia.org/w/index.php?title=NS(A)&redirect=no NS(A)] has been listed at redirects for discussion to determine whether its use and function meets the redirect guidelines. Anyone, including you, is welcome to comment on this redirect at  until a consensus is reached. Steel1943 (talk) 21:16, 21 July 2023 (UTC)

ArbCom 2023 Elections voter message
 Hello! Voting in the 2023 Arbitration Committee elections is now open until 23:59 (UTC) on. All eligible users are allowed to vote. Users with alternate accounts may only vote once.

The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to impose binding solutions to disputes between editors, primarily for serious conduct disputes the community has been unable to resolve. This includes the authority to impose site bans, topic bans, editing restrictions, and other measures needed to maintain our editing environment. The arbitration policy describes the Committee's roles and responsibilities in greater detail.

If you wish to participate in the 2023 election, please review the candidates and submit your choices on the voting page. If you no longer wish to receive these messages, you may add to your user talk page. MediaWiki message delivery (talk) 00:21, 28 November 2023 (UTC)

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

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

Users may edit the article during the discussion, including to improve the article to address concerns raised in the discussion. However, do not remove the article-for-deletion notice from the top of the article until the discussion has finished. DirtyHarry991 (talk) 06:34, 21 December 2023 (UTC)

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

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

Reminder to vote now to select members of the first U4C

 * You can find this message translated into additional languages on Meta-wiki.

Dear Wikimedian,

You are receiving this message because you previously participated in the UCoC process.

This is a reminder that the voting period for the Universal Code of Conduct Coordinating Committee (U4C) ends on May 9, 2024. Read the information on the voting page on Meta-wiki to learn more about voting and voter eligibility.

The Universal Code of Conduct Coordinating Committee (U4C) is a global group dedicated to providing an equitable and consistent implementation of the UCoC. Community members were invited to submit their applications for the U4C. For more information and the responsibilities of the U4C, please review the U4C Charter.

Please share this message with members of your community so they can participate as well.

On behalf of the UCoC project team,

RamzyM (WMF) 23:18, 2 May 2024 (UTC)

title: User talk:Falcorian


text:
Orphon

An orphon is a gene located outside the main chromosomal locus, i.e., it may be dispersed to an unconnected genomic location.

Orphons have been found in both protein-coding and non-protein-coding gene families, which suggests that most gene transcription processes do not constitute a restriction on the development of orphons. Extensive polymorphism in this feature between individuals of the same species was shown. The gene class was first discovered in yeast, sea urchins, and fruitflies, and has since been reported from the genome of many other eukaryote groups including molluscs, amphibians, and mammals including humans.

title: Orphon


text:
Light dressed state

In the fields of atomic, molecular, and optical science, the term light dressed state refers to a quantum state of an atomic or molecular system interacting with a laser light in terms of the Floquet picture, i.e. roughly like an atom or a molecule plus a photon. The Floquet picture is based on the Floquet theorem in differential equations with periodic coefficients.

Mathematical formulation
The Hamiltonian of a system of charged particles interacting with a laser light can be expressed as

where $$\mathbf{A}$$ is the vector potential of the electromagnetic field of the laser; $$\mathbf{A}$$ is periodic in time as $$\mathbf{A}(t+T)=\mathbf{A}(t)$$. The position and momentum of the $$i\,$$-th particle are denoted as $$\mathbf{r}_i \,$$ and $$\mathbf{p}_i \,$$, respectively, while its mass and charge are symbolized as $$m_i \,$$ and $$z_i \,$$, respectively. $$c \,$$ is the speed of light. By virtue of this time-periodicity of the laser field, the total Hamiltonian is also periodic in time as

H(t+T) = H(t) \,. $$ The Floquet theorem guarantees that any solution $$\psi(\{\mathbf{r}_i\},t)$$ of the Schrödinger equation with this type of Hamiltonian,

i\hbar \frac{\partial}{\partial t} \psi(\{\mathbf{r}_i\},t) = H(t)\psi(\{\mathbf{r}_i\},t) $$ can be expressed in the form

\psi(\{\mathbf{r}_i\},t) = \exp[-iEt/\hbar]\phi(\{\mathbf{r}_i\},t) $$ where $$\phi\,$$ has the same time-periodicity as the Hamiltonian, $$ \phi(\{\mathbf{r}_i\},t+T) = \phi(\{\mathbf{r}_i\},t). $$ Therefore, this part can be expanded in a Fourier series, obtaining

where $$\omega (=2\pi/T)\,$$ is the frequency of the laser field. This expression (2) reveals that a quantum state of the system governed by the Hamiltonian (1) can be specified by a real number $$E\,$$ and an integer $$n\,$$.

The integer $$n\,$$ in eq. (2) can be regarded as the number of photons absorbed from (or emitted to) the laser field. In order to prove this statement, we clarify the correspondence between the solution (2), which is derived from the classical expression of the electromagnetic field where there is no concept of photons, and one which is derived from a quantized electromagnetic field (see quantum field theory). (It can be verified that $$n\,$$ is equal to the expectation value of the absorbed photon number at the limit of $$n\ll N\,$$, where $$N\,$$ is the initial number of total photons.)

title: Light dressed state


text:
1982–83 Bundesliga

The 1982–83 Bundesliga was the 20th season of the Bundesliga, West Germany's premier football league. It began on 17 August 1982 and ended on 4 June 1983. Hamburger SV were the defending champions.

Competition modus
Every team played two games against each other team, one at home and one away. Teams received two points for a win and one point for a draw. If two or more teams were tied on points, places were determined by goal difference and, if still tied, by goals scored. The team with the most points were crowned champions while the two teams with the fewest points were relegated to 2. Bundesliga. The third-to-last team had to compete in a two-legged relegation/promotion play-off against the third-placed team from 2. Bundesliga.

Team changes to 1981–82
SV Darmstadt 98 and MSV Duisburg were directly relegated to the 2. Bundesliga after finishing in the last two places. They were replaced by FC Schalke 04 and Hertha BSC. Relegation/promotion play-off participant Bayer 04 Leverkusen won on aggregate against Kickers Offenbach and thus retained their Bundesliga status.

Relegation play-offs
FC Schalke 04 and third-placed 2. Bundesliga team Bayer 05 Uerdingen had to compete in a two-legged relegation/promotion play-off. Uerdingen won 4–2 on aggregate and thus were promoted to the Bundesliga.

title: 1982–83 Bundesliga