text:
Talk:Superheating

Superheated fluid in nature
"Because a superheated fluid is the result of artificial circumstances" - I remember watching a program on undersea life, and it said that underwater volcanoes can heat water to extremely high temperatures, but because of the immense pressure it does not turn into a gas. I cannot remember the name of the program, and thus there is no source. But I'm sure that superheating occurs in nature.

Still, this woulnd't count as superheating, since it is true that at those pressures, water isn't at its boiling point. As the pressure increases, so does the boiling point- and thus those underwater vents don't actually superheat. Superheating requires that the temerature exceeds the boiling point, something that I'm doubtful can happen in nature.

it was on the whale program on bbc1 just now Wolfmankurd 19:26, 31 May 2006 (UTC)

Microwave Section Rewrite
This paragraph needs a rewrite.

"However, that is not to say that an old container automatically is safe. It may happen that you have heated water in an old glass hundreds of times with no problem, then one day while you are doing that the phone rings and you shut down the microwave just to be safe. Ten minutes later, when you heat the water again, you touch the glass and it explodes. The problem is that the scratches holding bubbles, first of air and then of water vapor, were preventing the water from exploding, but when you heat it and let it cool all the bubbles are reabsorbed, so when reheating there are no nucleation points." Bold added for emphasis JohnJohn 04:47, 2 November 2006 (UTC)

I think the term 'common' is probably misleading, since even the linked documeunt (snopes) says true but rare. I don't think this is even a truely relevent section for that matter.

 * I have experienced "exploding" water from a microwave years ago but I could not comprehend what happened. My son had some superheated chowder explode and burn his face a few days ago. My comments are 1)the microwave section is relevant, 2) currently the references to the microwave are about water, not about a fluid like chowder. I did not just go and change the word water to fluid because it may not be fully supported by the reference. Thanks for the great info. Jim Derby (talk) 15:19, 2 January 2014 (UTC)

Clarify
To prevent this, adding something to the water prior to heating it is suggested.

This cannot be let this way in the article, and has to be subst. clarified. Otherwise it should rather be replaced with a more forceful warning. --Slicky 11:25, 16 February 2006 (UTC)

What is your source for slow nucleation => superheating?

CaveShvig

I think there are major problems with your "microwaving" discussion. The liquid / solvent system boiling point changes with the addition of an electrolyte. The system is not superheated because it is not above the boiling point!

CaveShvig

elaborate please —Preceding unsigned comment added by 203.39.51.116 (talk) 04:40, 5 August 2010 (UTC)

"Defervescence"?
This term was cute, but struck me as odd. The meaning of this term is the subsidence of a fever, and has nothing to do with superheating (although the root words are related). A quick google search showed that all but one indexed incidences of this word in the context of superheating go back to the text in the Wikipedia article. Adding a search term that removed pages with text from the article was used to narrow it down, and the only pages remaining were a few spam sites, sites using the correct fever-relating meaning of the word, some translations of the wiki text that left the word unchanged, and the previously mentioned single page.

On the page where it was used outside of the context of the article, the author appeared to be new to the word, and I have a hunch he got it from the article in question.

I realize that Google is not good research material, however I think it can be used here as compelling given the lack of research provided in support of the assertion, unless someone comes up with a real citation.

Relevant search terms in Google.

The only page I could find that actually uses the term this way.

134.50.7.201 10:18, 17 December 2006 (UTC)

After more searching of French-language pages (the redirect asserts that "defervescence" means superheating in French), I still can't find any pages using the term in any context other than relating to the fever-related medical condition. I believe the redirect's assertion is bogus as well.

134.50.7.201 10:30, 17 December 2006 (UTC)

Superheated steam?
Is superheating with regards to superheated steam a different sort of superheating? There, it refers to heating water again after it has become steam, so that the steam can reach temperatures above 100 degrees Celsius at sea level (300 degrees is possible). The article seems to be referring to something else. --204.4.131.140 11:15, 29 October 2007 (UTC)
 * Uhm... water in liquid form and an normal pressure can reach 100C before is turns into stream... but after that, the gaseous water can - of course - be heated as much as you like (until it becomes plasma).... just as ice can be cooled significanlt below 0C.

 * So... what is the question here? I'm not sure I understand you. --J-Star 12:28, 29 October 2007 (UTC)

No superheated steam is different and should have its own page. xbgs351 11 March 2008 —Preceding unsigned comment added by 123.243.254.204 (talk) 00:31, 11 March 2008 (UTC)

Impure water and superheating
I've made some amendments to the following part of the article so that it's now clearer.

"However this is very, very rare and can only happen under certain conditions, like the water having no impurities. Any foreign object in the water, whether it be a spoon or a salt cube, greatly diminishes the chance of an explosion because it provides nucleation sites."

This information is wrong according to this. Anyone care to try microwaving cooled coffee and adding sugar to it?

Mysterial (talk) 11:38, 23 November 2007 (UTC)

 * Placed it under another section as Myth to avoid confusion and did a slight bit of rewriting and cited sources. Mysterial (talk) 08:07, 24 November 2007 (UTC)

Impure substances without seed-bubbles cannot superheat?
This is untrue because nucleation points for boiling do not include solid nucleation centres, but rather, seed-bubbles that occur due to the presence of solid nucleation centres. In other words, if there are solid nucleation centres in a substance (e.g. impure water) but without seed-bubbles (e.g. leaving impure water to stand or boiling it once to rid the water of the bubbles), superheating cannot occur.

This seems internally contradictory and inconsistent with the cited sources. The last sentence perhaps should read instead, "...if there are solid nucleation centres in a substance but without seed-bubbles, superheating will occur."

Mechanics Section Rewrite?
The mechanics section reintroduces the "microwaving coffee" example several times. The section should be rewritten to condense the paragraphs about this phenomena into one. —Preceding unsigned comment added by W09110900 (talk • contribs) 17:25, 1 July 2008 (UTC)

The Myth of the Boiling Point by Hasok Chang
Might be of interest here, especially the part on the superheating race.

Superheat: The Best Way to Tune an Air Conditioning System
http://contractingbusiness.com/residential/cb_imp_17963/ I think this should be added to this topic as it is The Method to determine air conditioning (and heat pump) performance. I will put it in my own words in the future. Please read link and make suggestions or feedback to me thanks!Avaghnn (talk) 02:04, 2 December 2011 (UTC)

 * I read the link. I can't tell if the term "superheat" in that link is really referring to the same thing as this WP article. That's not to say it isn't relevant, but I just want you to be aware that they could be talking about something completely different. And therein lies a big problem with the link: the wording isn't very clear. They just say "hotter than the boiling point"; they don't say it's because of lack of nucleation sites or what.  They further the confusion (in my mind anyway) by using "superheat" as a noun.  Spiel496 (talk) 18:38, 5 December 2011 (UTC)

RE comparison with balloons
The following sentence needs clarification (source, more details, etc):

"What makes superheating so explosive is that a larger bubble is easier to inflate than a small one; just as when blowing up a balloon, the hardest part is getting started."

There are multiple reasons why starting to blow a balloon requires more effort than inflating it further, many of which can be traced back to material deformation and elasticity of the rubber/latex/whatever. As I understand it, initially the material is rather far from its deformation point, and you need to apply sufficient air pressure to first get it to that point before you can observe the balloon actually inflating in response to the increased pressure. None of this applies "apples-to-apples" for surface tension; though parallels may certainly be drawn, it seems a little too simplistic and lacking in scientific rigor as currently composed. Mahmoud (talk) 21:38, 18 March 2024 (UTC)

title: Talk:Superheating


text:
Gomelavia

Gomelavia (Авіякампанія Гомельавія; Авиакомпания Гомельавиа) was an airline based in Gomel, Belarus.

History
The airline was established in 1996 and operated domestic and regional, scheduled and chartered services, as well as aerial work using fixed-wing aircraft and helicopters. Its main base was Gomel Airport. The state-owned company ceased operations on 22 February 2011.

Destinations
At the time of its closure, Gomelavia served Minsk, Kaliningrad and Moscow from its base at Gomel.

Last fleet
When it was shut down in 2011, Gomelavia operated the following aircraft:
 * 3 Antonov An-24

Historic fleet
In 2007, the fleet had included the following aircraft:
 * 1 Antonov An-12BP
 * 1 Antonov An-12PS
 * 4 Ilyushin Il-76TD
 * 3 Ilyushin Il-76
 * 1 Tupolev Tu-134A-3

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

title: Gomelavia


text: Category:Swiss photographers

title: Category:Swiss photographers


text: File:Killing Joke Brighter Than A Thousand Suns Cover.jpg


text:
User:Talrias/Templates/Box free/oldpeerreview

  has had feedback from the Wikipedia community.

This peer review should have given a number of suggestions which may help you when improving this article.


text:
Talk:Gedenkdienst

Text source
The text is copied from this page: http://www.gedenkdienst.info/english.htm with the approval of the organization. Infos: maislinger@hrb.at --Wallnerm 11:51, 14 Apr 2005 (UTC)

Partner organizations - many deletions
In this edit by User:Philipp2070, many partner organizations were deleted. I know for a fact that one particular deletion is in error. In this single case I've restored the content as it originally appeared and added the starting year. However: if all the other deletions are no longer partner organizations but did participate at one time, I support maintaining that information on the page with a start and end date for the sake of historical accuracy. I would appreciate other editors' help in rectifying the information on this page. -- Deborahjay (talk) 15:00, 17 September 2011 (UTC)

Two faces
Austrian (German) and English name and description of the organizaion are different. Xx234 (talk) 07:57, 12 January 2015 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Austrian Holocaust Memorial Service. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive http://web.archive.org/web/20050411005425/http://www.gedenkdienst.info:80/ to http://www.gedenkdienst.info

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

