text:
User talk:80-MAN

Hello and welcome to Wikipedia!

Here are some tips to help you get started:

 * Try the Tutorial, and feel free to experiment in the test area.
 * If you need help, post a question at the Help Desk
 * Eventually, you might want to read the Manual of Style and Policies and Guidelines.
 * Remember Neutral point of view
 * Explore, be bold in editing pages, and, most importantly, have fun!

Good luck!

[[User:Meelar|Meelar (talk)]]

P.S. One last helpful hint. To sign your posts like I did above (on talk pages, for example) use the '~' symbol. To insert just your name, type ~~~ (3 tildes), or, to insert your name and timestamp, use ~~~~ (4 tildes).

Statistics
While the Stats section is an interesting idea, it's rather redundant and hurts the flow of the music articles. Wikipedia doesn't follow Allmusic's style conventions.... --Madchester 01:54, August 4, 2005 (UTC)

Hello. Please remember to always provide an edit summary. Thanks and happy editing. -- Job E  6   20:48, 22 September 2005 (UTC)

Fighting vandalism
Hi there! I was reading on your RFA that you wanted to fight vandalism beyond your watchlist. You can certainly do that without being an admin, have a look at WP:CVU for more info. I'm a big fan of the CDVF tool (which is listed on the WP:CVU page), it's very helpful in catching vandals. - Akamad 09:13, 12 December 2005 (UTC)

Bureaucratship
Sir, I apologise that you felt compelled to withdraw your request.--Anglius 02:05, 25 December 2005 (UTC)

Clean-up?
Why did you flag Kendall College of Art and Design for clean-up? Tverbeek 04:10, 6 January 2006 (UTC)

The Cleanup tag is for articles that are "ungrammatical, poorly formatted, confusing, etc," not those that you feel should have more information or be dressed up more. I've looked at other college articles, and I don't see what you mean about the KCAD article being incomplete or not "professional looking" compared to them. Most of the thirty or so I've looked at have pretty much the same level of development, except maybe with an info box (repeating information from the article), or a vanity photo added. What information do you feel is missing? Maybe more about its athletic programs, residential life, the school fight song, campus acreage? Maybe a list of non-notable former presidents? Tverbeek 16:43, 8 January 2006 (UTC)

Image Tagging for Image:Casualtiesgroup2.jpg.w300h438.jpg
Thanks for uploading Image:Casualtiesgroup2.jpg.w300h438.jpg. 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. 12:23, 16 May 2006 (UTC)

Image copyright problem with Image:Dannysdrums.jpg
Thanks for uploading Image:Dannysdrums.jpg. However, the image may soon be deleted unless we can determine the copyright holder and copyright status. The Wikimedia Foundation is very careful about the images included in Wikipedia because of copyright law (see Wikipedia's Copyright policy).

The copyright holder is usually the creator, the creator's employer, or the last person who was transferred ownership rights. Copyright information on images is signified using copyright templates. The three basic license types on Wikipedia are open content, public domain, and fair use. Find the appropriate template in Image copyright tags and place it on the image page like this:. If you have not already done so, please also include the source of the image. In many cases this will be the website where you found it.

Please specify the copyright information and source on any other images you have uploaded or will upload. Remember that images without this important information can be deleted by an administrator. If you have any questions, feel free to contact me, or ask them at the Media copyright questions page. Thank you. pred 15:42, 23 September 2006 (UTC)

Unspecified source for Image:Amp.jpg
Thanks for uploading Image:Amp.jpg. I notice the file's description page currently doesn't specify who created the content, so the copyright status is unclear. If you have not created this file yourself, then there needs to be a justification explaining why we have the right to use it on Wikipedia (see copyright tagging below). If you did not create the file yourself, then you need to specify where it was found, i.e., in most cases link to the website where it was taken from, and the terms of use for content from that page.

If the file also doesn't have a copyright tag, then one should be added. If you created/took the picture, audio, or video then the GFDL-self tag can be used to release it under the GFDL. If you believe the media meets the criteria at Fair use, use a tag such as or one of the other tags listed at Image copyright tags. See Image copyright tags for the full list of copyright tags that you can use.

If you have uploaded other files, consider checking that you have specified their source and tagged them, too. You can find a list of files you have uploaded by following [ this link]. Unsourced and untagged images may be deleted one week after they have been tagged, as described on criteria for speedy deletion. If the image is copyrighted under a non-free license (per Fair use) then the image will be deleted 48 hours after 01:12, 9 January 2007 (UTC). If you have any questions please ask them at the Media copyright questions page. Thank you. MECU ≈ talk 01:12, 9 January 2007 (UTC)

Image tagging for Image:Victor_Wooten_2_(Color).jpg
Thanks for uploading Image:Victor_Wooten_2_(Color).jpg. 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:32, 15 March 2007 (UTC)

Unspecified source for Image:Glenn5.jpg
Thanks for uploading Image:Glenn5.jpg. I noticed that the file's description page currently doesn't specify who created the content, so the copyright status is unclear. If you did not create this file yourself, then you will need to specify the owner of the copyright. If you obtained it from a website, then a link to the website from which it was taken, together with a restatement of that website's terms of use of its content, is usually sufficient information. However, if the copyright holder is different from the website's publisher, then their copyright should also be acknowledged.

As well as adding the source, please add a proper copyright licensing tag if the file doesn't have one already. If you created/took the picture, audio, or video then the GFDL-self-no-disclaimers tag can be used to release it under the GFDL. If you believe the media meets the criteria at Fair use, use a tag such as or one of the other tags listed at Image copyright tags. See Image copyright tags for the full list of copyright tags that you can use.

If you have uploaded other files, consider checking that you have specified their source and tagged them, too. You can find a list of files you have uploaded by following [ this link]. Unsourced and untagged images may be deleted one week after they have been tagged, as described on criteria for speedy deletion. If the image is copyrighted under a non-free license (per Fair use) then the image will be deleted 48 hours after 07:48, 28 March 2007 (UTC). If you have any questions please ask them at the Media copyright questions page. Thank you. ˉˉanetode╦╩ 07:48, 28 March 2007 (UTC)

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

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

WP:CVU status
The Counter-Vandalism Unit project is under consideration to be moved to and/or  status. You have been identified as a project member and your input as to this matter would be welcomed at WT:CVU. Thank you. Delivered on behalf of user:xaosflux 01:25, 10 August 2007 (UTC)

Replaceable fair use Image:JackIrons2004.jpg
Thanks for uploading Image:JackIrons2004.jpg. I noticed the 'image' page specifies that the image is being used under fair use, but its use in Wikipedia articles fails our first fair use criterion in that it illustrates a subject for which a freely licensed image could reasonably be found or created that provides substantially the same information. If you believe this image is not replaceable, please:

 * 1) Go to the image description page and edit it to add, without deleting the original Replaceable fair use template.
 * 2) On the image discussion page, write the reason why this image is not replaceable at all.

Alternatively, you can also choose to replace the fair use image by finding a freely licensed image of its subject, requesting that the copyright holder release this (or a similar) image under a free license, or by taking a picture of it yourself.

If you have uploaded other fair use media, consider checking that you have specified how these images fully satisfy our fair use criteria. You can find a list of 'image' pages you have edited by clicking on [ this link]. Note that even if you follow steps 1 and 2 above, fair use images which could be replaced by free-licensed alternatives will be deleted 2 days after this notification (7 days if not used in an article), per our Fair Use policy. If you have any questions please ask them at the Media copyright questions page. Thank you. —Remember the dot (talk) 23:19, 12 November 2007 (UTC)

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

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

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

If it is determined that the image does not qualify under fair use, it will be deleted within a couple of days according to our criteria for speedy deletion. If you have any questions please ask them at the media copyright questions page. Thank you.BetacommandBot (talk) 19:54, 13 February 2008 (UTC)

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

If it is determined that the image does not qualify under fair use, it will be deleted within a couple of days according to our criteria for speedy deletion. If you have any questions please ask them at the media copyright questions page. Thank you.BetacommandBot (talk) 23:50, 13 February 2008 (UTC)

Speedy deletion of Trillium Circle
A tag has been placed on Trillium Circle requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a band, but it does not indicate how or why the subject is notable: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, articles that do not indicate the subject's importance or significance may be deleted at any time. Please see the guidelines for what is generally accepted as notable, as well as our subject-specific notability guideline for musical topics.

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 article 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 article that would would render it more in conformance with Wikipedia's policies and guidelines. Lastly, please note that if the article does get deleted, you can contact one of these admins to request that a copy be emailed to you. Ten Pound Hammer and his otters • (Broken clamshells•Otter chirps) 17:25, 28 May 2008 (UTC)

Fair use rationale for Image:Werenothappytilyournothappy.jpg
Thanks for uploading or contributing to Image:Werenothappytilyournothappy.jpg. I notice the image page specifies that the image is being used under fair use but there is not a suitable explanation or rationale as to why each specific use in Wikipedia constitutes fair use. Please go to the image description page and edit it to include a fair use rationale.

If you have uploaded other fair use media, consider checking that you have specified the fair use rationale on those pages too. You can find a list of 'image' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "Image" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been uploaded, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Undeath (talk) 05:43, 24 June 2008 (UTC)

Hey there 80-MAN, I work at Rockstar Energy Drink, and I recently uploaded an updated image (File:Rockstar-Original-2009.jpg) of our original 16 oz. can, however I'm not so familiar with the Wikipedia workings. I was wondering if you might possibly be able to assist me with updating the current image of our previous product artwork with our newly designed 2009 version. Or at least explain to me how I might be able to link the image I uploaded to the Rockstar Energy Drink Wiki Page.

Thank you so much, I really appreciate your time and your help!

Regards, DDDatRockstar —Preceding unsigned comment added by DDDatRockstar (talk • contribs) 22:59, 5 October 2009 (UTC)

Fair use rationale for File:Gayfuelcan.jpg
Thanks for uploading or contributing to File:Gayfuelcan.jpg. I notice the file page specifies that the file is being used under fair use but there is not a suitable explanation or rationale as to why each specific use in Wikipedia constitutes fair use. Please go to the file description page and edit it to include a fair use rationale.

If you have uploaded other fair use media, consider checking that you have specified the fair use rationale on those pages too. You can find a list of 'file' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been tagged, as described on criteria for speedy deletion. If you have any questions please ask them at the Media copyright questions page. Thank you. Sfan00 IMG (talk) 13:43, 25 October 2010 (UTC)

Non-free rationale for File:Rockstar.jpg
Thanks for uploading or contributing to File:Rockstar.jpg. I notice the file page specifies that the file is being used under non-free content criteria, but there is not a suitable explanation or rationale as to why each specific use in Wikipedia is acceptable. Please go to the file description page, and edit it to include a non-free rationale.

If you have uploaded other non-free media, consider checking that you have specified the non-free rationale on those pages too. You can find a list of 'file' pages you have edited by clicking on the "my contributions" link (it is located at the very top of any Wikipedia page when you are logged in), and then selecting "File" from the dropdown box. Note that any non-free media lacking such an explanation will be deleted one week after they have been tagged, as described on criteria for speedy deletion. If the file is already gone, you can still make a request for undeletion and ask for a chance to fix the problem. If you have any questions, please ask them at the Media copyright questions page. Thank you. Sfan00 IMG (talk) 11:34, 26 June 2012 (UTC)

ArbCom elections are now open!
Hi, You appear to be eligible to vote in the current Arbitration Committee election. The Arbitration Committee is the panel of editors responsible for conducting the Wikipedia arbitration process. It has the authority to enact binding solutions for disputes between editors, primarily related to serious behavioural issues that the community has been unable to resolve. This includes the ability 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, you are welcome to review the candidates' statements and submit your choices on the voting page. For the Election committee, MediaWiki message delivery (talk) 22:17, 30 November 2015 (UTC)

Orphaned non-free image File:Blink-182 - Cheshire Cat cover.jpg
 Thanks for uploading File:Blink-182 - Cheshire Cat cover.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 the criteria for speedy deletion. Thank you. --B-bot (talk) 18:25, 8 February 2016 (UTC)

Proposed deletion of Matt Wong

The article Matt Wong has been proposed for deletion  because of the following concern:
 * Inadequately referenced BLP about an artist which does meet WP:NMUSIC or WP:GNG

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. McMatter (talk)/(contrib) 23:23, 16 February 2016 (UTC)

Speedy deletion nomination of Matt Wong

A tag has been placed on Matt Wong requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a band or musician that does not credibly indicate how or why the subject is important or significant: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, such articles may be deleted at any time. Please read more about what is generally accepted as notable.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. If the page is deleted, and you wish to retrieve the deleted material for future reference or improvement, then please contact the. User:Namiba 18:33, 28 May 2020 (UTC)

Speedy deletion nomination of John Christianson (musician)

A tag has been placed on John Christianson (musician) requesting that it be speedily deleted from Wikipedia. This has been done under section A7 of the criteria for speedy deletion, because the article appears to be about a band or musician that does not credibly indicate how or why the subject is important or significant: that is, why an article about that subject should be included in an encyclopedia. Under the criteria for speedy deletion, such articles may be deleted at any time. Please read more about what is generally accepted as notable.

If you think this page should not be deleted for this reason, you may contest the nomination by visiting the page and clicking the button labelled "Contest this speedy deletion". This will give you the opportunity to explain why you believe the page should not be deleted. However, be aware that once a page is tagged for speedy deletion, it may be deleted without delay. Please do not remove the speedy deletion tag from the page yourself, but do not hesitate to add information in line with Wikipedia's policies and guidelines. If the page is deleted, and you wish to retrieve the deleted material for future reference or improvement, then please contact the. User:Namiba 19:34, 28 May 2020 (UTC)

Proposed deletion of John Christianson (musician)

The article John Christianson (musician) has been proposed for deletion because of the following concern: "Non-notable musician."

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. User:Namiba 14:03, 29 May 2020 (UTC)

Proposed deletion of Matt Wong

The article Matt Wong has been proposed for deletion because of the following concern: "Non-notable musician."

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. User:Namiba 14:06, 29 May 2020 (UTC)

Nomination of Matt Wong for deletion
A discussion is taking place as to whether the article Matt Wong 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/Matt Wong 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. User:Namiba 11:22, 30 May 2020 (UTC)

Proposed deletion of Ryland Steen

The article Ryland Steen has been proposed for deletion because of the following concern: "Non-notable musician."

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. User:Namiba 20:51, 2 June 2020 (UTC)

Orphaned non-free image File:Favoritenoise.jpg
Thanks for uploading File:Favoritenoise.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) 18:30, 1 March 2021 (UTC)

Orphaned non-free image File:Keepyourreceipt.jpg
Thanks for uploading File:Keepyourreceipt.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) 18:42, 1 March 2021 (UTC)

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

title: User talk:80-MAN


text:
Variable Data Intelligent Postscript Printware

Variable Data Intelligent Postscript Printware is an open language from Xerox that enables highest-performance output of variable-data PostScript documents. It is used by the FreeFlow VI Suite (VIPP) front end.

Origins
VIPP was originally called XGF and it is simply groups of PostScript dictionaries which provide macros that simplify writing of complex PostScript commands. PostScript is powerful language which allows variable data printing and personalization of the data stream with the right commands. To implement some of these features a programmer has to write a few, or sometimes many, lines of code. Xerox developed macro procedures in PostScript language dictionaries to make page control easier.

For example, to merge a graphic form with the data stream requires an understanding of PostScript commands according to the Adobe PostScript Language Reference Manual (PLRM, otherwise known as the "Red book"). Xerox gives you this feature through this simple command "(formname) SETFORM", where formname is the name of the form accessible from the Xerox printer controller (DocuSP or FreeFlow Print Server). Several VIPP commands are identical to PostScript commands.

VIPP was originally written by couple of Xerox systems Analysts in Switzerland to enable the highest speed Postscript printers, at that time 50 pages per minute, to have the features of Xerox's proprietary production printing languages PDL and FDL which provide simple variable data printing. Xerox Corporation adopted the idea and developed their work by putting these procedures on Sun Microsystems hosts where the Adobe interpreter also resides. Together, these modules give complete control over the printing engine and data stream.

Operation
VIPP can be used in four different modes: Database mode, Line mode, XML mode and Native mode. In Database mode, the programmer can quickly implement a printing solution, for example a billing application, for a delimited database file. In Line mode, an existing print application can be enhanced with form overlays, font selection, color and other features offered by modern laser printers. In XML mode, an XML file can be turned into a readable document. In all modes, VIPP offers conditional logic manipulation of the data.

For example, a multi-page bill could be printed in duplex (two-sided) mode with the first page selected from a paper tray loaded with a perforated sheet for remittance return, and the back side printed with disclosures and instructions, while subsequent pages of billing detail are printed on plain paper. The VIPP programmer might even insert an OCR or MICR line for remittance processing, complete with a check digit.

Xerox markets an Interactive Development Environment for VIPP called FreeFlow VI Designer. and FreeFlow VIPP Pro Publisher. These help a programmer code applications rapidly in VIPP. FreeFlow VIPP Pro Publisher is a plugin to the popular Adobe InDesign product enabling WYSIWYG VIPP development.

Licensing
VIPP is licensed to specific printer controllers running a Solaris or Microsoft Windows operating system, including some PostScript capable office devices that have non-volatile memory (such as a hard disk). VIPP is capable of being installed on any device which has a PostScript interpreter. FreeFlow Print Server (FFPS), formerly DocuSP is VIPP enabled but is limited in producing up to 200 pages until appropriately licensed.


text:
Talk:Knoppix

Knoppix
Knoppix mostly consists of free and open source software, but also includes proprietary software
 * The cite note [3] only specifies that exceptions to the rule of only having free software in the distrobution may be made if the license is "liberal" enough (ex, free distrobution of the binary). That doesn't seem to say that proprietary software is actually included. —Preceding unsigned comment added by 98.108.195.223 (talk) 09:21, 14 July 2010 (UTC)

Kernel version
The page doesn't list this, but Knoppix 6.0.1 uses kernel version 2.6.28.4. Should this be included? —Preceding unsigned comment added by 65.189.27.129 (talk) 16:28, 19 March 2009 (UTC)

Optimizing Performance
I moved the following section from the article. I see several issues with it, mostly being poorly useful, but someone may be able to address this and move back a modified section. The first issue is that copying the Knoppix folder to a partition is pretty much installing it. I can only see this procedure as useful in corner cases. Another issue about the rest of the section is that few systems have 1 GB of RAM. Finally, the fact that speed isn't a reason to use Knoppix doesn't mean that its speed doesn't matter. --Chealer 07:28, 13 July 2006 (UTC)

One drawback of using Knoppix is that running the programs from the CD-ROM leads to long program loading time. There is a relatively straightforward way to accelerate work under Knoppix if an empty FAT32-partition is available. The Knoppix folder may be copied into this partition by using any operating system. When the Knoppix system boots, the CD-ROM or DVD is only used for loading an initial minimal system and then the switch over to the Knoppix folder on the harddisk is made for further work. This leads to straightforward upgrading of a new version of Knoppix. People just replace a folder on the harddisk partition. It is also possible to get the entire CD copied into RAM by using the "toram" option. However, this takes some time and requires enough abundant memory- 1 gig of RAM for the CD version. Damn Small Linux is a Knoppix variant that uses less than 128mb of RAM to cache all of its files. The CD or DVD may be removed after booting if this option is used.