Cheers.—cyberbot II  Talk to my owner :Online 03:35, 21 March 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 3 one external links on Austrian Holocaust Memorial Service. 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/20140531124436/http://old.auslandsdienst.at/press/archive/unipress_10.1997.html to http://old.auslandsdienst.at/press/archive/unipress_10.1997.html
 * Added tag to http://www.auschwitz.be/content/index.php?lg=english/
 * Added archive https://web.archive.org/web/20061209134056/http://www.jmuseum.lt:80/ to http://www.jmuseum.lt/
 * Added archive https://web.archive.org/web/20070219064823/http://www.unr.edu:80/chgps/blank.htm to http://www.unr.edu/chgps/blank.htm

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

Cheers.— InternetArchiveBot  (Report bug) 03:12, 22 October 2016 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified 4 external links on Austrian Holocaust Memorial Service. 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/20110104130945/http://www.cjss.org.cn/200610182.htm to http://www.cjss.org.cn/200610182.htm
 * Added tag to http://www.austria.org/content/view/440/147/
 * Added tag to http://www.auschwitz.be/content/index.php?lg=english%2F
 * Added archive https://web.archive.org/web/20061209134056/http://www.jmuseum.lt/ to http://www.jmuseum.lt/
 * Added archive https://web.archive.org/web/20070219064823/http://www.unr.edu/chgps/blank.htm to http://www.unr.edu/chgps/blank.htm
 * Corrected formatting/usage for http://www.gedenkdienst.info/

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) 06:34, 12 July 2017 (UTC)

Requested move 26 January 2022

 * 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 after discussing it on the closer's talk page. No further edits should be made to this discussion.

The result of the move request was: moved. (closed by non-admin page mover) Extraordinary Writ (talk) 06:03, 13 February 2022 (UTC)

Austrian Holocaust Memorial Service → Gedenkdienst – Frequent use of the word "Gedenkdienst" in English-language media; Translation no longer necessary Günther03 (talk) 21:42, 26 January 2022 (UTC) The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.
 * Support per nom. -- Necrothesp (talk) 16:16, 2 February 2022 (UTC)

title: Talk:Gedenkdienst


text:
The Bodyguard (soundtrack)

The Bodyguard: Original Soundtrack Album is a soundtrack album from the film of the same name, released on November 17, 1992, by Arista Records. The album's first side (in its original LP and cassette formats) features songs recorded by American singer Whitney Houston, who starred in the film, while side two features the work of various artists. Houston and Clive Davis were co-executive producers of the record.

The Bodyguard was praised by music critics for Houston's vocal performance and its production. The album was a massive global success, hitting number one in eighteen countries and going top ten in dozens of other countries. In the United States, the album gave Houston the distinction of having the most weeks at number one by a female artist on Billboard 200, holding that record for 19 years until being surpassed by Adele's album 21 (2011). The Bodyguard is certified Diamond by the Recording Industry Association of America, which gives Houston three Diamond selling albums.

It became the first album verified by the Nielsen SoundScan to sell over one million copies within a single week. At one point, the album was selling over a million copies per week for several weeks in a row. With sales of over 45 million copies worldwide, The Bodyguard is the best-selling soundtrack album of all-time, as well as the best selling album by a woman in music history, and the second best selling album of the decade. The soundtrack won the Grammy Award for Album of the Year.

In honor of the 25th anniversary of the soundtrack's release, Legacy Recordings and the Whitney Houston Estate released I Wish You Love: More from The Bodyguard, which included a collection of never-before-released live recordings from Houston's historic The Bodyguard World Tour (1993–1994), alternate versions of the audio recordings from The Bodyguard film, and an alternate version of a remix of "I'm Every Woman".

Background
Houston and Clive Davis served as co-executive producers of the album. Houston planned to record "What Becomes of the Broken Hearted" as the film's theme song; however, when they learned Paul Young's version would be used in the film Fried Green Tomatoes, they searched for another song. Kevin Costner, the film's co-star, thought of recording "I Will Always Love You", originally released by Dolly Parton. While recording the album, Houston insisted on using her touring band as opposed to a studio band.

Of the six songs recorded for the soundtrack by Houston, the first song recorded and produced for the film was "Queen of the Night" on 9 November 1991, prior to commencement of the film's principal photography on 25 November 1991. Followed by both "I Have Nothing" and "Run to You" in tandem on 12 November 1991, also recorded during pre-production stages.

A number of songs were also recorded during active production film production by Houston, in "Jesus Loves Me" between January-February 1992, and the theme song on 22 April 1992 at Ocean Way Recording. Recorded as the last of the six tracks for the soundtrack by Houston, during post-production phases, was the cover of Chaka Khan's, "I'm Every Woman", on 19 August 1992.

Music
The album's first half features six pop songs performed by Houston. Houston's cover of Dolly Parton's plaintive country ballad "I Will Always Love You" is a grand pop-gospel declaration of lasting devotion to a departing lover. "I Have Nothing" and "Run to You" are ballads featuring Houston's characteristic stentorian delivery, and both received Oscar nominations. "Jesus Loves Me" is sung with Bebe Winans and features a pop arrangement.

AllMusic editor Stephen Thomas Erlewine views that the first half is characterized by urban pop songs similar to I'm Your Baby Tonight (1990), while the second half has miscellaneous tracks more "typical of a big-budget soundtrack", including an excerpt from Alan Silvestri's score, instrumentals by Kenny G, and contemporary pop and dance songs. "Someday (I'm Coming Back)", performed by Lisa Stansfield, is an intense pop-disco song.

Singles
The album is most notable for Houston's version of "I Will Always Love You", written by Dolly Parton. The song received huge airplay, appealing to the pop, R&B, adult contemporary, and soul radio markets. The single spent 14 weeks at number one on the Billboard Hot 100 singles chart. "I Will Always Love You" was successful worldwide, peaking at number one for 14 weeks in New Zealand, 10 weeks in the UK and Australia, 9 weeks in Norway, 8 weeks in France and Switzerland, 6 weeks in the Netherlands, and 3 weeks in Sweden.

With the next two Top 5 singles "I'm Every Woman" (originally a Chaka Khan hit) and "I Have Nothing", following on the heels of "I Will Always Love You", Houston became the first female act to have three songs in the Top 20 simultaneously. Two songs, "Run to You" and "I Have Nothing", were each nominated for the Academy Award for Best Original Song, but lost out to "A Whole New World" from the animated film Aladdin. The same two songs were nominated for Grammy Awards in the category Best Song Written Specifically for a Motion Picture or for Television. Other songs garnering significant radio airplay included "Jesus Loves Me" on gospel stations, and "Queen of the Night" on pop and dance stations.

Commercial performance
The Bodyguard debuted at number two on the Billboard 200 chart and the Billboard Top R&B/Hip-Hop Albums chart, behind Ice Cube's The Predator, selling 144,500 copies in its first week. In its second week, the album topped both of the charts, with sales of 292,000 units. While the album stayed the summit on the charts, it broke the record for the most one-week sales twice. In its fifth week, it sold 831,000 copies, breaking the old sales record of 770,000 set by Guns N' Roses' Use Your Illusion II in the fall of 1991. The following week, the album once again set a record for the most albums sold in a single week, since the Nielsen SoundScan introduced a computerized sales monitoring system in May 1991; when it sold 1,061,000 copies, making it the first album to sell over 1 million copies in one week since tracking began. The soundtrack stayed at number one for 20 non-consecutive weeks on the Billboard 200 chart, and spent eight consecutive weeks atop the Top R&B Albums chart, remaining on the charts for a total of 141 weeks and 122 weeks, respectively. The album held the record for the most weeks at number one, and the record for the most non-consecutive chart-topping weeks on the Billboard 200 chart in the Nielsen SoundScan era until 2012 when it was overtaken by Adele's 21 which spent 24 non-consecutive weeks at the summit.

The Bodyguard soundtrack was ranked #1 in the 1993 Billboard year-end charts, on the Top Billboard 200 Album and Top R&B/Hip-Hop Album. In addition, the album was the first in Nielsen SoundScan history to rank among the top three albums in two consecutive years (#3 for 1992, #1 for 1993), and the best-selling soundtrack by the National Association of Recording Merchandisers (NARM) in 1993–1994. When the soundtrack to The Bodyguard was credited as a Whitney Houston album in Billboard archives, she became the only artist with three albums to remain on top of the Billboard 200 chart for over ten weeksㅡWhitney Houston (14 weeks), Whitney (11 weeks) and The Bodyguard (20 weeks). Houston also broke the record for the most cumulative weeks at number one by a female artist with 46 cumulative weeks until Taylor Swift surpassed it on 2020 with her album "Folklore".

The album received the largest initial certification of any album for 6× platinum by the Recording Industry Association of America (RIAA) on January 18, 1993. The record was broken by 'N SYNC's No Strings Attached, certified 7× Platinum initially in April 2000. On March 16, 1999, when the RIAA launched the Diamond Awards, honoring sales of 10 million copies or more of an album or single, the album received the award with 62 other albums initially. It was certified 17× Platinum by the RIAA on November 1, 1999, becoming the best-selling soundtrack album of all-time in United States. According to a new update from Whitney Houston's estate, particularly, Arista, The Bodyguard soundtrack has been certified 18× Platinum by RIAA in November 2017. It is the first album to reach both the 10 million and 11 million sales mark in the US since 1991, when Nielsen SoundScan started tracking music sales. As of late 2014, it had sold 12,140,000 copies; it is the sixth best-selling album of the SoundScan era in the United States.

In 1992–1993, with the huge international success of the film The Bodyguard, the soundtrack was also a phenomenal hit worldwide. It topped the albums chart in Australia for five weeks, Austria for nine weeks, Canada for 12 weeks, France for eight weeks, Germany for 11 weeks, Hungary for two weeks, Italy for two weeks, Japan for two weeks, Netherlands for six weeks, New Zealand for eight weeks, Norway for six weeks, Sweden for four weeks and Switzerland for nine weeks. In the United Kingdom, the album didn't chart on the main albums chart because compilation albums were excluded from the main albums chart from January 1989. Instead, the album reached the top on the official compilation albums chart and stayed there for 11 weeks, spending 60 non-consecutive weeks in the top 10 and for a total of 107 weeks on the chart. Through its massive success across Europe, it topped the European Top 100 Albums chart for 15 non-consecutive weeks. In the UK, the album was certified 7× platinum by the British Phonographic Industry (BPI) on January 1, 1994, and has sold 2,255,000 copies, landing at number sixty on the list of UK's 100 best-selling albums of all time. In Japan, it was certified 2× million by the Recording Industry Association of Japan (RIAJ) in 1994, the first time a foreign artist achieved that feat in Japanese music history, and eventually became the best-selling foreign album with 2.8 million copies sold. The record was later broken by Mariah Carey's #1's, certified 3× million in 1998. In Germany, the album has sold more than 1.7 million, earning 3× platinum awards by the Bundesverband Musikindustrie (BVMI). In addition, it was awarded Diamond for the sales of over 1 million in both France and Canada. It was certified 3× platinum in Brazil, becoming one of the best-selling international album by a female artist and set a record for the best-selling foreign album with the sales of 1.2 million over in South Korea. In Australia, it became the best selling album of 1993. In Mexico, the soundtrack sold more than 500,000 copies, making it the best-selling English-language record in 1994. To date, the album has sold 45 million copies worldwide, making it the best-selling soundtrack of all time.

I Wish You Love: More from The Bodyguard
I Wish You Love: More from the Bodyguard is the 25th anniversary reissue of the album, released by Legacy Recordings on November 17, 2017. The album was released to commemorate the 25th anniversary of the movie, The Bodyguard, which marked Houston's film debut. It includes the film versions of her six Bodyguard contributions – "I Will Always Love You", "I Have Nothing", "I'm Every Woman", "Run to You", "Queen of the Night" and "Jesus Loves Me" – as well as remixes and live performances of the songs from subsequent tours.

The album's release coincided with a tribute to Houston and the music of The Bodyguard at the American Music Awards on Nov. 19 on ABC as performed by Christina Aguilera. Ahead of the performance, Aguilera wrote on Instagram, “I am excited, honored and humbled to perform a tribute to one of my idols.”

Track listing
All songs performed by Whitney Houston, except where noted.

Notes
 * On the US edition, Kenny G's "Waiting for You" was not included, with Alan Silvestri's "Theme from The Bodyguard" appearing in its track place (before Joe Cocker feat. Sass Jordan's "Trust in Me")

Personnel
"I Will Always Love You"
 * Whitney Houston – vocals, vocal arrangement
 * David Foster – producer, arranger
 * Rickey Minor – director
 * Kirk Whalum – saxophone & solo
 * Ricky Lawson – drums
 * David Foster – keyboard
 * Dean Parks & Michael Landau – guitars
 * Neil Stubenhaus – bass
 * Tony Smith & Claude Gaudette – synth programming
 * Bill Schnee, Dave Reitzas & Peter J. Yianilos – recording engineers
 * Dave Reitzas – mixing engineer
 * Hal Belknap – assistant mixing engineer

"I Have Nothing"
 * Whitney Houston – vocals
 * Jeremy Lubbock – string arrangement
 * David Foster – keyboards, bass, string arrangement, producer, arranger
 * Michael Landau – guitar
 * Simon Franglen – Synclavier and synth programming
 * Dave Reitzas – recording engineer
 * Mick Guzauski – mixing engineer

"I'm Every Woman"
 * Whitney Houston – vocals
 * Narada Michael Walden – producer
 * Robert Clivilles – additional vocal arrangement and production, remix
 * David Cole – additional vocal arrangement and production, remix
 * Vocal arrangement inspired by Chaka Khan
 * Louis Biancaniello – programming
 * James Alfano – programming
 * Chauncey Mahan – programming
 * Matt Rohr – recording engineer
 * Marc Reyburn – recording engineer
 * Acar S. Key – additional production recording engineer
 * Bob Rosa – mixing engineer

"Run to You"
 * Whitney Houston – vocals
 * David Foster – producer, arrangement, string arrangement, bass
 * Jud Friedman – arrangement, keyboards
 * William Ross – string arrangement
 * John Robinson – drums
 * Dean Parks – acoustic guitar
 * Simon Franglen – Synclavier and synth programming
 * Dave Reitzas – recording engineer
 * Mick Guzauski – mixing engineer

"Queen of the Night"
 * Whitney Houston – vocals, co-producer, vocal arrangement
 * L.A. Reid – producer, drum programming
 * Babyface – producer, keyboard, organ, bass and drum programming
 * Daryl Simmons – co-producer
 * Kayo – bass
 * Donald Parks – programming
 * Randy Walker – programming
 * Vernon Reid – guitar solo
 * Barney Perkins – recording engineer
 * Milton Chan – recording engineer
 * Dave Way – mixing engineer
 * Jim "Z" Zumpano – mixing engineer

"Jesus Loves Me"
 * Whitney Houston – vocals, producer, vocal arrangement
 * BeBe Winans – vocals, background vocals
 * Cedric J. Caldwell – arrangement
 * BeBe Winans – vocal arrangement, arrangement
 * Ron Huff – string arrangement
 * Richard Joseph – additional production recording engineer
 * Alvin Chea – background vocals
 * Claude McKnight III – background vocals
 * Paul Jackson Jr. – guitar
 * Victor Caldwell – bass, drum programming, recording engineer
 * Mike McCarthy – recording engineer
 * Dave Reitzas – mixing engineer

"Even If My Heart Would Break"
 * Kenny G – performer, arrangement
 * Aaron Neville – performer
 * David Foster – producer, arranger
 * Walter Afanasieff – producer, piano, drum programming, bass and organ
 * Randy Kerber – keyboards
 * John Robinson – drums
 * Michael Thompson – guitar
 * Ren Klyce – synth programming
 * Gary Cirimelli – synth programming
 * Humberto Gatica – recording engineer
 * Manny LaCarrubba – additional engineering
 * Dana Jon Chappelle – additional engineering
 * Steve Sheppard – additional engineering
 * Kevin Becka – additional engineering, assistant engineer
 * Steve Sheppard – assistant engineer
 * Mick Guzauski – mixing engineer

"Someday (I'm Coming Back)"
 * Lisa Stansfield – vocals
 * Ian Devaney – producer- mixing
 * Andy Morris – producer, mixing
 * Jazz Summers – executive producer
 * Tim Parry – executive producer
 * Bobby Boughton – engineer, mixing

"It's Gonna Be a Lovely Day"
 * The S.O.U.L. S.Y.S.T.E.M. – performer
 * Michelle Visage – featured artist
 * Robert Clivilles – producer, arranger, mixing, rap vocal production
 * David Cole – producer, arranger, mixing, vocal arrangement
 * Ricky Crespo – assistant producer
 * Duran Ramos – rap vocal production
 * Acar S. Key – recording and mixing engineer
 * Bruce Miller – additional mixing

"(What's So Funny 'Bout) Peace, Love and Understanding?"
 * Curtis Stigers – performer
 * Danny Kortchmar – producer
 * Marc DeSisto – recording and mix engineer

"Theme from The Bodyguard"
 * Alan Silvestri – composer, producer
 * William Ross – orchestrations
 * Gary Grant – trumpet solo
 * Dennis Sands – engineer
 * Bill Easystone – assistant engineer
 * Gary Carlson – technical engineer
 * Jim Walker – technical engineer

"Trust in Me"
 * Joe Cocker – vocals
 * Sass Jordan – featured artist
 * Charlie Midnight – producer
 * John Rollo – recording engineer
 * Chris Lord-Alge – mixing engineer

Production and design

 * Clive Davis – executive producer
 * Whitney Houston – executive producer
 * Roy Lott – producer
 * Gary LeMel – Warner Bros. music executive
 * Maureen Crowe – music supervisor
 * George Marino – mastering
 * Susan Mendola – design
 * Ben Glass – The Bodyguard still photography, inside front cover photo of Whitney Houston
 * Randee St. Nicholas – inside booklet photography of Whitney Houston
 * Ellin LaVar – hair
 * Quietfire – makeup
 * Stephen Earabino – styling
 * Matthew Rolston – photography (Kenny G)
 * Casado – photography (Aaron Neville)
 * Paul Cox – photography (Joe Cocker)
 * Moshe Brakha – photography (Sass Jordan)
 * Zanna – photography (Lisa Stansfield)
 * Ken Nahoum – photography (The S.O.U.L. S.Y.S.T.E.M.)
 * Terence Scott – photography (Curtis Stigers)

title: The Bodyguard (soundtrack)


text:
User talk:Forderud

Welcome!

Hello, and welcome to Wikipedia. Thank you for your contributions. I hope you like the place and decide to stay. Here are a few good links for newcomers: I hope you enjoy editing here and being a Wikipedian! By the way, you can sign your name on Talk and vote pages using three tildes, like this: ~~~. Four tildes (~~~~) produces your name and the current date. If you have any questions, see the help pages, add a question to the village pump or ask me on my Talk page. Again, welcome! Oleg Alexandrov 01:56, 21 Apr 2005 (UTC)
 * How to edit a page
 * Editing, policy, conduct, and structure tutorial
 * Picture tutorial
 * How to write a great article
 * Naming conventions
 * Manual of Style
 * If you're ready for the complete list of Wikipedia documentation, there's also Topical index.

Kalman filter derivation
There are real problems with your text for the derivation of the Kalman filter, but when I tried to fix them, you reverted all my changes, saying that they were inaccurate. One part I know was inaccurate (and indeed had marked on my printouts to fix before your changes went in): I referred to "estimated state matrix" where what I meant was "estimated state vector", and I didn't make it clear that it was the sum of the squares of the error that was to be minimized.

You reverted all my changes to the original text, so I'm guessing there must have been more serious problems than that. Could you outline them for me? Thanks!

 * My consern with your rewrite was that you turned the text into an introduction to stochastic estimation (in general) by introducing sentences like we must define precisely what we mean by "best possible estimate". The Kalman article in not the place to describe what MMSE is. However, I agree with you in that the section definetely needs to be rephrased.
 * What about stating that the method is based on an MMSE solution to the (quadratic) $$ E \{ \textbf{e}_{k|k} \textbf{e}_{k|k}^T \} $$ error metric?
 * Please don't take this personally. My intension was only to make the article appear more like a research paper introduction to Kalman would have been. --Fredrik Orderud 09:22, 20 Apr 2005 (UTC)

 * OK, that's very helpful. I've re-worded in accordance with this advice, and also used var to simplify the equations.  I hope I haven't done anything that seems disastrous to you! — ciphergoth 11:53, 2005 Apr 20 (UTC)

Capital letters for random variables
Hello. Standard usage in my experience is that random variables are denoted by capital letters like X, and corresponding lower-case letters used for the dummies in density functions and CDFs and such expressions as

 * Pr(X > x)

 * fX(x) = e−x (capital in the subscript, lower-case in parentheses, for obvious reasons)

So why did you change the RVs in covariance matrix to lower-case? Michael Hardy 21:56, 20 Apr 2005 (UTC)

 * I agree with you when dealing with scalar statistics. However, when dealing with "vector statistics" is is common pracise to denote scalars normal, vectors boldface and matrices capitalized to help distinguish between them. Please respond again if you still disagree, and I'll change the notation back.--Fredrik Orderud 22:12, 20 Apr 2005 (UTC)

Kalman filter: non-correlation of noise variables
If you have a moment free, I'd appreciate your guidance in a discussion I'm having with User:Chrislloyd on Talk:Kalman filter about whether uncorrelation of gaussian variables implies independence. One of us is very confused and wrong, and would benefit from the knowledge of one such as yourself. Thanks! — ciphergoth 20:18, 2005 Apr 27 (UTC)

 * You can now find my answer in the Kalman talk-page. It's a very interesting discussion you've got :) --Fredrik Orderud 21:37, 27 Apr 2005 (UTC)