Another option is to install Knoppix on the hard drive, as described in the Usage section, so that the CD/DVD is never used.

Knoppix's relatively poor performance in this respect is generally not an issue, since the main reasons to use Knoppix do not include speed but rather having a working Linux system by just inserting a CD/DVD and perhaps a USB memory stick. -- The preceding section was added by Chealer on 13. July 2006, 07:28 (UTC)

 * This would be good to add into some subpage of a Wikibooks entry about Knoppix. -Mardus (talk) 17:46, 30 December 2012 (UTC)

Cheat Codes
The cheat codes seem like a useful resource. Is having them listed a problem?

 * I don't see why. The description doesn't make too clear what they are, though; that's something that could be improved. -- Antaeus Feldspar 00:01, 25 August 2005 (UTC)

Tomorrow I'll put them back, maybe adding some explanation, unless someone has substantive objections.--Tom harrison 00:05, 25 August 2005 (UTC)
 * Yes, it's problematic and I'm moving them here. Having them forces to duplicate the maintainance of something which is much more manual material than encyclopedic material. Furthermore, they were very partial. Having an example may be acceptable. What was in the article follows.--Chealer 03:35, 19 May 2006 (UTC)

Boot Options
Boot options are also known as cheat codes. Automatic hardware detection may fail, or the user may want to use something other than the default settings. For example, the user may wish to boot into xfce, or boot a plain console, or proceed without SCSI support. For this, Knoppix allows the user to enter one or more cheat codes at the prompt before booting. If the user doesn't enter a cheat code, or if no key is pressed before the timeout, Knoppix will boot with its default options. Cheat codes affect many auto-detection and hardware options. Many cheat codes also affect the GUI. The list of cheat codes is available on the Knoppix mirrors, and can be seen at boot time by pressing F1.

Languages
To set a language other than the default (CDs are available with either German or English as the default language), type your language abbreviation at the boot prompt. For US English, one would type:

Graphic cards
The graphics card device driver is very important in using this distribution as it relies on a Graphical user interface, although most expert users can make use of the command line interface. If your graphics card does not work, it may be that it is new (or exotic) and is not in the knoppix hardware database yet. New cards will usually work under Linux, but they may have to be run using a generic driver, with a boot option like this:

UnionFS and read-only media
I'm not sure about the accuracy of the article concerning the recent addition of UnionFS to Knoppix and its effects. The article states that changes can only be made to the boot media if it was written on a CD-RW or other rewritable media. However, it was my understanding that one only needed the boot media to be multi-session-writable, and that at boot time the UnionFS would read all sessions and then boot the union of the filesystems contained therein. Can someone confirm or deny this? -- Antaeus Feldspar 19:02, 20 September 2005 (UTC)

 * I don't think you can just burn Knoppix to a CD and leave the session open. I think Knoppix would have to be remastered to have this ability, like slax. After that would it still be Knoppix? But certainly you are correct in principle. Maybe somewhere else in the article there could be a mention of the ability to do this.--Tom harrison 21:59, 20 September 2005 (UTC)

 * I updated the article and as well the article about the UnionFS file system and I hope that the passage outlines now the main use of it. (union of read-only file systems plus read-write filesystems; the DVD editions has two large read-only image files). Hirzel 13:05, 29 November 2005 (UTC)

Persistent home (knoppix.img)
When creating a persistent home directory a file called knoppix.img is created. It is said to contain a EXT2 file system. Is this correct? Is it possible to access this file system MSfrom Windows?

62.202.117.179 10:00, 2 December 2005 (UTC)

UnionFS and writing to the boot medium

 * In the latest version of Knoppix the UnionFS filesystem even allows a user to write to the boot media (e.g., if Knoppix has been burned onto a CD-RW or DVD±RW).

Can someone provide a source for it? 'Cause I've googling to find some details and still can't figure out how. I've successfully booted from DVD-RW, made some changes to the system (like: new drivers, software). The changed files are visible on /ramdisk but now I can't save it. Something along the lines of growisofs -M /dev/hdc /ramdisk complains that the medium is "not appendable". Did I burn the Knoppix image with bad options? Anyway, how can you burn to a medium that's still mounted? So, any Knoppix gurus around here? 'Cause this feature sounds great (if it's true that is)! --Misza13 (Talk) 15:26, 4 January 2006 (UTC)

Now Knoppix 5.0
Now since Cebit is Knoppix 5.0 available as "KNOPPIX_V5.0DVD-2006-02-25-DE.iso.torrent" and "KNOPPIX_V5.0DVD-2006-02-25-EN.iso.torrent". So s.b. could Update this page with screenshot and.... New in Knoppix is .... no I do not copy it here, Please look after on linux pages and with www search machines (par example google).

--138.89.56.7 19:31, 29 March 2006 (UTC) Dieter

Does anyone have a link to a Knoppix 5.0 CD? Don't have a DVD burner at hand here. And the 5.0 CD seems to be hidden pretty well. Guaka 18:42, 28 April 2006 (UTC)

corrections to Drawbacks of Knoppix
Now Knoppix 4.0 is able to install additional SW and drivers on an a file on your computer, which is a kind of immage that works like an overlay above the DVD contents. With restrictions first statement is not always true.

Point "engaged optical drive" is not at all correct. tohd and fromhd is described in next chapter. In some cases a work around is possible.

The FAT 32 partition need not to be empty. It has to have only enough free space for the folder knoppix and a big file in the folder, which is not bigger than the DVD/CD image.

--138.89.56.7 19:31, 29 March 2006 (UTC) Dieter

Improper tone and such
Looking through this article, I see that it addresses the reader directly ("you can do this," etc.), contrary to the style required by a Wikipedia article. I'll put Template:Inappropriate person on it if nobody objects. 70.114.7.71 23:12, 6 June 2006 (UTC)
 * I've finished a complete review of the article, which should have solved this.--Chealer 01:47, 18 July 2006 (UTC)

Popularity
am i alone in thinking any subhead that begins with Although there is no data to base this claim on, deserves no space on wiki? the fact is probably true, but it needs a citation. Kaini 02:58, 25 September 2006 (UTC)

Dead Distro?
I have removed this link as I saw some activity at and. If you have evidence that this is indeed a dead distro no longer looked after, please provide specific evidence - ie changelogs that haven't been touched for a long time (ie several months) etc. I am happy to discuss, and put that line back in, but need specific evidence, because as far as I can tell it is still being maintained. Floorwalker 04:02, 20 September 2007 (UTC)

Current versions - Update on Knoppix 5.3.1 status
Last year a free download version of Knoppix 5.2 (CEBit-version) was not available. After the CEBit this year (2008) with version 5.3 Klaus Knopper has announced the download version 5.3.1. The "roadmap" of Knoppix 5.3.1 is here. --AlloG (talk) 07:52, 18 March 2008 (UTC)

 * Knoppix 5.3.1 is "out" today. Download http://torrent.unix-ag.uni-kl.de/ It's too fresh to find any other Information now. Perhaps for further Information watch the Knoppix forums (e.g. on http://www.knoppix.net/)--AlloG (talk) 10:19, 27 March 2008 (UTC)

 * Knoppix 5.3.1 is announced on knopper.net: http://www.knopper.net/knoppix/knoppix53-en.html —Preceding unsigned comment added by AlloG (talk • contribs) 10:08, 28 March 2008 (UTC)

= Old discussions =

Memory requirements 128k!?
This article says that Knoppix requires "at least" 128k memory. Am I being dumb in thinking this is far too small a value? I read it as 128 meg before I double checked. IDX 20:42, 28 September 2005 (UTC)

128M is the correct figure. I'd be surprised if it ran on 128K. -- Antaeus Feldspar 20:54, 28 September 2005 (UTC)

Also, If it does not have enough ram to run kde (82MB) it will run TWM. Thanks, --RaviC 21:53, 30 April 2007 (UTC)

Did Masssiveego rant?
I just cleaned up the "Problems with Knoppix" section, but look at his revision. Seems like this guy had problems with Knoppix that was a little personal. What do you guys think? --Bash 04:02, 29 September 2005 (UTC)

 * I don't have much problem with it as it now stands, as long as it's factual. I question "Knoppix 3.9 cannot work with many soundcards..." Many? I've used Knoppix with at least six different soundcards and not had a problem. I might change this to "some popular soundcards," but "some common hardware" might be even more accurate. Is Knoppix less likely to support a random soundcard than a random network card? And if so, is that a Knoppix problem or a Linux problem?

 * I might change "Motherboards with a bios before 2002" to "Some motherboards with a bios before 2002." I've used Knoppix 3.4 on three boxes from 1998-1999 without any issues.

 * The 128MB memory requirement only applies to the default boot into KDE. If you boot without X into a console you can run Knoppix 3.4 with 32MB, if you can use some of the hard-drive for swap.

 * Still, it is "Problems with Knoppix," so I wouldn't want to minimize any legitimate problems. Massiveego's addition of links was very useful, and I want to look at them carefully before I change much. Tom harrison 13:24, 29 September 2005 (UTC)

 * Unfortunately Knoppix has many limitations with old hardware

made before 1998 and motherboards made 2002. Other people have expressed thse problems on-line. Problems such as.. Knoppix is slow loading more then 2 minutes at boot up, lacking macromedia shockwave or swf flash players, lacking PDF support.

Problems like Knoppix cannot autoload certain other hardware cards such as external network devices, and cannot write to a window based system. Knoppix cannot be upgraded, or when devices are set when used as live CD and with no hard drive. These points of limitation should in my opinion should show that Knoppix set up as is, lack utility nor is good as a long term solution. --Masssiveego 18:55, 10 October 2005 (UTC)

added hard drive install details
hi, i'm new to wikipedia editing so i wasn't able to put all the links in and stuff, but i noticed that there was nothin in here that mentioned the ability of knoppix to be installed to the hard drive. i found this quite a shame, as i find it one of the most usefull aspects of knoppix (i am in fact on a hard drive installation of knoppix as i type this). The fact that you can read slashdot while waiting for the install to complete - pure genius. anyway, i hope someone tidys up the linking aspect of it and any other polishable bits, but please leave in the installation section as i was very surprised nothing was put here about this knowledge - withnail420
 * hey, welcome to wiki - unfortunately, wikipedia is not a howto - the information you added is perhaps better suited to wikibooks or something instead of pedia, so it's been removed from the article. --Kaini 02:22, 19 October 2006 (UTC)

 * shame, i thought it was quite relevant,especially as the part about a persistant home directory is included, which seemed quite how-to (and relevant) -like. withnail420

 * Wikipedia articles can describe the general functionality and purpose of an operating system, including key features such as the persistant home directory. However, this is only to establish an understanding of the system from a cultural and historical point of view. It does not describe the actions a user would take to set one up. The article does mention hard disk installation is possible. It is not necessary to walk the reader through all of the steps. An encyclopedia should be written in a formal, neutral tone; not as though a person is writing directly to the reader in their own language. Otherwise, it becomes the smorgasbord that is Uncyclopedia.

List of Knoppix Variations
I've added a link to the Knoppix wiki to that list, but since I suspect it is likely to be the most up to date version, the section may be removed entirely. Any thoughts on this ? Comte0 17:32, 9 February 2007 (UTC)

Adriane Knoppix acronym
Adriane is not a recursive acronym. It might be a backronym. Can anyone verify? --Daev 15:21, 28 June 2007 (UTC)

5.2 release
There is no info in the article about 5.2, that was released in CEBIT 07 —Preceding unsigned comment added by ManoloKosh (talk • contribs) 10:45, 28 November 2007 (UTC)

Is Knoppix DEAD?!
Some one added just one word into the article to change it's meaning: "Knoppix is a dead Linux Distribution...". I don't know if it's really dead, it's just a very long time since they released a new version. Can someone clarify on this? --Bruin_rrss23 (talk) 03:50, 29 November 2007 (UTC)
 * I am confused as well about the rumored "death." I have been using the Knoppix Live DVD for a while now (when it comes in handy to have a boot disc, that is). I only just visited the article to see if there was any news. I couldn't find anything on knoppix.net, knoppix.org, or knopper.net. I admit that I might have missed something, but if that is the case, the news of the death of Knoppix isn't exactly the most widely broadcasted news out there. When I search google for "knoppix dead" I get articles and forums that go back as far as 2003, which is just out of the known scope. We need something more recent, and not just rumors. --Trakon (talk) 09:20, 29 November 2007 (UTC)

No - not so far as I know. I removed, and as requested earlier by someone else, would the anonymous user who keeps putting that in either stop, or else supply evidence. Granted, Klaus Knopper seems to be a little behind schedule with his last edition, but I see nothing on his website indicating that he does not plan to go forward with the next release. And besides, we're just talking about a few months here, give the guy a break. He has a great product and I wish him all the best. Bmord (talk) 23:27, 29 November 2007 (UTC)

Version history
Can we please compile a list of the version history into a similar table?

http://en.wikipedia.org/w/index.php?title=Ubuntu_(Linux_distribution)&oldid=203271934#Releases Altonbr (talk) 03:28, 25 February 2008 (UTC)

This is not ubuntu. So create a Knoppix-table you want or remove it !

new version and ubuntu
I edited the Ubuntu reference but then I removed because it's unrelated to Knoppix. Not sure what is/was the rationale for having it on the 'see also' section. By the way, I don't follow the Knoppix realease history but it looks like version 5.3 is out and there is no reference in the article about it: http://www.knopper.net/knoppix/knoppix53-en.html Universalcosmos (talk) 16:06, 21 March 2008 (UTC)

Versions - CD development no longer in parallel
In Knoppix I changed the sentence to read as follows.

As of April 2008, from version 4 up until 5.1.1, Knoppix has been split into a DVD "maxi" edition (with over 9GB of software), and a CD "light" edition, both developed in parallel, after 5.1.1 only the DVD version is available.

I also added the html comment "please update this if newer CD version becomes available."

This is supported by Klaus Knopper's statement here: "Not started yet, probably after release date of DVD".-84.222.17.27 (talk) 20:55, 24 April 2008 (UTC)

Clarify CD - DVD differences earlier
I think that perhaps large sections of this need to be reworked due to recent Knoppix developments related to the vast differences between the CD and DVD versions, which have become more and more divergent. I think a basic reader would get the impression that the current cd version is just a limited version of the full DVD version- ie basically the same with core functions, but the DVD just has more apps. However, the two versions now use different desktop managers (KDE vs LXDE), different browsers/file managers, etc. The actual differences aren't really alluded to until the Versions section, well into the article, while the Contents section practically implies that KDE is the default desktop for all versions of Knoppix. That was once the case, but not anymore.

I don't really have a thorough enough knowledge to correct these issues, but thought it should be brought to light. It's worth noting that this is a general problem in the Knoppix community- finding information about the new CD version can be difficult. But if anyone is up to the task, I think it would be helpful. Canjecricketer (talk) 18:47, 23 February 2009 (UTC)

=New discussions=

Historical significance
I think Knoppix's automatic hardware detection and configuration was a really massive contribution to the usability of Linux. Was there anything else that did insane things like boot directly into X without any user intervention before Knoppix? I know there were a couple times I booted off a Knoppix CD just to get the information to configure another distro, before the major distros started adding Knoppix's auto-detection. —Darxus (talk) 17:36, 11 August 2010 (UTC)

Talk Page
This talk page is truly bizarre, it seems as though someone moved new discussions to the top a few years ago, against WP:TALK recommendations, and new talk appears at the top and the bottom now! 65.94.69.242 (talk) 12:14, 8 January 2011 (UTC)

Latest Version Layout
I have been working on a Linux Users Group resource page and need some conformity of all the Wiki Linux versions and distributions. Debian has an excellent template and I have made an RSS reader to pluck version data from the wiki page. Would be nice if I could get all of them to follow this method and my page could keep up to date with all the latest versions. RSS source path http://en.wikipedia.org/w/index.php?title=Template:Latest_stable_software_release/Debian&feed=rss&action=history RSS Template. http://en.wikipedia.org/w/index.php?title=Template:Latest_stable_software_release/Debian&action=edit — Preceding unsigned comment added by Icarusfactor (talk • contribs) 02:41, 23 August 2012 (UTC)

Should old discussions be archived?
I propose that the talk section Old Discussions (or most parts of it) should be archived, given that its presence and placement in the talk page as it currently is may appear confusing. -Mardus (talk) 17:48, 30 December 2012 (UTC)

Hardware requirements
I've updated hardware requirements to be slightly more realistic. The official minimum system requriements are very outdated (the page itself was last updated on 17.06.2008).

I've updated the graphical requirements part to a minimum 256 Mb of RAM, as 128 M is very borderline and allows only entering LXDE in Knoppix 6.0 and that's that. Even if a swap file or partition might help out in a system with just 128 Mb RAM, then I still won't recommend it to anyone. The current requirements recommendation is thus based on a user not being able to use swap at all. -Mardus (talk) 18:14, 30 December 2012 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Knoppix. 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/20080612030833/http://www.efytimes.com/efytimes/fullnews.asp?edid=17094 to http://www.efytimes.com/efytimes/fullnews.asp?edid=17094

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) 05:02, 7 May 2017 (UTC)

title: Talk:Knoppix


text:
Thespesia populnea

Thespesia populnea, commonly known as the portia tree, Pacific rosewood, Indian tulip tree, or milo, among other names, is a species of flowering plant belonging to the mallow family, Malvaceae. It is a tree found commonly on coasts around the world. Although it is confirmed to be native only to the Old World tropics, other authorities consider it to have a wider, possibly pantropical native distribution. It is thought to be an invasive species in Florida and Brazil.

Distribution
Thespesia populnea is native to tropical coastlines and is adapted for oceanic dispersal and growth in island environments. It is known from both coasts of Africa, tropical Asia, northern Australia, the Pacific Islands (including Hawaii), the tropical Pacific coast of the Americas from Mexico south to Colombia, the West Indies, and Florida in the United States. Its exact native distribution has been debated, with most authorities considering it to only be native to the Old World tropics, some others such as Plants of the World Online including the Pacific Islands in its native range, and others such as the IUCN Red List and the USDA also including the tropical Americas within its native range. The IUCN only considers T. populnea to be introduced and invasive in Florida. It may also be invasive in northern Brazil.

Like the related Hibiscus tiliaceus, it was one of the main sources of bast fibers for the production of cordage and wood for Austronesian outrigger ships and carving. Though the plant seeds can survive for months on sea currents, no remains of T. populnea have been recovered from Polynesia prior to the Austronesian expansion (c. 5,000 BP), thus it is regarded by some authors as a canoe plant, deliberately carried and introduced by Austronesian voyagers in the islands they settled. However, it is still considered questionably indigenous to the Pacific islands, including Hawaii, by many other authorities. In Hawaii, it is classified as a native species and is used in habitat restoration projects for the degraded Hawaiian tropical dry forests alongside the definitively native tree species Dodonaea viscosa and Cordia subcordata.

Description

The Portia tree reaches a height of 6 - 10 m tall and its trunk can measure up to 20 - 30 cm in diameter. It grows at elevations from sea level to 275 m in areas that receive 500 - 1600 mm of annual rainfall. The Portia tree is able to grow in the wide range of soil types that may be present in coastal environments, including soils derived from quartz (sand), limestone, and basalt; it favours neutral soils (pH of 6–7.4). Pollen grains are approximately 70 microns in diameter.