Correlation matrix?

 * In signal processing, the correlation matrix of a vector x is denoted
 * $$\textbf{R}_x = E[ \textbf{x} \textbf{x}^\top ]$$,
 * and the covariance matrix is denoted
 * $$\textbf{C}_x = E[(\textbf{x} - E[\textbf{x}] )(\textbf{\textbf{x}} - E[\textbf{x}] )^\top]$$
 * for real signals.

You've got to be kidding. That the difference between covariance and correlation is that in the former you don't subtract the average, is very strange. The standard is that the covariance divided by the product of the two standard deviations is the correlation. Michael Hardy 20:14, 28 Apr 2005 (UTC)

 * No, I'm not kidding! Just look at p.150 at Discrete Random Signals and Statistical Signal Processing by C. Therrien. This book is described as a "Reference Text" in 6.432 Stochastic Processes, Detection, and Estimation at your own universiy (MIT). This course also uses the same definition for correlation (problem 7.7 b). I fully acknowledge that this definision is inconsistent with the ordinary definition of "correlation", and therefore put it in a "signal processing" section. --Fredrik Orderud 20:51, 28 Apr 2005 (UTC)

Matrix differentiation
Hi Frederik. I left you a message on Talk:Matrix differentiation. Thanks. Oleg Alexandrov 00:48, 8 May 2005 (UTC)

 * The article is now renamed to Matrix calculus. --Fredrik Orderud 13:19, 8 May 2005 (UTC)

Um...
It's clear that that was just vandalism. In cases such as this you just revert back to the last good version. Not sure why you put the stub notice at the top either, as they go at the bottom of the article. CryptoDerk 17:24, May 9, 2005 (UTC)

 * Did you read the external link that the person provided? The Watley Review is dedicated to the production of articles completely without journalistic merit or factual basis, as this would entail leaving our chairs or actually working. Names, places and events are generally fictitious, except for public figures about which we may have heard something down at the pub. All contents are intended as parody and should be construed as such.  When someone adds "facts" to an article and references them with a parody site, I consider that vandalism.  CryptoDerk 17:42, May 9, 2005 (UTC)

 * Sorry. I didn't notice your removal of the links and vandalized content when reverting. I thought you only removed the "disputed" tag. Thanks a lot for you help! --Fredrik Orderud 17:45, 9 May 2005 (UTC)

Categories for Deletion

 * Hi, I noticed you marked Category:Numerical programming systems for deletion but never added it to WP:CFD. I've removed the tag for now.  If you definitely wanted to delete this category, please make sure you complete both parts of the procedure.  Thanks!  --Kbdank71 17:40, 20 May 2005 (UTC)

Category:Curves
Hi Orderud. As I think you saw, I reverted some of your edits. I think the numerical analysis category is not so reduntant in places. Also, when one thinks of the Category:Curves, the first thing which comes to one's mind is that this is geometry, not numerical analysis.

Thus, putting Category:Curves in Category:Numerical analysis, then removing the latter from a bunch of articles which are about numerical analysis, I think was not right.

However, in retrospect, I think it was not right to revert your edits so fast (I guess I am in a hurry right now). After I already did that, another idea came to my mind. Category:Curves should not be in Category:Numerical analysis. Rather, a new Category:Splines needs to be created, which should be in the categories of curves, numerical analysis, and computer graphics. Then, the articles about splines which are now in Category:Curves and Category:Numerical analysis could be put in the new category instead. What do you think?

Again, I am sorry for my rush edits. I should have considered this option before. Oleg Alexandrov 04:20, 10 Jun 2005 (UTC)

 * My intention by recategorization of spline-articles was to reduce the size of the numerical analysis and computer graphics categories, which I think are unneccesarily large. A more precise categorization would reduce this problem.

 * I totally agree in that a "Splines" category is better for spline-related content than my attemt to use the "Curve" category. I've therefore just created Category:Splines, and moved the first 10 spline related articles to this category. --Fredrik Orderud 10:48, 10 Jun 2005 (UTC)

 * Hey Fredrik, good work! Thanks! Oleg Alexandrov 15:03, 10 Jun 2005 (UTC)
 * BTW, are you aware of WikiProject Mathematics? That, and its talk page are where the mathematicians gather to discuss all math related issues. There is also a list of participants to sign on. Cheers, Oleg Alexandrov 15:03, 10 Jun 2005 (UTC)

Element densities in infoboxes
We, at the Wikiproject Elements, have noticed your recent edits to the infoboxes of helium and hydrogen. We were wondering your source for the data and if it is reliable. If it is, we would be interesting in expanding it to all emement articles. Please leave us a comment on Wikipedia talk:WikiProject Elements or even my talk page. -- metta, The Sunborn  3 July 2005 23:43 (UTC)

Google is all knowing. All hail mighty Google
Perhaps next time you should consult the oracle ... sorry Google. :) AlistairMcMillan 23:21, August 6, 2005 (UTC)

A Norwegian as well, I presume?
Hi; welcome! I hope it's OK if I (re)add you to the WKPns in Norway cat---I think it's a patently Good Thing™ to have us Norwegians listed in that cat in addition to any 'regional' ones, so as to keep the overall picture. --Wernher 14:25, 21 August 2005 (UTC)
 * That's ok :) --Fredrik Orderud 14:44, 21 August 2005 (UTC)

 * I've changed my mind; and do now disagree with you. I think membership in Category:Wikipedians in Norway is unneccesary for members in Category:Wikipedians in Trondheim, as I oppose redundant categorization. --Fredrik Orderud 02:31, 18 September 2005 (UTC)

Science pearls
Hello,

Since you contributed in the past to the publications’ lists, I thought that you might be interested in this new project. I’ll be glad if you will continue contributing. Thanks,APH 09:39, 11 September 2005 (UTC)

Video for Windows
About your recent edit...

 * removing cat:windows software, since this is a library, and not user software

(1) Video for Windows is not just libraries, the actual Media Player application was only distributed as part of Video for Windows. (2) The cat is "Windows software" not "Windows user software". If the cat is only for user software it should say so somewhere. AlistairMcMillan 15:08, 13 September 2005 (UTC)

 * You might be right there, but isn't Category:Microsoft software still sufficient categorization for Video for Windows? --Fredrik Orderud 15:46, 13 September 2005 (UTC)

Wikibooks:Programming:MS Visual Studio
PANIC: I've posted a message for you in [|your Wikibooks user talk page], txs...

Microsoft Dynamic Link Library → Dynamic Link Library
Please participate in the discussion at Talk:Microsoft Dynamic Link Library.

Please comment on the current Math Collaboration of the Week
Hello Orderud - since you listed statistics as an interest in your user talk, I was hoping you could lend your expertise to the current Mathematics Collaboration of the Week: Multiple Comparisons. Obviously it's a interesting and important topic. We are also in the midst of a discussion as to the distinction between multiple comparisons and multiple testing. Your thoughts would be much appreciated. Let's get a math article up on the front page! Thanks for any help. Debivort 10:20, 5 January 2006 (UTC)

It's the thought that counts
Yeah, voting closed just yesterday on my RfA, but thanks for the sentiment! -lethe talk [ +] 01:24, 2 February 2006 (UTC)