Uses
The heartwood of the Portia tree is dark reddish brown to chocolate brown and has a specific gravity of 0.55 to 0.89.

Portia tree is known as milo or miro in Polynesian languages. It is popular in Hawaii for woodworking (commonly turned into bowls) because of the range of colours expressed (tan, through yellow, to red). The trees were regarded as sacred in Polynesian culture, and were commonly planted in marae sites along with trees like Ficus, Fagraea berteroana, Casuarina equisetifolia and Calophyllum inophyllum. Traditionally it was planted in sacred groves and used for religious sculpture throughout eastern Polynesia. In Tahiti, Milo wood is used in the making of the to'ere (slotted wooden drum), used in traditional Tahitian tribal drumming. Makoi was used for the rongorongo tablets of Easter Island. Since the advent of aluminium-hulled boats in the 20th century, Pitcairners have made regular trips to Henderson Island to harvest miro wood. Usually they venture to Henderson only once per year, but may make up to three trips if the weather is favourable. Pitcairners carve the wood into curios, from which they derive much of their income.

In New Ireland, Portia wood is used to make hourglass drums. In Tonga, its bark is used to treat mouth infections among infants, and its wood is used to make canoes, house parts, and artwork.

In Indonesia they are known as baru laut, baru pantai or waru lot. The Ambonese cook the leaves into a dish with vegetables.

In South Asia, it is used to make the thavil, a Carnatic musical instrument of South India. The flower of the Portia tree played a part in Sri Lanka's independence movement, when it was sold on Remembrance Day by the Suriya-Mal Movement instead of the poppy to aid Sri Lankan ex-servicemen. The wood from the tree was used by early Tamil people to make instruments in ancient Tamilakam. It can be used for the cellulose production from the plants [Singh et al. 2019].

In some parts of the world, such as Hawaii and southern India, T. populnea is considered an important species in habitat restoration projects for coastal dry forests.

title: Thespesia populnea


text:
User talk:Michael Krewson

Welcome to the Wikipedia
Here are some links I thought useful:

 * Tutorial
 * Help desk
 * Foundation issues
 * Policy Library
 * Utilities
 * Cite your sources
 * Verifiability
 * Wikiquette
 * Civility
 * Conflict resolution
 * Neutral point of view
 * Pages needing attention
 * Peer review
 * Bad jokes and other deleted nonsense
 * Brilliant prose
 * List of images
 * Boilerplate text
 * Current polls
 * Mailing lists
 * IRC channel

Feel free to contact me personally with any questions you might have. The Village pump is also a good place to go for quick answers to general questions. You can sign your name by typing 4 tildes, like this: ~.

Be Bold!

Sam [Spade] 22:40, 6 Oct 2004 (UTC)

title: User talk:Michael Krewson


text:
Mali national football team

The Mali national football team (French:  Équipe de football du Mali) represents Mali in men's international football and is governed by the Malian Football Federation. The team's nickname is Les Aigles. They represent the country at tournaments organized by both FIFA and the Confederation of African Football (CAF).

While Mali is a major youth football power in both Africa and the world, they have never qualified for any senior FIFA World Cup finals in history. They have qualified for the Africa Cup of Nations on 13 occasions.

Mali were suspended by FIFA on 17 March 2017 due to 'government interference' with the national football association, namely dissolving its executive committee. However, the side was re-instated by FIFA on 29 April after the executive committee was re-introduced by the Malian government.

History
Mali reached the 1972 African Nations Cup final, but lost 3–2 to Congo. They failed to qualify for the finals again until 1994 when they reached the semi-finals, an achievement repeated in 2002, 2004, 2012 and 2013.

They played their first World Cup qualifier in the year 2000. As part of the CAF's qualifiers for the 2002 World Cup, Mali lost in the preliminary round to Libya. Two years later, the country hosted the 2002 African Cup of Nations.

Mali's under-23's team managed to qualify for the 2004 Summer Olympics in Greece. The team coached by Cheick Kone managed to reach the quarter-finals of the Olympic tournament before losing to Italy.

In the 2006 World Cup qualifiers, Mali beat Guinea-Bissau in the preliminaries. In the resulting second round, Mali finished fifth in its group. On 27 March 2005, riots broke out in Bamako after Mali lost a World Cup qualifier to Togo, 2–1 on a last minute goal.

In the 2010 African Nations Cup, Mali made football headlines for coming back from losing 4–0 with eleven minutes left to level 4–4 with Angola.

Tunisia
The rivalry between Mali and Tunisia has been evident in recent years in terms of the number of frequent matches, especially in the Africa Cup of Nations. The two teams met for the first time on 6 January 1974, during a friendly match in Bamako, which ended with a 1–0 victory for Mali. The match between the two teams in the 1994 African Cup of Nations, which was held in Tunisia, remains one of the biggest setbacks witnessed by the Tunisian national team, as Mali won the match 2–0, which led to Tunisia's early exclusion from the tournament that was held on its soil. In recent years, the team's matches have continued, as they met in the last three consecutive editions of the African Cup of Nations 2019, 2021 and 2023, all of which were in the group stage, where Mali won two matches and one ended in a draw. The two teams met in the third and final round of the 2022 World Cup qualification. Two round-robin matches were played. However, Tunisia qualified for the World Cup after winning the first leg in Bamako 1–0 with an own goal from defender Moussa Sissako, and a goalless draw prevailed in the return match in Radès. This was Mali's closest chance of qualifying for the World Cup. The competition record remains with Tunisia with a slight advantage. Tunisia won 6 matches, 3 of which ended in draws, and Mali won 5 matches.

Results and fixtures
The following is a list of match results in the last 12 months, as well as any future matches that have been scheduled.

Coaching history

 * Caretaker managers are listed in italics.

 * 🇲🇱 Ben Oumar Sy (1960–66)
 * 🇭🇺 György Tóth (1966–70)
 * Karl-Heinz Weigang (1970–73)
 * Mykola Holovko (1979–82)
 * 🇲🇱 Kidian Diallo (1982–89)
 * 🇲🇱 Molobaly Sissoko (1989–93)
 * 🇲🇱 Mamadou Keïta (1993–97)
 * 🇫🇷 Christian Sarramagna (1998–2000)
 * 🇮🇹 Romano Mattè (2000–01)
 * 🇵🇱 Henryk Kasperczak (2001–02)
 * 🇫🇷 Christian Dalger (2002–03)
 * 🇫🇷 Henri Stambouli (2003–04)
 * 🇫🇷 Alain Moizan (2004)
 * 🇲🇱 Mamadou Keïta (2004–05)
 * 🇫🇷 Pierre Lechantre (2005–06)
 * 🇲🇱 Amadou Pathé Diallo (2006)
 * 🇫🇷 Jean-François Jodar (2006–08)
 * 🇳🇬 Stephen Keshi (2008–10)
 * 🇫🇷 Alain Giresse (2010–12)
 * 🇲🇱 Amadou Pathé Diallo (2012)
 * 🇫🇷 Patrice Carteron (2012–13)
 * 🇲🇱 Amadou Pathé Diallo (2013)
 * 🇵🇱 Henryk Kasperczak (2013–15)
 * 🇫🇷 Alain Giresse (2015–17)
 * 🇲🇱 Mohamed Magassouba (2017–2022)
 * 🇲🇱 Éric Chelle (2022–)

Current squad
The following players were called up for the 2026 FIFA World Cup qualification matches against Ghana and Madagascar on 6 and 10 June 2024.

Caps and goals updated after the match against 🇬🇭 ghana on 6 June 2024.

Recent call-ups
The following players have been called up for Mali in the last 12 months.

DCL Player refused to join the team after the call-up. INJ Player withdrew from the squad due to an injury. PRE Preliminary squad. RET Player has retired from international football. SUS Suspended from the national team.

Records

 * Players in bold are still active with Mali.

Africa Cup of Nations
Mali have never won the Africa Cup of Nations; their best result at the tournament was runners-up in 1972. Mali have qualified for the tournament thirteen times in total, finishing as runners-up once, third twice, and fourth three times. Prior to 2008, each time Mali qualified, they reached the knockout stage having only qualified four times before then.

African Nations Championship
Mali has competed in five African Nations Championship tournaments, finishing as runners-up twice.

Head-to-head record
As of 11 June 2024

Continental

 * Africa Cup of Nations
 * Runners-up (1): Silver medal africa.svg 1972
 * African Nations Championship
 * Runners-up (2): Silver medal africa.svg 2016, 2020

Other tournaments

 * Amilcar Cabral Cup
 * Champions (3): 1989, 1997, 2007
 * Runners-up (4): –
 * Qatar International Friendship Tournament
 * Third place (1): 2009–10

title: Mali national football team


text:
Multinomial distribution

In probability theory, the multinomial distribution is a generalization of the binomial distribution. For example, it models the probability of counts for each side of a k-sided dice rolled n times. For n independent trials each of which leads to a success for exactly one of k categories, with each category having a given fixed success probability, the multinomial distribution gives the probability of any particular combination of numbers of successes for the various categories.

When k is 2 and n is 1, the multinomial distribution is the Bernoulli distribution. When k is 2 and n is bigger than 1, it is the binomial distribution. When k is bigger than 2 and n is 1, it is the categorical distribution. The term "multinoulli" is sometimes used for the categorical distribution to emphasize this four-way relationship (so n determines the suffix, and k the prefix).

The Bernoulli distribution models the outcome of a single Bernoulli trial. In other words, it models whether flipping a (possibly biased) coin one time will result in either a success (obtaining a head) or failure (obtaining a tail). The binomial distribution generalizes this to the number of heads from performing n independent flips (Bernoulli trials) of the same coin. The multinomial distribution models the outcome of n experiments, where the outcome of each trial has a categorical distribution, such as rolling a k-sided die n times.

Let k be a fixed finite number. Mathematically, we have k possible mutually exclusive outcomes, with corresponding probabilities p1, ..., pk, and n independent trials. Since the k outcomes are mutually exclusive and one must occur we have pi ≥ 0 for i = 1, ..., k and $$\sum_{i=1}^k p_i = 1$$. Then if the random variables Xi indicate the number of times outcome number i is observed over the n trials, the vector X = (X1, ..., Xk) follows a multinomial distribution with parameters n and p, where p = (p1, ..., pk). While the trials are independent, their outcomes Xi are dependent because they must be summed to n.

Probability mass function
Suppose one does an experiment of extracting n balls of k different colors from a bag, replacing the extracted balls after each draw. Balls of the same color are equivalent. Denote the variable which is the number of extracted balls of color i (i = 1, ..., k) as Xi, and denote as pi the probability that a given extraction will be in color i. The probability mass function of this multinomial distribution is:

 * $$ \begin{align}

f(x_1,\ldots,x_k;n,p_1,\ldots,p_k) & {} = \Pr(X_1 = x_1 \text{ and } \dots \text{ and } X_k = x_k) \\ & {} = \begin{cases} { \displaystyle {n! \over x_1!\cdots x_k!}p_1^{x_1}\times\cdots\times p_k^{x_k}}, \quad & \text{when } \sum_{i=1}^k x_i=n \\ \\ 0 & \text{otherwise,} \end{cases} \end{align} $$

for non-negative integers x1, ..., xk.

The probability mass function can be expressed using the gamma function as:

 * $$f(x_1,\dots, x_{k}; p_1,\ldots, p_k) = \frac{\Gamma(\sum_i x_i + 1)}{\prod_i \Gamma(x_i+1)} \prod_{i=1}^k p_i^{x_i}.$$

This form shows its resemblance to the Dirichlet distribution, which is its conjugate prior.

Example
Suppose that in a three-way election for a large country, candidate A received 20% of the votes, candidate B received 30% of the votes, and candidate C received 50% of the votes. If six voters are selected randomly, what is the probability that there will be exactly one supporter for candidate A, two supporters for candidate B and three supporters for candidate C in the sample?

''Note: Since we’re assuming that the voting population is large, it is reasonable and permissible to think of the probabilities as unchanging once a voter is selected for the sample. Technically speaking this is sampling without replacement, so the correct distribution is the multivariate hypergeometric distribution, but the distributions converge as the population grows large in comparison to a fixed sample size .''

 * $$ \Pr(A=1,B=2,C=3) = \frac{6!}{1! 2! 3!}(0.2^1) (0.3^2) (0.5^3) = 0.135 $$

Normalization
The multinomial distribution is normalized according to:

 * $$\sum_{\sum_{j=1}^k x_j=n} f(x_1,...,x_k;n,p_1,...,p_k) = 1$$

where the sum is over all permutations of $$x_j$$such that $$ \sum_{j=1}^k x_j=n $$.

Expected value and variance
The expected number of times the outcome i was observed over n trials is

 * $$\operatorname{E}(X_i) = n p_i.\,$$

The covariance matrix is as follows. Each diagonal entry is the variance of a binomially distributed random variable, and is therefore

 * $$\operatorname{Var}(X_i)=np_i(1-p_i).\,$$

The off-diagonal entries are the covariances:

 * $$\operatorname{Cov}(X_i,X_j)=-np_i p_j\,$$

for i, j distinct.

All covariances are negative because for fixed n, an increase in one component of a multinomial vector requires a decrease in another component.

When these expressions are combined into a matrix with i, j element $$\operatorname{cov} (X_i,X_j),$$ the result is a k × k positive-semidefinite covariance matrix of rank k − 1. In the special case where k = n and where the pi are all equal, the covariance matrix is the centering matrix.

The entries of the corresponding correlation matrix are

 * $$\rho(X_i,X_i) = 1.$$

 * $$\rho(X_i,X_j) = \frac{\operatorname{Cov}(X_i,X_j)}{\sqrt{\operatorname{Var}(X_i)\operatorname{Var}(X_j)}} = \frac{-p_i p_j}{\sqrt{p_i(1-p_i) p_j(1-p_j)}} = -\sqrt{\frac{p_i  p_j}{(1-p_i)(1-p_j)}}.$$

Note that the number of trials n drops out of this expression.

Each of the k components separately has a binomial distribution with parameters n and pi, for the appropriate value of the subscript i.

The support of the multinomial distribution is the set

 * $$\{(n_1,\dots,n_k)\in \mathbb{N}^k \mid n_1+\cdots+n_k=n\}.\,$$

Its number of elements is

 * $${n+k-1 \choose k-1}.$$

Matrix notation
In matrix notation,
 * $$\operatorname{E}(\mathbf{X}) = n \mathbf{p},\,$$

and
 * $$\operatorname{Var}(\mathbf{X}) = n \lbrace \operatorname{diag}(\mathbf{p}) - \mathbf{p} \mathbf{p}^{\rm T} \rbrace ,\,$$

with $p^{T}$ = the row vector transpose of the column vector $p$.

As slices of generalized Pascal's triangle
Just like one can interpret the binomial distribution as (normalized) one-dimensional (1D) slices of Pascal's triangle, so too can one interpret the multinomial distribution as 2D (triangular) slices of Pascal's pyramid, or 3D/4D/+ (pyramid-shaped) slices of higher-dimensional analogs of Pascal's triangle. This reveals an interpretation of the range of the distribution: discretized equilateral "pyramids" in arbitrary dimension—i.e. a simplex with a grid.

As polynomial coefficients
Similarly, just like one can interpret the binomial distribution as the polynomial coefficients of $$(p + q)^n$$ when expanded, one can interpret the multinomial distribution as the coefficients of $$(p_1 + p_2 + p_3 + \cdots + p_k)^n$$ when expanded, noting that just the coefficients must sum up to 1.

Asymptotics
By Stirling's formula, at the limit of $$n, x_1, ..., x_k \to \infty$$, we have$$\ln \binom{n}{x_1, \cdots, x_k} + \sum_{i=1}^k x_i\ln p_i = -n D_{KL}(\hat p \| p) - \frac{k-1}{2} \ln(2\pi n) - \frac 12 \sum_{i=1}^k \ln(\hat p_i) + o(1)$$where relative frequencies $$\hat p_i = x_i/n$$ in the data can be interpreted as probabilities from the empirical distribution $$\hat p$$, and $$D_{KL}$$ is the Kullback–Leibler divergence.

This formula can be interpreted as follows.

Consider $$\Delta_k$$, the space of all possible distributions over the categories $$\{1, 2, ..., k\}$$. It is a simplex. After $$n$$ independent samples from the categorical distribution $$p$$ (which is how we construct the multinomial distribution), we obtain an empirical distribution $$\hat p$$.

By the asymptotic formula, the probability that empirical distribution $$\hat p$$ deviates from the actual distribution $$p$$ decays exponentially, at a rate $$ n D_{KL}(\hat p \| p)$$. The more experiments and the more different $$\hat p$$ is from $$p$$, the less likely it is to see such an empirical distribution.

If $$A$$ is a closed subset of $$\Delta_k$$, then by dividing up $$A$$ into pieces, and reasoning about the growth rate of $$Pr(\hat p \in A_\epsilon)$$ on each piece $$A_\epsilon$$, we obtain Sanov's theorem, which states that$$\lim_{n \to \infty} \frac 1n \ln Pr(\hat p \in A) = - \inf_{\hat p \in A} D_{KL}(\hat p \| p)$$

Concentration at large n
Due to the exponential decay, at large $$n$$, almost all the probability mass is concentrated in a small neighborhood of $$p$$. In this small neighborhood, we can take the first nonzero term in the Taylor expansion of $$D_{KL}$$, to obtain$$\ln \binom{n}{x_1, \cdots, x_k} p_1^{x_1} \cdots p_k^{x_k} \approx -\frac n2 \sum_{i=1}^k \frac{(\hat p_i - p_i)^2}{p_i} = -\frac 12 \sum_{i=1}^k \frac{(x_i - n p_i)^2}{n p_i}$$This resembles the gaussian distribution, which suggests the following theorem:

Theorem. At the $$n \to \infty$$ limit, $$n \sum_{i=1}^k \frac{(\hat p_i - p_i)^2}{p_i} = \sum_{i=1}^k \frac{(x_i - n p_i)^2}{n p_i}$$ converges in distribution to the chi-squared distribution $$\chi^2(k-1)$$.

The space of all distributions over categories $$\{1, 2, \ldots, k\}$$ is a simplex: $$\Delta_{k} = \left\{(y_1, \ldots, y_k)\colon y_1, \ldots, y_k \geq 0, \sum_i y_i = 1\right\}$$, and the set of all possible empirical distributions after $$n$$ experiments is a subset of the simplex: $$\Delta_{k, n} = \left\{(x_1/n, \ldots, x_k/n)\colon x_1, \ldots, x_k \in \N, \sum_i x_i = n\right\}$$. That is, it is the intersection between $$\Delta_k$$ and the lattice $$(\Z^k)/n$$.