Thanks for experimenting with Wikipedia. Your test worked, and has been reverted or removed by an automated bot. Please use the sandbox for any other tests you want to do. Take a look at the welcome page if you would like to learn more about contributing to our encyclopedia. Thanks. If you feel you have received this notice in error, please contact the bot owner  // Tawkerbot2 20:52, 31 March 2006 (UTC)

Kalman and HMM
Your revert covers only some of Alan1507's edits. this diff covers the changes between before he started editing and the current version. — ciphergoth 22:44, 11 May 2006 (UTC)

 * I know. The previous edits by Alan1507 didn't look that bad, so I only reverted the last one where he replaced "Markov chain" with "graphical model". --Fredrik Orderud 22:51, 11 May 2006 (UTC)

Weather radar
Thanks a lot for the reformating of the equations. I've looked in the Latex Help section but I could not find how to realign the text on the right of the brace. I will keep you changes in my files.

Pierre_cb 13:38 GMT 2006-05-16

 * Look at m:Help:Formula for a great cheat sheet for latex math :-) --Fredrik Orderud 13:47, 16 May 2006 (UTC)

Inferring backwards?
A question I asked on Talk:Kalman filter but didn't get a very good answer; I hope you don't mind me asking you directly. A Kalman model will use today's observation to estimate today's state. What do you use when you want to use today's observation (in combination with those from the past) to improve your estimate of yesterday's state? There are definitely well-understood techniques that use both past and future information together; I just don't know how to look for them because I don't know what they're called. Thanks! — ciphergoth 10:53, 11 August 2006 (UTC)

Weather radar
Hi,

You have put a "Clean up" sign on my Weather radar article in May 2006, before it was completly finished. Since then, I added lot of stuff and reorganized. Some people have added things too. I would like to know want you think of it now and how to get this sign off. Pierre cb 05:19, 27 August 2006 (UTC)

 * The article sure looks a lot better now, so you can probably remove the "cleanup" tag at the top of the article. --Fredrik Orderud 12:07, 27 August 2006 (UTC)

Cleanup on Automatically_Tuned_Linear_Algebra_Software
I have been working to cleanup Automatically_Tuned_Linear_Algebra_Software. I see that you have edited that page in the past. If you would be so good as to check out the latest version and contribute to or comment on the article, it would be most appreciated. Cheers, -- Jake 19:36, 5 October 2006 (UTC)

Image:Visual studio includedirectories.png listed for deletion
An image or media file that you uploaded or altered, Image:Visual studio includedirectories.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in its not being deleted. Thank you.

Image:Visual studio librarydirectories.png listed for deletion
An image or media file that you uploaded or altered, Image:Visual studio librarydirectories.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in its not being deleted. Thank you.

Image:Visual studio additionaldependencies.png listed for deletion
An image or media file that you uploaded or altered, Image:Visual studio additionaldependencies.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in its not being deleted. Thank you.

Image:Visual studio runtimelibrary.png listed for deletion
An image or media file that you uploaded or altered, Image:Visual studio runtimelibrary.png, has been listed at. Please look there to see why this is (you may have to search for the title of the image to find its entry), if you are interested in its not being deleted. Thank you.

Image tagging for Image:Bland-Altman-Plot.gif
Thanks for uploading Image:Bland-Altman-Plot.gif. The image has been identified as not specifying the source and creator of the image, which is required by Wikipedia's policy on images. If you don't indicate the source and creator of the image on the image's description page, it may be deleted some time in the next seven days. If you have uploaded other images, please verify that you have provided source information for them as well.

For more information on using images, see the following pages:
 * Image use policy
 * Image copyright tags

This is an automated notice by OrphanBot. For assistance on the image use policy, see Media copyright questions. 10:04, 1 November 2006 (UTC)

Little context in Miscellaneous
is very short providing little or no context to the reader. Please see Wikipedia:Stub for our minimum information standards for short articles. --Android Mouse Bot 2 23:27, 22 May 2007 (UTC)

Interview with Åse Kleveland
The English Wikinews is going to be organizing an interview with the former Norwegian Culture Minister Åse Kleveland. She was also the head of the Swedish Film Institute and is now the chairwoman of the Norwegian Humanist Association. I am asking Wikipedians from all of the Scandinavian languages to contribute questions to her upcoming interview with Wikinews in Oslo. The page is here; please leave questions there and comments to me either on my en.wikinews talk page or my en.wikipedia talk page. Thank you very much! Mike H. Fierce! 02:07, 2 July 2008 (UTC)

Wikimania 2010 could be coming to Stockholm!
I'm leaving you a note as you may be interested in this opportunity.

People from all six Nordic Wiki-communities (sv, no, nn, fi, da and is) are coordinating a bid for Wikimania 2010 in Stockholm. I'm sending you a message to let you know that this is occurring, and over the next few months we're looking for community support to make sure this happens! See the bid page on meta and if you like such an idea, please sign the "supporters" list at the bottom. Tack (or takk), and have a wonderful day! Mike H. Fierce! 11:13, 5 August 2008 (UTC)

AfD nomination of List of computer vision conferences
I have nominated List of computer vision conferences, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Articles for deletion/List of computer vision conferences. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.Please contact me if you're unsure why you received this message. StarM 12:09, 14 April 2009 (UTC)

Articles for deletion nomination of TeXnicCenter
I have nominated TeXnicCenter, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Articles for deletion/TeXnicCenter. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.Please contact me if you're unsure why you received this message. ukexpat (talk) 20:03, 2 June 2009 (UTC)

Articles for deletion nomination of Copernic Desktop Search
I have nominated Copernic Desktop Search, an article that you created, for deletion. I do not think that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Articles for deletion/Copernic Desktop Search. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time.Please contact me if you're unsure why you received this message. B (talk) 19:40, 28 July 2009 (UTC)

Speedy deletion nomination of Copernic Desktop Search
A tag has been placed on Copernic Desktop Search, requesting that it be speedily deleted from Wikipedia. This has been done under section G11 of the criteria for speedy deletion, because the page seems to be unambiguous advertising which only promotes a company, product, group, service or person and would need to be fundamentally rewritten in order to become an encyclopedia article. Please read the guidelines on spam as well as FAQ/Business for more information.

If you think that this notice was placed here in error, you may contest the deletion by adding  to the top of the page that has been nominated for deletion (just below the existing speedy deletion or "db" tag), coupled with adding a note on the talk page explaining your position, but be aware that once tagged for speedy deletion, if the page meets the criterion it may be deleted without delay. Please do not remove the speedy deletion tag yourself, but don't hesitate to add information to the page that would render it more in conformance with Wikipedia's policies and guidelines. Lastly, please note that if the page does get deleted, you can contact one of these admins to request that they userfy the page or have a copy emailed to you. —Largo Plazo (talk) 18:49, 30 July 2009 (UTC)

Derivation of the optimal Kalman filter gain - five years later :-)
Hi Orderud,

Back in 2005 you more or less wrote the section Kalman filter. I have some concerns about a mismatch between the physical units used in that derivation as described here Talk:Kalman filter. As the original author of that section I thought you maybe wanted to be informed about this, and I would be interested in hearing your view about me feeling a little uneasy about the derivation. As I understand the present derivation is how Kalman originally did it. Best wishes, --Slaunger (talk) 08:01, 29 June 2010 (UTC)

Notification: changes to "Mark my edits as minor by default" preference
Hello there. This is an automated message to tell you about the gradual phasing out of the preference entitled "Mark all edits minor by default", which you currently have (or very recently had) enabled.

On 13 March 2011, this preference was hidden from the user preferences screen as part of efforts to prevent its accidental misuse (consensus discussion). This had the effect of locking users in to their existing preference, which, in your case, was. To complete the process, your preference will automatically be changed to  in the next few days. This does not require any intervention on your part and you will still be able to manually mark your edits as being minor in the usual way.

For established users such as yourself there is a workaround available involving custom JavaScript. With the script in place, you can continue with this functionality indefinitely (its use is governed by WP:MINOR). If you have any problems, feel free to drop me a note.

Thank you for your understanding and happy editing :) Editing on behalf of User:Jarry1250, LivingBot (talk) 18:40, 15 March 2011 (UTC)

Proposed deletion of FinkCommander

The article FinkCommander has been proposed for deletion  because of the following concern:
 * Non-notable software, with no updates in 6 years. No references.

While all 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. Stuartyeates (talk) 23:01, 27 August 2011 (UTC)