As $$n$$ increases, most of the probability mass is concentrated in a subset of $$\Delta_{k, n}$$ near $$p$$, and the probability distribution near $$p$$ becomes well-approximated by $$\binom{n}{x_1, \cdots, x_k} p_1^{x_1} \cdots p_k^{x_k} \approx e^{-\frac n2 \sum_i \frac{(\hat p_i - p_i)^2}{p_i}}$$From this, we see that the subset upon which the mass is concentrated has radius on the order of $$1/\sqrt n$$, but the points in the subset are separated by distance on the order of $$1/n$$, so at large $$n$$, the points merge into a continuum. To convert this from a discrete probability distribution to a continuous probability density, we need to multiply by the volume occupied by each point of $$\Delta_{k, n}$$ in $$\Delta_k$$. However, by symmetry, every point occupies exactly the same volume (except a negligible set on the boundary), so we obtain a probability density $$\rho(\hat p) = C e^{-\frac n2 \sum_i \frac{(\hat p_i - p_i)^2}{p_i}}$$, where $$C$$ is a constant.

Finally, since the simplex $$\Delta_k$$ is not all of $$\R^k$$, but only within a $$(k-1)$$-dimensional plane, we obtain the desired result.

Conditional concentration at large n
The above concentration phenomenon can be easily generalized to the case where we condition upon linear constraints. This is the theoretical justification for Pearson's chi-squared test.

Theorem. Given frequencies $$x_i\in\mathbb N$$ observed in a dataset with $$n$$ points, we impose $$\ell + 1$$ independent linear constraints $$\begin{cases} \sum_i \hat p_i = 1, \\ \sum_i a_{1i} \hat p_i = b_1, \\ \sum_i a_{2i} \hat p_i = b_2, \\ \cdots, \\ \sum_i a_{\ell i} \hat p_i = b_{\ell} \end{cases} $$(notice that the first constraint is simply the requirement that the empirical distributions sum to one), such that empirical $$\hat p_i=x_i/n$$ satisfy all these constraints simultaneously. Let $$q$$ denote the $$I$$-projection of prior distribution $$p$$ on the sub-region of the simplex allowed by the linear constraints. At the $$n \to \infty$$ limit, sampled counts $$n \hat p_i$$ from the multinomial distribution conditional on the linear constraints are governed by $$2n D_{KL}(\hat p \vert\vert q) \approx n \sum_i \frac{(\hat p_i - q_i)^2}{q_i}$$ which converges in distribution to the chi-squared distribution $$\chi^2(k-1-\ell)$$.

An analogous proof applies in this Diophantine problem of coupled linear equations in count variables $$n \hat p_i$$, but this time $$\Delta_{k, n}$$ is the intersection of $$(\Z^k)/n$$ with $$\Delta_k $$ and $$\ell $$ hyperplanes, all linearly independent, so the probability density $$\rho(\hat p)$$ is restricted to a $$(k-\ell-1)$$-dimensional plane. In particular, expanding the KL divergence $$D_{KL}(\hat p\vert\vert p)$$ around its minimum $$q$$ (the $$I$$-projection of $$p$$ on $$\Delta_{k, n}$$) in the constrained problem ensures by the Pythagorean theorem for $$I$$-divergence that any constant and linear term in the counts $$n \hat p_i$$ vanishes from the conditional probability to multinationally sample those counts.

Notice that by definition, every one of $$\hat p_1, \hat p_2, ..., \hat p_k$$ must be a rational number, whereas $$p_1, p_2, ..., p_k$$ may be chosen from any real number in $$[0, 1]$$ and need not satisfy the Diophantine system of equations. Only asymptotically as $$n\rightarrow\infty$$, the $$\hat p_i$$'s can be regarded as probabilities over $$[0, 1]$$.

Away from empirically observed constraints $$b_1,\ldots,b_\ell$$ (such as moments or prevalences) the theorem can be generalized:

Theorem.

 * Given functions $$f_1, ..., f_\ell$$, such that they are continuously differentiable in a neighborhood of $$p$$, and the vectors $$(1, 1, ..., 1), \nabla f_1(p), ..., \nabla f_\ell(p)$$ are linearly independent;
 * given sequences $$\epsilon_1(n), ..., \epsilon_\ell(n)$$, such that asymptotically $$\frac 1n \ll \epsilon_i(n) \ll \frac{1}{\sqrt n}$$ for each $$i \in \{1, ..., \ell\}$$;
 * then for the multinomial distribution conditional on constraints $$f_1(\hat p) \in [f_1(p)- \epsilon_1(n), f_1(p) + \epsilon_1(n)], ..., f_\ell(\hat p) \in [f_\ell(p)- \epsilon_\ell(n), f_\ell(p) + \epsilon_\ell(n)]$$, we have the quantity $$n \sum_i \frac{(\hat p_i - p_i)^2}{p_i} = \sum_i \frac{(x_i - n p_i)^2}{n p_i}$$ converging in distribution to $$\chi^2(k-1-\ell)$$ at the $$n \to \infty$$ limit.

In the case that all $$\hat p_i$$ are equal, the Theorem reduces to the concentration of entropies around the Maximum Entropy.

Related distributions
In some fields such as natural language processing, categorical and multinomial distributions are synonymous and it is common to speak of a multinomial distribution when a categorical distribution is actually meant. This stems from the fact that it is sometimes convenient to express the outcome of a categorical distribution as a "1-of-k" vector (a vector with one element containing a 1 and all other elements containing a 0) rather than as an integer in the range $$1 \dots k$$; in this form, a categorical distribution is equivalent to a multinomial distribution over a single trial.

 * When k = 2, the multinomial distribution is the binomial distribution.
 * Categorical distribution, the distribution of each trial; for k = 2, this is the Bernoulli distribution.
 * The Dirichlet distribution is the conjugate prior of the multinomial in Bayesian statistics.
 * Dirichlet-multinomial distribution.
 * Beta-binomial distribution.
 * Negative multinomial distribution
 * Hardy–Weinberg principle ( a trinomial distribution with probabilities $$(\theta^2, 2 \theta (1-\theta), (1-\theta)^2) $$)

Equivalence tests for multinomial distributions
The goal of equivalence testing is to establish the agreement between a theoretical multinomial distribution and observed counting frequencies. The theoretical distribution may be a fully specified multinomial distribution or a parametric family of multinomial distributions.

Let $$q$$ denote a theoretical multinomial distribution and let $$p$$ be a true underlying distribution. The distributions $$p$$ and $$q$$ are considered equivalent if $$d(p,q)<\varepsilon$$ for a distance $$d$$ and a tolerance parameter $$\varepsilon>0$$. The equivalence test problem is $$H_0=\{d(p,q)\geq\varepsilon\}$$ versus $$H_1=\{d(p,q)<\varepsilon\}$$. The true underlying distribution $$p$$ is unknown. Instead, the counting frequencies $$p_n$$ are observed, where $$n$$ is a sample size. An equivalence test uses $$p_n$$ to reject $$H_0$$. If $$H_0$$ can be rejected then the equivalence between $$p$$ and $$q$$ is shown at a given significance level. The equivalence test for Euclidean distance can be found in text book of Wellek (2010). The equivalence test for the total variation distance is developed in Ostrovski (2017). The exact equivalence test for the specific cumulative distance is proposed in Frey (2009).

The distance between the true underlying distribution $$p$$ and a family of the multinomial distributions $$\mathcal{M}$$ is defined by $$d(p, \mathcal{M})=\min_{h\in\mathcal{M}}d(p,h) $$. Then the equivalence test problem is given by $$H_0=\{d(p,\mathcal{M})\geq \varepsilon\}$$ and $$H_1=\{d(p,\mathcal{M})< \varepsilon\}$$. The distance $$d(p,\mathcal{M})$$ is usually computed using numerical optimization. The tests for this case are developed recently in Ostrovski (2018).

Confidence intervals for the difference of two proportions
In the setting of a multinomial distribution, constructing confidence intervals for the difference between the proportions of observations from two events, $$p_i-p_j$$, requires the incorporation of the negative covariance between the sample estimators $$\hat{p}_i = \frac{X_i}{n} $$ and $$\hat{p}_j  = \frac{X_j}{n}$$.

Some of the literature on the subject focused on the use-case of matched-pairs binary data, which requires careful attention when translating the formulas to the general case of $$p_i-p_j$$ for any multinomial distribution. Formulas in the current section will be generalized, while formulas in the next section will focus on the matched-pairs binary data use-case.

Wald's standard error (SE) of the difference of proportion can be estimated using:

$$ \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)} = \sqrt{\frac{(\hat{p}_i + \hat{p}_j) - (\hat{p}_i - \hat{p}_j)^2}{n}} $$

For a $$100(1 - \alpha)\%$$ approximate confidence interval, the margin of error may incorporate the appropriate quantile from the standard normal distribution, as follows:

$$(\hat{p}_i - \hat{p}_j) \pm z_{\alpha/2} \cdot \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}$$

As the sample size ($$n$$) increases, the sample proportions will approximately follow a multivariate normal distribution, thanks to the multidimensional central limit theorem (and it could also be shown using the Cramér–Wold theorem). Therefore, their difference will also be approximately normal. Also, these estimators are weakly consistent and plugging them into the SE estimator makes it also weakly consistent. Hence, thanks to Slutsky's theorem, the pivotal quantity $$\frac{(\hat{p}_i - \hat{p}_j) - (p_i - p_j)}{\widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}}$$  approximately follows the standard normal distribution. And from that, the above approximate confidence interval is directly derived.

The SE can be constructed using the calculus of the variance of the difference of two random variables: $$ \begin{align} \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)} & = \sqrt{\frac{\hat{p}_i (1 - \hat{p}_i)}{n} + \frac{\hat{p}_j (1 - \hat{p}_j)}{n} - 2\left(-\frac{\hat{p}_i \hat{p}_j}{n}\right)} \\ & = \sqrt{\frac{1}{n} \left(\hat{p}_i + \hat{p}_j - \hat{p}_i^2 - \hat{p}_j^2 + 2\hat{p}_i \hat{p}_j\right)} \\ & = \sqrt{\frac{(\hat{p}_i + \hat{p}_j) - (\hat{p}_i - \hat{p}_j)^2}{n}} \end{align} $$