Smart pointer
You have utterly destroyed the "Concurrency guarantees" section by repeatedly replacing accurate information with nonsense. Smart pointer instances are not thread-safe. The atomic operations are exceptions to that rule, not the reason that smart pointers are thread-safe (again, they're not). The previous contributor rightly indicated that only the "reference count" is protected and not the referenced object, which you changed to say that it only protects the "smart pointers", but that was false, and it got worse from then on because of the spurious rationale that was added. I was tempted to revert your reversal by saying that accuracy trumps readability, but I'll let somebody else do that, and in the meantime I'll just remove what's wrong. RFST (talk) 19:36, 21 May 2013 (UTC)

 * I'm sorry that you feel that I've degraded the smart pointer article. That was never my intent. Rather, my intent was to clarify that smart-pointer objects (containing both pointer value and reference-count) are thread-safe, whereas the object being pointed to needs to be protected separately. I even added a reference to the C++ standard as proof (with the possible exception of non-standard interfaces and objects passed as 2nd/3rd/4th etc. argument). I'm surprised that you've removed this reference, since it was the only source of objective evidence in the section. I would have preferred if you instead could have improved or extended the reference if you feel that there was something wrong with it.
 * Based on your "Smart pointer instances are not thread-safe" reasoning, it appears to me like you disagree with the C++ standard section that I referenced (C++11 standard N3337, 20.7.2.5 shared_ptr atomic access ). Could you please comment on this? Fredrik Orderud (talk) 20:50, 21 May 2013 (UTC)

 * My first edit (in two parts) was meant to provide the necessary information. In the second edit, I didn't want to go into an undo war (or whatever it's called on Wikipedia), so I removed the reference not because I somehow "disagree" with it in any way (I don't) but because it was misused (as described above); to repeat: the atomic operations are exceptions to the rule that smart pointers must be protected like any other object, not a reason that they would be thread-safe (again, they're not). If an object contains a shared_ptr (just to paint the scenario), and multiple threads access the object and hence the shared_ptr, access to that shared_ptr must be protected just as for any other object, unless access is purely in terms of the limited set of atomic functions as specified in the Standard ("Concurrent access to a shared_ptr object from multiple threads does not introduce a data race if the access is done exclusively via the functions in this section and the instance is passed as their first argument."). You can read more about "Thread safety" (or lack thereof) for shared_ptr in boost (please do so at this point), the nursery of several new C++11 features, but which BTW does not seem to have the atomic functions. Unfortunately, even if you yourself have written code that was never tripped up by not respecting these requirements, it may still be, or it may not be portable, and you should probably use a specialised tool to trigger the timing conditions that may make the problem manifest at testing time instead of perhaps in the field, and even then such tools are constrained by current implementation and current hardware. RFST (talk) 07:19, 22 May 2013 (UTC)

 * I'm already familiar with Boost, including boost::shared_ptr. I've contributed several patches to the project, am participating on the boost::thread mailing list and have initiated a SourceForge project for distributed precompiled boost binaries. I therefore think it would be more constructive if you could keep to a less offensive tone.
 * That said, I think I understand you point. Could it e.g. be an idea to add boost::shared_ptr thread safety as a reference (until we find a std::shared_ptr reference)? Fredrik Orderud (talk) 11:56, 22 May 2013 (UTC)

 * Sorry for the offensive start (I was somewhat annoyed), but what I was seeing is somebody who has a particular understanding of something that happens to be wrong but who still acts repeatedly as if he simply knows better. I'm not looking at reputation or whatever (although if you've contributed patches to boost this seems like a strange mistake to make), I'm trying to get somewhere without spending too much time on it. Anyway, I'm glad about the progress. Strictly speaking, the boost documentation is not entirely relevant without evidence about how close std::shared_ptr still is to boost::shared_ptr, but if presented without extraneous claims it might help. The real confirmation is still that very section about atomic functions, which, instead of explaining why shared_ptr is thread-safe (which it is not), implies in a roundabout way that all other access methods may in fact "introduce a data race" and are therefore not thread-safe. BTW, I've experienced the issues up close when I implemented my own shared_ptr (using boost's was not an option). RFST (talk) 20:44, 22 May 2013 (UTC)

 * Now, I've added the boost::shared_ptr thread safety documentation as reference (together with a disclaimer stating that it's doesn't formally cover std::shared_ptr). Hope that this is ok for you. Fredrik Orderud (talk) 12:07, 23 May 2013 (UTC)

 * Minimalist information is better than misinformation, and those who have a legitimate use for the additional functionality in C++11 will probably be consulting other sources anyway, so this seems acceptable. RFST (talk) 08:15, 27 May 2013 (UTC)

June 2013
Hello, I'm BracketBot. I have automatically detected that [//en.wikipedia.org/w/index.php?diff=559850559 your edit] to Acyclic dependencies principle may have broken the syntax by modifying 1 ""s. If you have, don't worry, just [ edit the page] again to fix it. If I misunderstood what happened, or if you have any questions, you can leave a message on [//en.wikipedia.org/w/index.php?action=edit&preload=User:A930913/BBpreload&editintro=User:A930913/BBeditintro&minor=&title=User_talk:A930913&preloadtitle=BracketBot%20-%20&section=new my operator's talk page].
 * List of unpaired brackets remaining on the page:

Thanks, BracketBot (talk) 10:00, 14 June 2013 (UTC)
 * * Dependencies stated in the build system e.g.   tags in Maven configuration.
 * Fixed! Fredrik Orderud (talk) 10:33, 14 June 2013 (UTC)

speedy
Speedy deletion applies only for the reasons given in WP:CSD:A7. That an article in mainspace is incomplete and unsourced is not among them. In fact, it's not necessarily a reason for regular deletion, unless it is unsourceable. I therefore declined your request for speedy deletion of Medical integration environment. G13 applies only to AfC pages.  DGG ( talk ) 22:46, 16 June 2013 (UTC)

File:Linker.png listed for deletion
A file that you uploaded or altered, File:Linker.png, has been listed at Files for deletion. Please see the to see why it has been listed (you may have to search for the title of the image to find its entry). Feel free to add your opinion on the matter below the nomination. Thank you. Sfan00 IMG (talk) 21:29, 2 August 2013 (UTC)

Visual C++ RTM version numbers
I've seen the RTM version numbers switch back and forth a few times over the past few months, almost like a slow motion edit war. I haven't been able to Google anything definitive, but I'm wondering whether the confusion is version numbers for Visual C++ vs. Visual Studio? — Preceding unsigned comment added by Michaelmalak (talk • contribs) 22:44, 3 September 2013 (UTC)

 * I'm just as surprised by the edit war myself. To improve the situation, I've just added a link to a screenshot of the Visual Studio 2012 about dialog. Hopefully, this should prevent any further edits back & forth. Fredrik Orderud (talk) 06:38, 4 September 2013 (UTC)

 * What you showing is the about dialog of Visual Studio. The article and therefor the versions numbers are for Visual C++ and that version number for 2012 is 17.*. Compare the version numbers of the other versions. — Preceding unsigned comment added by ConfusedSushi (talk • contribs) 13:58, 28 October 2013 (UTC)

Orphaned non-free image File:Visual Studio 2012 about dialog.png
 Thanks for uploading File:Visual Studio 2012 about dialog.png. 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 the criteria for speedy deletion. Thank you. Diannaa (talk) 20:27, 10 September 2013 (UTC)

 * The image was in fact already referred to in the Visual C++ article. The only problem was that I used regular "internet-links" for the image, which is not detected by the "where used" logic in Wikipedia. This has now been improved by replacing the "internet-link" with an equivalent "wiki-link". I hope this satisfies your wishes. Fredrik Orderud (talk) 07:03, 11 September 2013 (UTC)

Nomination of Bayes++ for deletion
A discussion is taking place as to whether the article Bayes++ 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/Bayes++ 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. Q VVERTYVS (hm?) 12:37, 12 October 2013 (UTC)

Notification of automated file description generation
Your upload of File:Circle sampling.png or contribution to its description is noted, and thanks (even if belatedly) for your contribution. In order to help make better use of the media, an attempt has been made by an automated process to identify and add certain information to the media's description page.

This notification is placed on your talk page because a bot has identified you either as the uploader of the file, or as a contributor to its metadata. It would be appreciated if you could carefully review the information the bot added. To opt out of these notifications, please follow the instructions here. Thanks! Message delivered by Theo's Little Bot (opt-out) 14:40, 6 May 2014 (UTC)

Undoing my revert
I reverted you here but realized I had misread your sentence and have undone my revert. My apologies. Msnicki (talk) 16:13, 13 November 2014 (UTC)

 * No problem! :-) Thank you for keeping an eye on the article. Fredrik Orderud (talk) 17:48, 13 November 2014 (UTC)

Nomination of DreamSpark Premium for deletion
A discussion is taking place as to whether the article DreamSpark Premium 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/DreamSpark Premium 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. ― Padenton  |☎ 04:27, 19 March 2015 (UTC)

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

Orphaned non-free image File:Copernic desktop search.png
 Thanks for uploading File:Copernic desktop search.png. 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) 18:17, 5 March 2017 (UTC)

Speedy deletion nomination of IncludeOS
Hello Forderud,

I wanted to let you know that I just tagged IncludeOS for deletion, because the article doesn't clearly say why the subject is important enough to be included in an encyclopedia.

If you feel that the article shouldn't be deleted and want more time to work on it, you can [//en.wikipedia.org/w/index.php?title=&action=edit&section=new&preload=Template:Hangon_preload&preloadtitle=This+page+should+not+be+speedy+deleted+because...+ contest this deletion], but please don't remove the speedy deletion tag from the top.

You can leave a note on my talk page if you have questions.

 Adotchar | reply here 11:16, 2 January 2018 (UTC)

A page you started (IncludeOS) has been reviewed!
Thanks for creating IncludeOS, Forderud!

Wikipedia editor My name is not dave just reviewed your page, and wrote this note for you:

"Could you please include more secondary sources to prove the article's notability? A Google search done by myself means that I am quite optimistic that it is notable."

To reply, leave a comment on My name is not dave's talk page.

Learn more about page curation.

! dave 11:26, 2 January 2018 (UTC)

Category:Classification has been nominated for discussion
Category:Classification, which you created, has been nominated for possible deletion, merging, or renaming. A discussion is taking place to decide whether this proposal complies with the categorization guidelines. If you would like to participate in the discussion, you are invited to add your comments at the category's entry on the categories for discussion page. Thank you. Rathfelder (talk) 20:52, 17 December 2019 (UTC)

Proposed deletion of File:Circle sampling.png

The file File:Circle sampling.png has been proposed for deletion because of the following concern: "unused, low-res, no obvious use"

While all constructive contributions to Wikipedia are appreciated, pages 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 file's talk page.

Please consider addressing 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 files for discussion allows discussion to reach consensus for deletion.

This bot DID NOT nominate any file(s) for deletion; please refer to the page history of each individual file for details. Thanks, FastilyBot (talk) 01:01, 4 February 2020 (UTC)

Proposed deletion of Bayesian Filtering Library

The article Bayesian Filtering Library has been proposed for deletion because of the following concern: "No evidence this software passes WP:NSOFT/GNG. No references, no reviews, etc. (Also not seeing any in my BEFORE through there are some mentions in passing)."

While all constructive contributions to Wikipedia are appreciated, pages 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 page 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. Piotr Konieczny aka Prokonsul Piotrus| reply here 12:52, 9 February 2020 (UTC)

title: User talk:Forderud


text:
TransAVIAexport Airlines

TAE Avia, formerly named TransAVIAexport Airlines, is a Belarusian national cargo airline. It is based at Minsk International Airport in Belarus, with a hub at Sharjah International Airport, in the United Arab Emirates.

History
TransAVIAexport Airlines was established in December 1992 in Belarus. The airline operates worldwide cargo flights. In 2021, the airline changed its name to TAE Avia.

On 2 December 2021, TransAVIAexport and two aircraft belonging to the airline were added to the Specially Designated Nationals and Blocked Persons List by the United States Department of the Treasury. In 2022, the airline was additionally blacklisted by the United Kingdom, the European Union, Switzerland and Japan.

Fleet
TAE Avia's fleet included the following aircraft (as of October 2019):

 * 1 Boeing 747-300SF
 * 5 Ilyushin Il-76TD

Accidents and incidents

 * On March 9, 2007, a TransAVIAexport Airlines Ilyushin Il-76TD (s/n 1003499991, registered EW-78826), on approach at Mogadishu, Somalia, was hit by a projectile, which was later confirmed to be a RPG by Belarus officials. The aircraft landed safely but sustained substantial damage.

 * On March 23, 2007, a TransAVIAexport Airlines Ilyushin Il-76TD (s/n 1013405192, registered EW-78849) was shot down by an anti-aircraft missile while taking off from Mogadishu, Somalia.

 * On August 22, 2017, a TransAVIAexport Airlines Ilyushin Il-76TD (registered EW-78799) on approach to Juba, South Sudan struck a tree short of the runway, destroying several houses and killing a 5-year-old girl.

title: TransAVIAexport Airlines


text:
Deputy First Minister of Scotland

The Deputy First Minister of Scotland (Leas-Phrìomh Mhinistear na h-Alba; Heid Meinister Depute o Scotland) is the second highest ranking minister of the Government of Scotland, behind the First Minister.

The post-holder is appointed by the First Minister, and deputises for the First Minister during a period of absence or whilst they are outwith Scotland undertaking overseas visits. During any period of the First Minister's absence, the DFM will be expected to answer to the Scottish Parliament on behalf of the First Minister at First Minister's Questions.

The role is currently held by Kate Forbes since 8 May 2024, following her appointment by John Swinney alongside her portfolio as Cabinet Secretary for Economy and Gaelic.

Overview
The post is not recognised in statute (in comparison with the post of First Minister which is established by the Scotland Act 1998), and its holder is simply an ordinary member of the Scottish Government. The post has nonetheless existed since the establishment of the Scottish Parliament and Scottish Government in 1999. When one party governs alone, the Deputy First Minister is a senior member of the governing party, sometimes the party's deputy leader as with Nicola Sturgeon when she was SNP depute leader though at present this is not the case with the current SNP depute leader Keith Brown. When the government is formed by a coalition, the Deputy First Minister is usually the leader of the minority partner.

The Deputy First Minister, within the Scottish Government, has direct responsibility and control over the strategy of the Scottish Government, delivery and outcomes of ministerial portfolios, resilience, as well as cross-government co-ordination of public service reform. Alongside the responsibilities of the post-holders functions as Deputy First Minister, the post holder is also required to have direct responsibility for a cabinet secretary post.

Nomination and election
The Additional Member System used to elect Members of the Scottish Parliament makes it difficult for a single party to have an absolute majority. Between 1999 and 2007, the Scottish Executive was formed by a Labour and Liberal Democrat coalition, with the leader of Scottish Labour serving as First Minister and the leader of the Scottish Lib Dems serving as Deputy First Minister.

Although the Scottish National Party (SNP) formed a single party minority administration following the 2007 election, the post was not abolished despite there being no need to recognise the status of a second party leader, instead being given to the SNP's depute leader, Nicola Sturgeon. When Sturgeon became First Minister, the party's depute leader, Stewart Hosie, was serving in the Parliament of the United Kingdom and did not have a seat in the Scottish Parliament. The Deputy First Minister's post thus went to John Swinney.

Government duties
The post holder of the Deputy First Minister of Scotland is solely responsible for the following areas within the Scottish Government (as of May 2024):

Direct government business

 * business, industry and manufacturing support
 * covid inquiries
 * cross-government delivery and outcomes
 * economic policy and prosperity
 * enterprise agencies
 * entrepreneurship
 * green industrial strategy (jointly with Cabinet Secretary for Net Zero and Energy)
 * Historical Abuse Inquiry
 * inter-governmental relations
 * labour market strategy (long-term)
 * languages, including Gaelic, Scots and British Sign Language (BSL)
 * National Performance Framework
 * Office of the Chief Economic Adviser
 * redress
 * Scottish National Investment Bank
 * Sheku Bayoh public inquiry
 * UK government engagement on shared prosperity fund, levelling up fund, European Structural and Investment Funds (ESIF)

Infrastructure investment

 * city and regional growth deals
 * Clyde Mission
 * government investments (Prestwick, Fergusons, BiFab)
 * regional economic partnerships

Other cabinet positions
Shona Robison, appointed Deputy First Minister under Humza Yousaf in March 2023, also serves as the Cabinet Secretary for Finance. Alongside her responsibilities as Deputy First Minister, Robison is also responsible for the delivery of the Scottish budget, as well as "budgetary monitoring and reporting (including Medium Term Financial Strategy (MTFS)), fiscal policy and taxation (including income tax), exchequer and the public finances, public sector pay, the Scottish Fiscal Commission, fiscal framework review, local government finance and public sector productivity".

Kate Forbes, who was appointed Deputy First Minister by John Swinney in May 2024, holds the additional cabinet responsibility for Economy and Gaelic. Shona Robison, the former Deputy First Minister, became the Cabinet Secretary for Finance and Local Government in Swinney's government.

title: Deputy First Minister of Scotland


text:
Jason Bargwanna

Jason Eric Bargwanna (born 26 April, 1971) is an Australian motor racing driver. Best known as a Supercars Championship competitor, Bargwanna raced in the series for 25 years, the pinnacle of which was winning, with Garth Tander, the 2000 Bathurst 1000 in a Garry Rogers Motorsport prepared Holden Commodore. Bargwanna was the Driving Standards Observer for the Supercars Championship from 2014 until 2016.

Career history
Bargwanna commenced his racing career in the late 1980s, initially competing in the Formula Vee category. He made his Bathurst 1000 début while still a teenager in 1990 and won the 1992 Bathurst 1600 cc class at 20, with his cousin Scott, however a lack of funding limited his motor sport participation for the next few seasons and he pursued a career in the financial sector.

His career finally started to move forward in 1995, racing in the Australian Formula Ford Championship. He impressed in his seven-year-old Reynard, racing against younger drivers with the latest cars from Van Diemen and Swift and against drivers of the calibre of Jason Bright and Mark Webber. His 1995 showing allowed him to attract the budget to run a campaign with late model equipment in 1996 and he finished second in the championship to Van Diemen's factory supported driver, David Besnard. He also represented Australia in the EFDA Nations Cup in both 1995 and 1996. A move to Formula Holden resulted in second place in the 1997 Australian Drivers' Championship with SH Racing.

V8 Supercars
As a member of the Holden Young Lions V8 Supercar program in 1997, he surprised many by taking provisional pole position in the #97 Holden Commodore at the Bathurst 1000 Classic only to damage the car beyond repair in a race day warm up accident. His career further advanced in 1998 with a move full-time to Garry Rogers Motorsport, where he stayed for five years. Bargwanna is best known for winning the 2000 Bathurst 1000 with Garth Tander for that team. He also scored two round wins at the Winton event in 1999 and 2000 and at the inaugural championship round supporting the Gold Coast Indy 300, the V8 Supercar Challenge, in 2002.

In 2003, Bargwanna switched to Ford and drove for Larkham Motor Sport from 2003 to 2005. In 2006, Larkham Motor Sport merged with WPS Racing, the team folding immediately prior to the 2008 season and leaving Bargwanna without a full-time drive. He did however co-drive a Holden Commodore (VE) for Rod Nash Racing alongside Tony D'Alberto in the 2008 Phillip Island 500 and the Bathurst 1000 endurance races.

Bargwanna joined Tasman Motorsport for 2009 and, following the closure of that team at the end of the season, he joined Kelly Racing for 2010. He was also voted in the top 50 all time Australian Touring car drivers in 2010. In 2011 Bargwanna drove a Brad Jones Racing Commodore alongside his junior open-wheel rival, Jason Bright.

In 2014, Bargwanna was appointed as the Driver Standards Observer for the Supercars Championship. Bargwanna left the post at the end of 2016.

New Zealand V8
In late 2011, Bargwanna left the V8 Supercars Australia and joined the New Zealand V8. He resulted runner-up in the 2011/12 season behind Angus Fogg, collecting a round win and podiums in the six rounds driving a Tulloch Ford Falcon. The team switched to a Holden Commodore for the 2013 season. The driver won nine out of 15 races and got the TLX title.

TCR
In 2020, Bargwanna was to make his debut in the TCR Australia and TCR Asia Pacific Cup driving a Peugeot 308. Both series were cancelled due to the Corona Virus Pandemic. In 2021, he and his son Ben, debuted in the series. Jason scored his first win at Phillip Island

Personal life
Bargwanna is married to Debra and has two children. He lives in Nar Nar Goon, Victoria. His father, Harry Bargwanna, himself an Australian racing driver, owns and operates a mechanical repair shop in the Southern Sydney suburb of Engadine. His uncle Alf and cousin Scott are also national level race drivers. Bargwanna attended Heathcote High School in Sydney. Bargwanna owns four Red Rooster franchises in Hampton Park, Fountain Gate, Hastings, and Pakenham West.