A modification which includes a continuity correction adds $$\frac{1}{n}$$ to the margin of error as follows:

$$(\hat{p}_i - \hat{p}_j) \pm \left(z_{\alpha/2} \cdot \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)} + \frac{1}{n}\right)$$

Another alternative is to rely on a Bayesian estimator using Jeffreys prior which leads to using a dirichlet distribution, with all parameters being equal to 0.5, as a prior. The posterior will be the calculations from above, but after adding 1/2 to each of the k elements, leading to an overall increase of the sample size by $$\frac{k}{2}$$. This was originally developed for a multinomial distribution with four events, and is known as wald+2, for analyzing matched pairs data (see the next section for more details).

This leads to the following SE:

$$ \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}_{wald+\frac{k}{2}} = \sqrt{\frac{\left(\hat{p}_i + \hat{p}_j + \frac{1}{n}\right)\frac{n}{n+\frac{k}{2}} - \left(\hat{p}_i - \hat{p}_j\right)^2 \left(\frac{n}{n+\frac{k}{2}}\right)^2 }{n+\frac{k}{2}}}

$$

$$ \begin{align} \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}_{wald+\frac{k}{2}} & = \sqrt{\frac{\left(\frac{x_i+1/2}{n+\frac{k}{2}} + \frac{x_j+1/2}{n+\frac{k}{2}}\right) - \left(\frac{x_i+1/2}{n+\frac{k}{2}} - \frac{x_j+1/2}{n+\frac{k}{2}}\right)^2}{n+\frac{k}{2}}} \\ & = \sqrt{\frac{\left(\frac{x_i}{n} + \frac{x_j}{n} + \frac{1}{n}\right)\frac{n}{n+\frac{k}{2}} - \left(\frac{x_i}{n} - \frac{x_j}{n}\right)^2 \left(\frac{n}{n+\frac{k}{2}}\right)^2 }{n+\frac{k}{2}}} \\ & = \sqrt{\frac{\left(\hat{p}_i + \hat{p}_j + \frac{1}{n}\right)\frac{n}{n+\frac{k}{2}} - \left(\hat{p}_i - \hat{p}_j\right)^2 \left(\frac{n}{n+\frac{k}{2}}\right)^2 }{n+\frac{k}{2}}} \end{align} $$

Which can just be plugged into the original Wald formula as follows:

$$(p_i - p_j)\frac{n}{n+\frac{k}{2}} \pm z_{\alpha/2} \cdot \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}_{wald+\frac{k}{2}}$$

Confidence intervals for the difference in matched-pairs binary data (using multinomial with k=4)
For the case of matched-pairs binary data, a common task is to build the confidence interval of the difference of the proportion of the matched events. For example, we might have a test for some disease, and we may want to check the results of it for some population at two points in time (1 and 2), to check if there was a change in the proportion of the positives for the disease during that time.

Such scenarios can be represented using a two-by-two contingency table with the number of elements that had each of the combination of events. We can use small f for sampling frequencies: $$f_{11}, f_{10}, f_{01}, f_{00}$$, and capital F for population frequencies: $$F_{11}, F_{10}, F_{01}, F_{00}$$. These four combinations could be modeled as coming from a multinomial distribution (with four potential outcomes). The sizes of the sample and population can be n and N respectively. And in such a case, there is an interest in building a confidence interval for the difference of proportions from the marginals of the following (sampled) contingency table:

In this case, checking the difference in marginal proportions means we are interested in using the following definitions: $$p_{1*} = \frac{F_{1*}}{N} = \frac{F_{11} + F_{10}}{N}$$, $$p_{*1} = \frac{F_{*1}}{N} = \frac{F_{11} + F_{01}}{N}$$. And the difference we want to build confidence intervals for is:

$$p_{*1} - p_{1*} = \frac{F_{11} + F_{01}}{N} - \frac{F_{11} + F_{10}}{N} = \frac{F_{01}}{N} - \frac{F_{10}}{N} = p_{01} - p_{10}$$

Hence, a confidence intervals for the marginal positive proportions ($$p_{*1} - p_{1*}$$) is the same as building a confidence interval for the difference of the proportions from the secondary diagonal of the two-by-two contingency table ($$p_{01} - p_{10}$$).

Calculating a p-value for such a difference is known as McNemar's test. Building confidence interval around it can be constructed using methods described above for Confidence intervals for the difference of two proportions.

The Wald confidence intervals from the previous section can be applied to this setting, and appears in the literature using alternative notations. Specifically, the SE often presented is based on the contingency table frequencies instead of the sample proportions. For example, the Wald confidence intervals, provided above, can be written as:

$$ \widehat{\operatorname{SE}(p_{*1} - p_{1*})} = \widehat{\operatorname{SE}(p_{01} - p_{10})} = \frac{\sqrt{n(f_{10} + f_{01}) - (f_{10} - f_{01})^2}}{n\sqrt{n}} $$

Further research in the literature has identified several shortcomings in both the Wald and the Wald with continuity correction methods, and other methods have been proposed for practical application.

One such modification includes Agresti and Min’s Wald+2 (similar to some of their other works ) in which each cell frequency had an extra $$\frac{1}{2}$$ added to it. This leads to the Wald+2 confidence intervals. In a Bayesian interpretation, this is like building the estimators taking as prior a dirichlet distribution with all parameters being equal to 0.5 (which is, in fact, the Jeffreys prior). The +2 in the name wald+2 can now be taken to mean that in the context of a two-by-two contingency table, which is a multinomial distribution with four possible events, then since we add 1/2 an observation to each of them, then this translates to an overall addition of 2 observations (due to the prior).

This leads to the following modified SE for the case of matched pairs data:

$$ \widehat{\operatorname{SE}(p_{*1} - p_{1*})} = \frac{\sqrt{(n+2)(f_{10} + f_{01} + 1) - (f_{10} - f_{01})^2}}{(n+2)\sqrt{(n+2)}} $$

Which can just be plugged into the original Wald formula as follows:

$$(p_{*1} - p_{1*})\frac{n}{n+2} \pm z_{\alpha/2} \cdot \widehat{\operatorname{SE}(\hat{p}_i - \hat{p}_j)}_{wald+2}$$

Other modifications include Bonett and Price’s Adjusted Wald, and Newcombe’s Score.

Random variate generation
First, reorder the parameters $$p_1, \ldots, p_k$$ such that they are sorted in descending order (this is only to speed up computation and not strictly necessary). Now, for each trial, draw an auxiliary variable X from a uniform (0, 1) distribution. The resulting outcome is the component

 * $$j = \min \left\{ j' \in \{1,\dots,k\}\colon \left(\sum_{i=1}^{j'} p_i\right) - X \geq 0 \right\}.$$

{Xj = 1, Xk = 0 for k ≠ j } is one observation from the multinomial distribution with $$p_1, \ldots, p_k$$ and n = 1. A sum of independent repetitions of this experiment is an observation from a multinomial distribution with n equal to the number of such repetitions.

Sampling using repeated conditional binomial samples
Given the parameters $$p_1, p_2, \ldots, p_k$$ and a total for the sample $$n$$ such that $$\sum_{i=1}^k X_i = n $$, it is possible to sample sequentially for the number in an arbitrary state $$X_i $$, by partitioning the state space into $$i $$ and not-$$i $$, conditioned on any prior samples already taken, repeatedly.

Algorithm: Sequential conditional binomial sampling
Heuristically, each application of the binomial sample reduces the available number to sample from and the conditional probabilities are likewise updated to ensure logical consistency.

Software implementations

 * The MultinomialCI R package allows the computation of simultaneous confidence intervals for the probabilities of a multinomial distribution given a set of observations.

title: Multinomial distribution


text:
Blue Boy (disambiguation)

Blue Boy, Blueboy, Blues Boy or Blue Boys may refer to:

 * The Blue Boy, a c. 1770 painting by Thomas Gainsborough
 * The Blue Boy, an 1876 watercolor by Winslow Homer
 * Blue Boy (novel), a 1932 novel by Jean Giono
 * The Blue Boy (picture book), a 1992 children's book by Martin Auer
 * Blueboy (plant), or Stirlingia, a plant genus
 * Blue Boy, a rosemary cultivar
 * Blueboy (magazine), a 1974–2007 gay pornographic magazine
 * Blue Boys F.C., Namibian football club
 * The Blue Boy, a 1926 American film directed by Arthur Maude
 * The Blue Boy (film), a 1994 British film directed by Paul Murton

Music

 * The Blue Boys, a 1920s American ragtime band of Prater & Hayes
 * The Blueboys, a 1960s predecessor of American band The Blue Things
 * Blue Boys, a backing group for Jim Reeves
 * "Blue Boy" (song), a 1958 single by Jim Reeves
 * Blue Boys (Danish band), a 1960s vocal quartet
 * Blueboy (band), a 1990s English indie pop band
 * Blue Boy (DJ), Scottish DJ Lex Blackmore
 * Blueboy or Superblue, stage name of Trinidadian musician Austin Lyons (born 1956)
 * Blue Boys, a record label for Crash Test 02, Club Test 02, Bloom 06 and other albums
 * Blue Boy (album), a 2001 album by Ron Sexsmith
 * "Blue Boy", a 1970 song by Joni Mitchell from the album Ladies of the Canyon
 * "Blue Boy", a 1980 single by Orange Juice
 * "Blueboy", a 1997 song by John Fogerty from the album Blue Moon Swamp
 * "Blue Boy", a 2014 song by Mac DeMarco from the album Salad Days

title: Blue Boy (disambiguation)