Career results

† team result

Supercars Championship results
(Races in bold indicate pole position) (Races in italics indicate fastest lap)

TCR Australia results
(Races in bold indicate pole position) (Races in italics indicate fastest lap)

title: Jason Bargwanna


text:
File:Scotland CraigmillarCastle.jpg

Photograph of Craigmillar Castle, near Edinburgh, Scotland. Taken 2nd April 2005 by Owen Dando.

title: File:Scotland CraigmillarCastle.jpg


text:
Lenstra–Lenstra–Lovász lattice basis reduction algorithm

The Lenstra–Lenstra–Lovász (LLL) lattice basis reduction algorithm is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász in 1982. Given a basis $$\mathbf{B} = \{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{b}_d \}$$ with n-dimensional integer coordinates, for a lattice L (a discrete subgroup of Rn) with $$ d \leq n $$, the LLL algorithm calculates an LLL-reduced (short, nearly orthogonal) lattice basis in time $$\mathcal O(d^5n\log^3 B)$$ where $$B$$ is the largest length of $$\mathbf{b}_i$$ under the Euclidean norm, that is, $$B = \max\left(\|\mathbf{b}_1\|_2, \|\mathbf{b}_2\|_2, \dots, \|\mathbf{b}_d\|_2\right)$$.

The original applications were to give polynomial-time algorithms for factorizing polynomials with rational coefficients, for finding simultaneous rational approximations to real numbers, and for solving the integer linear programming problem in fixed dimensions.

LLL reduction
The precise definition of LLL-reduced is as follows: Given a basis $$\mathbf{B}=\{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{b}_n \},$$ define its Gram–Schmidt process orthogonal basis $$\mathbf{B}^*=\{ \mathbf{b}^*_1, \mathbf{b}^*_2, \dots, \mathbf{b}^*_n \},$$ and the Gram-Schmidt coefficients $$\mu_{i,j}=\frac{\langle\mathbf{b}_i,\mathbf{b}^*_j\rangle}{\langle\mathbf{b}^*_j,\mathbf{b}^*_j\rangle},$$ for any $$1 \le j < i \le n$$.

Then the basis $$B$$ is LLL-reduced if there exists a parameter $$\delta$$ in $(0.25, 1]$ such that the following holds:

\mathbf{b}^*_{k-1}\Vert^2$$.
 * 1) (size-reduced) For $$1 \leq j < i \leq n\colon \left|\mu_{i,j}\right|\leq 0.5$$. By definition, this property guarantees the length reduction of the ordered basis.
 * 2)  (Lovász condition) For k = 2,3,..,n $$  \colon \delta \Vert \mathbf{b}^*_{k-1}\Vert^2  \leq \Vert \mathbf{b}^*_k\Vert^2+ \mu_{k,k-1}^2\Vert

Here, estimating the value of the $$\delta$$ parameter, we can conclude how well the basis is reduced. Greater values of $$\delta$$ lead to stronger reductions of the basis. Initially, A. Lenstra, H. Lenstra and L. Lovász demonstrated the LLL-reduction algorithm for $$\delta = \frac{3}{4}$$. Note that although LLL-reduction is well-defined for $$\delta = 1$$, the polynomial-time complexity is guaranteed only for $$\delta$$ in $$(0.25,1)$$.

The LLL algorithm computes LLL-reduced bases. There is no known efficient algorithm to compute a basis in which the basis vectors are as short as possible for lattices of dimensions greater than 4. However, an LLL-reduced basis is nearly as short as possible, in the sense that there are absolute bounds $$c_i > 1$$ such that the first basis vector is no more than $$c_1$$ times as long as a shortest vector in the lattice, the second basis vector is likewise within $$c_2$$ of the second successive minimum, and so on.

Applications
An early successful application of the LLL algorithm was its use by Andrew Odlyzko and Herman te Riele in disproving Mertens conjecture.

The LLL algorithm has found numerous other applications in MIMO detection algorithms and cryptanalysis of public-key encryption schemes: knapsack cryptosystems, RSA with particular settings, NTRUEncrypt, and so forth. The algorithm can be used to find integer solutions to many problems.

In particular, the LLL algorithm forms a core of one of the integer relation algorithms. For example, if it is believed that r=1.618034 is a (slightly rounded) root to an unknown quadratic equation with integer coefficients, one may apply LLL reduction to the lattice in $$\mathbf{Z}^4$$ spanned by $$[1,0,0,10000r^2], [0,1,0,10000r],$$ and $$[0,0,1,10000]$$. The first vector in the reduced basis will be an integer linear combination of these three, thus necessarily of the form $$[a,b,c,10000(ar^2+br+c)]$$; but such a vector is "short" only if a, b, c are small and $$ar^2+br+c$$ is even smaller. Thus the first three entries of this short vector are likely to be the coefficients of the integral quadratic polynomial which has r as a root. In this example the LLL algorithm finds the shortest vector to be [1, -1, -1, 0.00025] and indeed $$x^2-x-1$$ has a root equal to the golden ratio, 1.6180339887....

Properties of LLL-reduced basis
Let $$\mathbf{B}=\{ \mathbf{b}_1,\mathbf{b}_2, \dots, \mathbf{b}_n \}$$ be a $$\delta$$-LLL-reduced basis of a lattice $$\mathcal L$$. From the definition of LLL-reduced basis, we can derive several other useful properties about $$\mathbf{B}$$.

 * 1) The first vector in the basis cannot be much larger than the shortest non-zero vector: $$\Vert\mathbf{b}_1 \Vert \le (2 / (\sqrt{4\delta - 1}))^{n-1} \cdot \lambda_1(\mathcal L)$$. In particular, for $$\delta = 3/4$$, this gives $$\Vert\mathbf{b}_1 \Vert \le 2^{(n-1)/2} \cdot \lambda_1(\mathcal L)$$.
 * 2) The first vector in the basis is also bounded by the determinant of the lattice: $$\Vert\mathbf{b}_1 \Vert \le (2 / (\sqrt{4\delta - 1}))^{(n-1)/2} \cdot (\det(\mathcal L))^{1/n}$$. In particular, for $$\delta = 3/4$$, this gives $$\Vert\mathbf{b}_1 \Vert \le 2^{(n-1)/4} \cdot  (\det(\mathcal L))^{1/n}$$.
 * 3) The product of the norms of the vectors in the basis cannot be much larger than the determinant of the lattice: let $$\delta = 3/4$$, then  $\prod_{i=1}^n \Vert\mathbf{b}_i \Vert \le 2^{n(n-1)/4} \cdot  \det(\mathcal L)$.

LLL algorithm pseudocode
The following description is based on, with the corrections from the errata.

INPUT a lattice basis b1, b2, ..., bn in Zm    a parameter δ with 1/4 < δ < 1, most commonly δ = 3/4 PROCEDURE B* <- GramSchmidt({b1, ..., bn}) = {b1*, ..., bn*}; and do not normalize μi,j <- InnerProduct(bi, bj*)/InnerProduct(bj*, bj*);  using the most current values of bi and bj*     k <- 2; while k <= n do for j from k−1 to 1 do if |μk,j| > 1/2 then bk <- bk − ⌊μk,j⌉bj;               Update B* and the related μi,j 's as needed. (The naive method is to recompute B* whenever bi changes:                B* <- GramSchmidt({b1, ..., bn}) = {b1*, ..., bn*}) end if end for if InnerProduct(bk*, bk*) > (δ − μ2k,k−1) InnerProduct(bk−1*, bk−1*) then k <- k + 1; else Swap bk and bk−1; Update B* and the related μi,j 's as needed. k <- max(k−1, 2); end if end while return B the LLL reduced basis of {b1, ..., bn} OUTPUT the reduced basis b1, b2, ..., bn in Zm

Example from Z3
Let a lattice basis $$ \mathbf{b}_1,\mathbf{b}_2, \mathbf{b}_3 \in \mathbf{Z}^{3}$$, be given by the columns of $$\begin{bmatrix} 1 & -1& 3\\ 1 & 0 & 5\\  1 & 2 & 6 \end{bmatrix}$$ then the reduced basis is $$\begin{bmatrix} 0 & 1& -1\\ 1 & 0 & 0\\  0 & 1 & 2 \end{bmatrix},$$ which is size-reduced, satisfies the Lovász condition, and is hence LLL-reduced, as described above. See W. Bosma. for details of the reduction process.

Example from Z[i]4
Likewise, for the basis over the complex integers given by the columns of the matrix below, $$\begin{bmatrix} -2+2i & 7+3i &  7+3i & -5+4i\\ 3+3i & -2+4i & 6+2i & -1+4i\\ 2+2i & -8+0i & -9+1i & -7+5i\\ 8+2i & -9+0i & 6+3i & -4+4i \end{bmatrix},$$ then the columns of the matrix below give an LLL-reduced basis. $$\begin{bmatrix} -6+3i & -2+2i & 2-2i & -3+6i \\ 6-1i & 3+3i &  5-5i &  2+1i \\ 2-2i & 2+2i & -3-1i & -5+3i \\ -2+1i & 8+2i &  7+1i & -2-4i \\ \end{bmatrix}.$$

Implementations
LLL is implemented in
 * Arageli as the function
 * fpLLL as a stand-alone implementation
 * FLINT as the function
 * GAP as the function
 * Macaulay2 as the function  in the package
 * Magma as the functions  and   (taking a gram matrix)
 * Maple as the function
 * Mathematica as the function
 * Number Theory Library (NTL) as the function
 * PARI/GP as the function
 * Pymatgen as the function
 * SageMath as the method  driven by fpLLL and NTL
 * Isabelle/HOL in the 'archive of formal proofs' entry . This code exports to efficiently executable Haskell.