--- /dev/null
+%%\r
+%% IEEEtran.bst\r
+%% BibTeX Bibliography Style file for IEEE Journals and Conferences (unsorted)\r
+%% Version 1.12 (2007/01/11)\r
+%% \r
+%% Copyright (c) 2003-2007 Michael Shell\r
+%% \r
+%% Original starting code base and algorithms obtained from the output of\r
+%% Patrick W. Daly's makebst package as well as from prior versions of\r
+%% IEEE BibTeX styles:\r
+%% \r
+%% 1. Howard Trickey and Oren Patashnik's ieeetr.bst (1985/1988)\r
+%% 2. Silvano Balemi and Richard H. Roy's IEEEbib.bst (1993)\r
+%% \r
+%% Support sites:\r
+%% http://www.michaelshell.org/tex/ieeetran/\r
+%% http://www.ctan.org/tex-archive/macros/latex/contrib/IEEEtran/\r
+%% and/or\r
+%% http://www.ieee.org/\r
+%% \r
+%% For use with BibTeX version 0.99a or later\r
+%%\r
+%% This is a numerical citation style.\r
+%% \r
+%%*************************************************************************\r
+%% Legal Notice:\r
+%% This code is offered as-is without any warranty either expressed or\r
+%% implied; without even the implied warranty of MERCHANTABILITY or\r
+%% FITNESS FOR A PARTICULAR PURPOSE! \r
+%% User assumes all risk.\r
+%% In no event shall IEEE or any contributor to this code be liable for\r
+%% any damages or losses, including, but not limited to, incidental,\r
+%% consequential, or any other damages, resulting from the use or misuse\r
+%% of any information contained here.\r
+%%\r
+%% All comments are the opinions of their respective authors and are not\r
+%% necessarily endorsed by the IEEE.\r
+%%\r
+%% This work is distributed under the LaTeX Project Public License (LPPL)\r
+%% ( http://www.latex-project.org/ ) version 1.3, and may be freely used,\r
+%% distributed and modified. A copy of the LPPL, version 1.3, is included\r
+%% in the base LaTeX documentation of all distributions of LaTeX released\r
+%% 2003/12/01 or later.\r
+%% Retain all contribution notices and credits.\r
+%% ** Modified files should be clearly indicated as such, including **\r
+%% ** renaming them and changing author support contact information. **\r
+%%\r
+%% File list of work: IEEEabrv.bib, IEEEfull.bib, IEEEexample.bib,\r
+%% IEEEtran.bst, IEEEtranS.bst, IEEEtranSA.bst,\r
+%% IEEEtranN.bst, IEEEtranSN.bst, IEEEtran_bst_HOWTO.pdf\r
+%%*************************************************************************\r
+%\r
+%\r
+% Changelog:\r
+%\r
+% 1.00 (2002/08/13) Initial release\r
+%\r
+% 1.10 (2002/09/27)\r
+% 1. Corrected minor bug for improperly formed warning message when a\r
+% book was not given a title. Thanks to Ming Kin Lai for reporting this.\r
+% 2. Added support for CTLname_format_string and CTLname_latex_cmd fields\r
+% in the BST control entry type.\r
+%\r
+% 1.11 (2003/04/02)\r
+% 1. Fixed bug with URLs containing underscores when using url.sty. Thanks\r
+% to Ming Kin Lai for reporting this.\r
+%\r
+% 1.12 (2007/01/11)\r
+% 1. Fixed bug with unwanted comma before "et al." when an entry contained\r
+% more than two author names. Thanks to Pallav Gupta for reporting this.\r
+% 2. Fixed bug with anomalous closing quote in tech reports that have a\r
+% type, but without a number or address. Thanks to Mehrdad Mirreza for\r
+% reporting this.\r
+% 3. Use braces in \providecommand in begin.bib to better support\r
+% latex2html. TeX style length assignments OK with recent versions\r
+% of latex2html - 1.71 (2002/2/1) or later is strongly recommended.\r
+% Use of the language field still causes trouble with latex2html.\r
+% Thanks to Federico Beffa for reporting this.\r
+% 4. Added IEEEtran.bst ID and version comment string to .bbl output.\r
+% 5. Provide a \BIBdecl hook that allows the user to execute commands\r
+% just prior to the first entry.\r
+% 6. Use default urlstyle (is using url.sty) of "same" rather than rm to\r
+% better work with a wider variety of bibliography styles.\r
+% 7. Changed month abbreviations from Sept., July and June to Sep., Jul.,\r
+% and Jun., respectively, as IEEE now does. Thanks to Moritz Borgmann\r
+% for reporting this.\r
+% 8. Control entry types should not be considered when calculating longest\r
+% label width.\r
+% 9. Added alias www for electronic/online.\r
+% 10. Added CTLname_url_prefix control entry type.\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% DEFAULTS FOR THE CONTROLS OF THE BST STYLE %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+% These are the defaults for the user adjustable controls. The values used\r
+% here can be overridden by the user via IEEEtranBSTCTL entry type.\r
+\r
+% NOTE: The recommended LaTeX command to invoke a control entry type is:\r
+% \r
+%\makeatletter\r
+%\def\bstctlcite{\@ifnextchar[{\@bstctlcite}{\@bstctlcite[@auxout]}}\r
+%\def\@bstctlcite[#1]#2{\@bsphack\r
+% \@for\@citeb:=#2\do{%\r
+% \edef\@citeb{\expandafter\@firstofone\@citeb}%\r
+% \if@filesw\immediate\write\csname #1\endcsname{\string\citation{\@citeb}}\fi}%\r
+% \@esphack}\r
+%\makeatother\r
+%\r
+% It is called at the start of the document, before the first \cite, like:\r
+% \bstctlcite{IEEEexample:BSTcontrol}\r
+%\r
+% IEEEtran.cls V1.6 and later does provide this command.\r
+\r
+\r
+\r
+% #0 turns off the display of the number for articles.\r
+% #1 enables\r
+FUNCTION {default.is.use.number.for.article} { #1 }\r
+\r
+\r
+% #0 turns off the display of the paper and type fields in @inproceedings.\r
+% #1 enables\r
+FUNCTION {default.is.use.paper} { #1 }\r
+\r
+\r
+% #0 turns off the forced use of "et al."\r
+% #1 enables\r
+FUNCTION {default.is.forced.et.al} { #0 }\r
+\r
+% The maximum number of names that can be present beyond which an "et al."\r
+% usage is forced. Be sure that num.names.shown.with.forced.et.al (below)\r
+% is not greater than this value!\r
+% Note: There are many instances of references in IEEE journals which have\r
+% a very large number of authors as well as instances in which "et al." is\r
+% used profusely.\r
+FUNCTION {default.max.num.names.before.forced.et.al} { #10 }\r
+\r
+% The number of names that will be shown with a forced "et al.".\r
+% Must be less than or equal to max.num.names.before.forced.et.al\r
+FUNCTION {default.num.names.shown.with.forced.et.al} { #1 }\r
+\r
+\r
+% #0 turns off the alternate interword spacing for entries with URLs.\r
+% #1 enables\r
+FUNCTION {default.is.use.alt.interword.spacing} { #1 }\r
+\r
+% If alternate interword spacing for entries with URLs is enabled, this is\r
+% the interword spacing stretch factor that will be used. For example, the\r
+% default "4" here means that the interword spacing in entries with URLs can\r
+% stretch to four times normal. Does not have to be an integer. Note that\r
+% the value specified here can be overridden by the user in their LaTeX\r
+% code via a command such as: \r
+% "\providecommand\BIBentryALTinterwordstretchfactor{1.5}" in addition to\r
+% that via the IEEEtranBSTCTL entry type.\r
+FUNCTION {default.ALTinterwordstretchfactor} { "4" }\r
+\r
+\r
+% #0 turns off the "dashification" of repeated (i.e., identical to those\r
+% of the previous entry) names. IEEE normally does this.\r
+% #1 enables\r
+FUNCTION {default.is.dash.repeated.names} { #1 }\r
+\r
+\r
+% The default name format control string.\r
+FUNCTION {default.name.format.string}{ "{f.~}{vv~}{ll}{, jj}" }\r
+\r
+\r
+% The default LaTeX font command for the names.\r
+FUNCTION {default.name.latex.cmd}{ "" }\r
+\r
+\r
+% The default URL prefix.\r
+FUNCTION {default.name.url.prefix}{ "[Online]. Available:" }\r
+\r
+\r
+% Other controls that cannot be accessed via IEEEtranBSTCTL entry type.\r
+\r
+% #0 turns off the terminal startup banner/completed message so as to\r
+% operate more quietly.\r
+% #1 enables\r
+FUNCTION {is.print.banners.to.terminal} { #1 }\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% FILE VERSION AND BANNER %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+FUNCTION{bst.file.version} { "1.12" }\r
+FUNCTION{bst.file.date} { "2007/01/11" }\r
+FUNCTION{bst.file.website} { "http://www.michaelshell.org/tex/ieeetran/bibtex/" }\r
+\r
+FUNCTION {banner.message}\r
+{ is.print.banners.to.terminal\r
+ { "-- IEEEtran.bst version" " " * bst.file.version *\r
+ " (" * bst.file.date * ") " * "by Michael Shell." *\r
+ top$\r
+ "-- " bst.file.website *\r
+ top$\r
+ "-- See the " quote$ * "IEEEtran_bst_HOWTO.pdf" * quote$ * " manual for usage information." *\r
+ top$\r
+ }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+FUNCTION {completed.message}\r
+{ is.print.banners.to.terminal\r
+ { ""\r
+ top$\r
+ "Done."\r
+ top$\r
+ }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%\r
+%% STRING CONSTANTS %%\r
+%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+FUNCTION {bbl.and}{ "and" }\r
+FUNCTION {bbl.etal}{ "et~al." }\r
+FUNCTION {bbl.editors}{ "eds." }\r
+FUNCTION {bbl.editor}{ "ed." }\r
+FUNCTION {bbl.edition}{ "ed." }\r
+FUNCTION {bbl.volume}{ "vol." }\r
+FUNCTION {bbl.of}{ "of" }\r
+FUNCTION {bbl.number}{ "no." }\r
+FUNCTION {bbl.in}{ "in" }\r
+FUNCTION {bbl.pages}{ "pp." }\r
+FUNCTION {bbl.page}{ "p." }\r
+FUNCTION {bbl.chapter}{ "ch." }\r
+FUNCTION {bbl.paper}{ "paper" }\r
+FUNCTION {bbl.part}{ "pt." }\r
+FUNCTION {bbl.patent}{ "Patent" }\r
+FUNCTION {bbl.patentUS}{ "U.S." }\r
+FUNCTION {bbl.revision}{ "Rev." }\r
+FUNCTION {bbl.series}{ "ser." }\r
+FUNCTION {bbl.standard}{ "Std." }\r
+FUNCTION {bbl.techrep}{ "Tech. Rep." }\r
+FUNCTION {bbl.mthesis}{ "Master's thesis" }\r
+FUNCTION {bbl.phdthesis}{ "Ph.D. dissertation" }\r
+FUNCTION {bbl.st}{ "st" }\r
+FUNCTION {bbl.nd}{ "nd" }\r
+FUNCTION {bbl.rd}{ "rd" }\r
+FUNCTION {bbl.th}{ "th" }\r
+\r
+\r
+% This is the LaTeX spacer that is used when a larger than normal space\r
+% is called for (such as just before the address:publisher).\r
+FUNCTION {large.space} { "\hskip 1em plus 0.5em minus 0.4em\relax " }\r
+\r
+% The LaTeX code for dashes that are used to represent repeated names.\r
+% Note: Some older IEEE journals used something like\r
+% "\rule{0.275in}{0.5pt}\," which is fairly thick and runs right along\r
+% the baseline. However, IEEE now uses a thinner, above baseline,\r
+% six dash long sequence.\r
+FUNCTION {repeated.name.dashes} { "------" }\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% PREDEFINED STRING MACROS %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+MACRO {jan} {"Jan."}\r
+MACRO {feb} {"Feb."}\r
+MACRO {mar} {"Mar."}\r
+MACRO {apr} {"Apr."}\r
+MACRO {may} {"May"}\r
+MACRO {jun} {"Jun."}\r
+MACRO {jul} {"Jul."}\r
+MACRO {aug} {"Aug."}\r
+MACRO {sep} {"Sep."}\r
+MACRO {oct} {"Oct."}\r
+MACRO {nov} {"Nov."}\r
+MACRO {dec} {"Dec."}\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%\r
+%% ENTRY FIELDS %%\r
+%%%%%%%%%%%%%%%%%%\r
+\r
+ENTRY\r
+ { address\r
+ assignee\r
+ author\r
+ booktitle\r
+ chapter\r
+ day\r
+ dayfiled\r
+ edition\r
+ editor\r
+ howpublished\r
+ institution\r
+ intype\r
+ journal\r
+ key\r
+ language\r
+ month\r
+ monthfiled\r
+ nationality\r
+ note\r
+ number\r
+ organization\r
+ pages\r
+ paper\r
+ publisher\r
+ school\r
+ series\r
+ revision\r
+ title\r
+ type\r
+ url\r
+ volume\r
+ year\r
+ yearfiled\r
+ CTLuse_article_number\r
+ CTLuse_paper\r
+ CTLuse_forced_etal\r
+ CTLmax_names_forced_etal\r
+ CTLnames_show_etal\r
+ CTLuse_alt_spacing\r
+ CTLalt_stretch_factor\r
+ CTLdash_repeated_names\r
+ CTLname_format_string\r
+ CTLname_latex_cmd\r
+ CTLname_url_prefix\r
+ }\r
+ {}\r
+ { label }\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%\r
+%% INTEGER VARIABLES %%\r
+%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+INTEGERS { prev.status.punct this.status.punct punct.std\r
+ punct.no punct.comma punct.period \r
+ prev.status.space this.status.space space.std\r
+ space.no space.normal space.large\r
+ prev.status.quote this.status.quote quote.std\r
+ quote.no quote.close\r
+ prev.status.nline this.status.nline nline.std\r
+ nline.no nline.newblock \r
+ status.cap cap.std\r
+ cap.no cap.yes}\r
+\r
+INTEGERS { longest.label.width multiresult nameptr namesleft number.label numnames }\r
+\r
+INTEGERS { is.use.number.for.article\r
+ is.use.paper\r
+ is.forced.et.al\r
+ max.num.names.before.forced.et.al\r
+ num.names.shown.with.forced.et.al\r
+ is.use.alt.interword.spacing\r
+ is.dash.repeated.names}\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%\r
+%% STRING VARIABLES %%\r
+%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+STRINGS { bibinfo\r
+ longest.label\r
+ oldname\r
+ s\r
+ t\r
+ ALTinterwordstretchfactor\r
+ name.format.string\r
+ name.latex.cmd\r
+ name.url.prefix}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% LOW LEVEL FUNCTIONS %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+FUNCTION {initialize.controls}\r
+{ default.is.use.number.for.article 'is.use.number.for.article :=\r
+ default.is.use.paper 'is.use.paper :=\r
+ default.is.forced.et.al 'is.forced.et.al :=\r
+ default.max.num.names.before.forced.et.al 'max.num.names.before.forced.et.al :=\r
+ default.num.names.shown.with.forced.et.al 'num.names.shown.with.forced.et.al :=\r
+ default.is.use.alt.interword.spacing 'is.use.alt.interword.spacing :=\r
+ default.is.dash.repeated.names 'is.dash.repeated.names :=\r
+ default.ALTinterwordstretchfactor 'ALTinterwordstretchfactor :=\r
+ default.name.format.string 'name.format.string :=\r
+ default.name.latex.cmd 'name.latex.cmd :=\r
+ default.name.url.prefix 'name.url.prefix :=\r
+}\r
+\r
+\r
+% This IEEEtran.bst features a very powerful and flexible mechanism for\r
+% controlling the capitalization, punctuation, spacing, quotation, and\r
+% newlines of the formatted entry fields. (Note: IEEEtran.bst does not need\r
+% or use the newline/newblock feature, but it has been implemented for\r
+% possible future use.) The output states of IEEEtran.bst consist of\r
+% multiple independent attributes and, as such, can be thought of as being\r
+% vectors, rather than the simple scalar values ("before.all", \r
+% "mid.sentence", etc.) used in most other .bst files.\r
+% \r
+% The more flexible and complex design used here was motivated in part by\r
+% IEEE's rather unusual bibliography style. For example, IEEE ends the\r
+% previous field item with a period and large space prior to the publisher\r
+% address; the @electronic entry types use periods as inter-item punctuation\r
+% rather than the commas used by the other entry types; and URLs are never\r
+% followed by periods even though they are the last item in the entry.\r
+% Although it is possible to accommodate these features with the conventional\r
+% output state system, the seemingly endless exceptions make for convoluted,\r
+% unreliable and difficult to maintain code.\r
+%\r
+% IEEEtran.bst's output state system can be easily understood via a simple\r
+% illustration of two most recently formatted entry fields (on the stack):\r
+%\r
+% CURRENT_ITEM\r
+% "PREVIOUS_ITEM\r
+%\r
+% which, in this example, is to eventually appear in the bibliography as:\r
+% \r
+% "PREVIOUS_ITEM," CURRENT_ITEM\r
+%\r
+% It is the job of the output routine to take the previous item off of the\r
+% stack (while leaving the current item at the top of the stack), apply its\r
+% trailing punctuation (including closing quote marks) and spacing, and then\r
+% to write the result to BibTeX's output buffer:\r
+% \r
+% "PREVIOUS_ITEM," \r
+% \r
+% Punctuation (and spacing) between items is often determined by both of the\r
+% items rather than just the first one. The presence of quotation marks\r
+% further complicates the situation because, in standard English, trailing\r
+% punctuation marks are supposed to be contained within the quotes.\r
+% \r
+% IEEEtran.bst maintains two output state (aka "status") vectors which\r
+% correspond to the previous and current (aka "this") items. Each vector\r
+% consists of several independent attributes which track punctuation,\r
+% spacing, quotation, and newlines. Capitalization status is handled by a\r
+% separate scalar because the format routines, not the output routine,\r
+% handle capitalization and, therefore, there is no need to maintain the\r
+% capitalization attribute for both the "previous" and "this" items.\r
+% \r
+% When a format routine adds a new item, it copies the current output status\r
+% vector to the previous output status vector and (usually) resets the\r
+% current (this) output status vector to a "standard status" vector. Using a\r
+% "standard status" vector in this way allows us to redefine what we mean by\r
+% "standard status" at the start of each entry handler and reuse the same\r
+% format routines under the various inter-item separation schemes. For\r
+% example, the standard status vector for the @book entry type may use\r
+% commas for item separators, while the @electronic type may use periods,\r
+% yet both entry handlers exploit many of the exact same format routines.\r
+% \r
+% Because format routines have write access to the output status vector of\r
+% the previous item, they can override the punctuation choices of the\r
+% previous format routine! Therefore, it becomes trivial to implement rules\r
+% such as "Always use a period and a large space before the publisher." By\r
+% pushing the generation of the closing quote mark to the output routine, we\r
+% avoid all the problems caused by having to close a quote before having all\r
+% the information required to determine what the punctuation should be.\r
+%\r
+% The IEEEtran.bst output state system can easily be expanded if needed.\r
+% For instance, it is easy to add a "space.tie" attribute value if the\r
+% bibliography rules mandate that two items have to be joined with an\r
+% unbreakable space. \r
+\r
+FUNCTION {initialize.status.constants}\r
+{ #0 'punct.no :=\r
+ #1 'punct.comma :=\r
+ #2 'punct.period :=\r
+ #0 'space.no := \r
+ #1 'space.normal :=\r
+ #2 'space.large :=\r
+ #0 'quote.no :=\r
+ #1 'quote.close :=\r
+ #0 'cap.no :=\r
+ #1 'cap.yes :=\r
+ #0 'nline.no :=\r
+ #1 'nline.newblock :=\r
+}\r
+\r
+FUNCTION {std.status.using.comma}\r
+{ punct.comma 'punct.std :=\r
+ space.normal 'space.std :=\r
+ quote.no 'quote.std :=\r
+ nline.no 'nline.std :=\r
+ cap.no 'cap.std :=\r
+}\r
+\r
+FUNCTION {std.status.using.period}\r
+{ punct.period 'punct.std :=\r
+ space.normal 'space.std :=\r
+ quote.no 'quote.std :=\r
+ nline.no 'nline.std :=\r
+ cap.yes 'cap.std :=\r
+}\r
+\r
+FUNCTION {initialize.prev.this.status}\r
+{ punct.no 'prev.status.punct :=\r
+ space.no 'prev.status.space :=\r
+ quote.no 'prev.status.quote :=\r
+ nline.no 'prev.status.nline :=\r
+ punct.no 'this.status.punct :=\r
+ space.no 'this.status.space :=\r
+ quote.no 'this.status.quote :=\r
+ nline.no 'this.status.nline :=\r
+ cap.yes 'status.cap :=\r
+}\r
+\r
+FUNCTION {this.status.std}\r
+{ punct.std 'this.status.punct :=\r
+ space.std 'this.status.space :=\r
+ quote.std 'this.status.quote :=\r
+ nline.std 'this.status.nline :=\r
+}\r
+\r
+FUNCTION {cap.status.std}{ cap.std 'status.cap := }\r
+\r
+FUNCTION {this.to.prev.status}\r
+{ this.status.punct 'prev.status.punct :=\r
+ this.status.space 'prev.status.space :=\r
+ this.status.quote 'prev.status.quote :=\r
+ this.status.nline 'prev.status.nline :=\r
+}\r
+\r
+\r
+FUNCTION {not}\r
+{ { #0 }\r
+ { #1 }\r
+ if$\r
+}\r
+\r
+FUNCTION {and}\r
+{ { skip$ }\r
+ { pop$ #0 }\r
+ if$\r
+}\r
+\r
+FUNCTION {or}\r
+{ { pop$ #1 }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+\r
+% convert the strings "yes" or "no" to #1 or #0 respectively\r
+FUNCTION {yes.no.to.int}\r
+{ "l" change.case$ duplicate$\r
+ "yes" =\r
+ { pop$ #1 }\r
+ { duplicate$ "no" =\r
+ { pop$ #0 }\r
+ { "unknown boolean " quote$ * swap$ * quote$ *\r
+ " in " * cite$ * warning$\r
+ #0\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+% pushes true if the single char string on the stack is in the\r
+% range of "0" to "9"\r
+FUNCTION {is.num}\r
+{ chr.to.int$\r
+ duplicate$ "0" chr.to.int$ < not\r
+ swap$ "9" chr.to.int$ > not and\r
+}\r
+\r
+% multiplies the integer on the stack by a factor of 10\r
+FUNCTION {bump.int.mag}\r
+{ #0 'multiresult :=\r
+ { duplicate$ #0 > }\r
+ { #1 -\r
+ multiresult #10 +\r
+ 'multiresult :=\r
+ }\r
+ while$\r
+pop$\r
+multiresult\r
+}\r
+\r
+% converts a single character string on the stack to an integer\r
+FUNCTION {char.to.integer}\r
+{ duplicate$ \r
+ is.num\r
+ { chr.to.int$ "0" chr.to.int$ - }\r
+ {"noninteger character " quote$ * swap$ * quote$ *\r
+ " in integer field of " * cite$ * warning$\r
+ #0\r
+ }\r
+ if$\r
+}\r
+\r
+% converts a string on the stack to an integer\r
+FUNCTION {string.to.integer}\r
+{ duplicate$ text.length$ 'namesleft :=\r
+ #1 'nameptr :=\r
+ #0 'numnames :=\r
+ { nameptr namesleft > not }\r
+ { duplicate$ nameptr #1 substring$\r
+ char.to.integer numnames bump.int.mag +\r
+ 'numnames :=\r
+ nameptr #1 +\r
+ 'nameptr :=\r
+ }\r
+ while$\r
+pop$\r
+numnames\r
+}\r
+\r
+\r
+\r
+\r
+% The output routines write out the *next* to the top (previous) item on the\r
+% stack, adding punctuation and such as needed. Since IEEEtran.bst maintains\r
+% the output status for the top two items on the stack, these output\r
+% routines have to consider the previous output status (which corresponds to\r
+% the item that is being output). Full independent control of punctuation,\r
+% closing quote marks, spacing, and newblock is provided.\r
+% \r
+% "output.nonnull" does not check for the presence of a previous empty\r
+% item.\r
+% \r
+% "output" does check for the presence of a previous empty item and will\r
+% remove an empty item rather than outputing it.\r
+% \r
+% "output.warn" is like "output", but will issue a warning if it detects\r
+% an empty item.\r
+\r
+FUNCTION {output.nonnull}\r
+{ swap$\r
+ prev.status.punct punct.comma =\r
+ { "," * }\r
+ { skip$ }\r
+ if$\r
+ prev.status.punct punct.period =\r
+ { add.period$ }\r
+ { skip$ }\r
+ if$ \r
+ prev.status.quote quote.close =\r
+ { "''" * }\r
+ { skip$ }\r
+ if$\r
+ prev.status.space space.normal =\r
+ { " " * }\r
+ { skip$ }\r
+ if$\r
+ prev.status.space space.large =\r
+ { large.space * }\r
+ { skip$ }\r
+ if$\r
+ write$\r
+ prev.status.nline nline.newblock =\r
+ { newline$ "\newblock " write$ }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+FUNCTION {output}\r
+{ duplicate$ empty$\r
+ 'pop$\r
+ 'output.nonnull\r
+ if$\r
+}\r
+\r
+FUNCTION {output.warn}\r
+{ 't :=\r
+ duplicate$ empty$\r
+ { pop$ "empty " t * " in " * cite$ * warning$ }\r
+ 'output.nonnull\r
+ if$\r
+}\r
+\r
+% "fin.entry" is the output routine that handles the last item of the entry\r
+% (which will be on the top of the stack when "fin.entry" is called).\r
+\r
+FUNCTION {fin.entry}\r
+{ this.status.punct punct.no =\r
+ { skip$ }\r
+ { add.period$ }\r
+ if$\r
+ this.status.quote quote.close =\r
+ { "''" * }\r
+ { skip$ }\r
+ if$\r
+write$\r
+newline$\r
+}\r
+\r
+\r
+FUNCTION {is.last.char.not.punct}\r
+{ duplicate$\r
+ "}" * add.period$\r
+ #-1 #1 substring$ "." =\r
+}\r
+\r
+FUNCTION {is.multiple.pages}\r
+{ 't :=\r
+ #0 'multiresult :=\r
+ { multiresult not\r
+ t empty$ not\r
+ and\r
+ }\r
+ { t #1 #1 substring$\r
+ duplicate$ "-" =\r
+ swap$ duplicate$ "," =\r
+ swap$ "+" =\r
+ or or\r
+ { #1 'multiresult := }\r
+ { t #2 global.max$ substring$ 't := }\r
+ if$\r
+ }\r
+ while$\r
+ multiresult\r
+}\r
+\r
+FUNCTION {capitalize}{ "u" change.case$ "t" change.case$ }\r
+\r
+FUNCTION {emphasize}\r
+{ duplicate$ empty$\r
+ { pop$ "" }\r
+ { "\emph{" swap$ * "}" * }\r
+ if$\r
+}\r
+\r
+FUNCTION {do.name.latex.cmd}\r
+{ name.latex.cmd\r
+ empty$\r
+ { skip$ }\r
+ { name.latex.cmd "{" * swap$ * "}" * }\r
+ if$\r
+}\r
+\r
+% IEEEtran.bst uses its own \BIBforeignlanguage command which directly\r
+% invokes the TeX hyphenation patterns without the need of the Babel\r
+% package. Babel does a lot more than switch hyphenation patterns and\r
+% its loading can cause unintended effects in many class files (such as\r
+% IEEEtran.cls).\r
+FUNCTION {select.language}\r
+{ duplicate$ empty$ 'pop$\r
+ { language empty$ 'skip$\r
+ { "\BIBforeignlanguage{" language * "}{" * swap$ * "}" * }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {tie.or.space.prefix}\r
+{ duplicate$ text.length$ #3 <\r
+ { "~" }\r
+ { " " }\r
+ if$\r
+ swap$\r
+}\r
+\r
+FUNCTION {get.bbl.editor}\r
+{ editor num.names$ #1 > 'bbl.editors 'bbl.editor if$ }\r
+\r
+FUNCTION {space.word}{ " " swap$ * " " * }\r
+\r
+\r
+% Field Conditioners, Converters, Checkers and External Interfaces\r
+\r
+FUNCTION {empty.field.to.null.string}\r
+{ duplicate$ empty$\r
+ { pop$ "" }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+FUNCTION {either.or.check}\r
+{ empty$\r
+ { pop$ }\r
+ { "can't use both " swap$ * " fields in " * cite$ * warning$ }\r
+ if$\r
+}\r
+\r
+FUNCTION {empty.entry.warn}\r
+{ author empty$ title empty$ howpublished empty$\r
+ month empty$ year empty$ note empty$ url empty$\r
+ and and and and and and\r
+ { "all relevant fields are empty in " cite$ * warning$ }\r
+ 'skip$\r
+ if$\r
+}\r
+\r
+\r
+% The bibinfo system provides a way for the electronic parsing/acquisition\r
+% of a bibliography's contents as is done by ReVTeX. For example, a field\r
+% could be entered into the bibliography as:\r
+% \bibinfo{volume}{2}\r
+% Only the "2" would show up in the document, but the LaTeX \bibinfo command\r
+% could do additional things with the information. IEEEtran.bst does provide\r
+% a \bibinfo command via "\providecommand{\bibinfo}[2]{#2}". However, it is\r
+% currently not used as the bogus bibinfo functions defined here output the\r
+% entry values directly without the \bibinfo wrapper. The bibinfo functions\r
+% themselves (and the calls to them) are retained for possible future use.\r
+% \r
+% bibinfo.check avoids acting on missing fields while bibinfo.warn will\r
+% issue a warning message if a missing field is detected. Prior to calling\r
+% the bibinfo functions, the user should push the field value and then its\r
+% name string, in that order.\r
+\r
+FUNCTION {bibinfo.check}\r
+{ swap$ duplicate$ missing$\r
+ { pop$ pop$ "" }\r
+ { duplicate$ empty$\r
+ { swap$ pop$ }\r
+ { swap$ pop$ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {bibinfo.warn}\r
+{ swap$ duplicate$ missing$\r
+ { swap$ "missing " swap$ * " in " * cite$ * warning$ pop$ "" }\r
+ { duplicate$ empty$\r
+ { swap$ "empty " swap$ * " in " * cite$ * warning$ }\r
+ { swap$ pop$ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+% IEEE separates large numbers with more than 4 digits into groups of\r
+% three. IEEE uses a small space to separate these number groups. \r
+% Typical applications include patent and page numbers.\r
+\r
+% number of consecutive digits required to trigger the group separation.\r
+FUNCTION {large.number.trigger}{ #5 }\r
+\r
+% For numbers longer than the trigger, this is the blocksize of the groups.\r
+% The blocksize must be less than the trigger threshold, and 2 * blocksize\r
+% must be greater than the trigger threshold (can't do more than one\r
+% separation on the initial trigger).\r
+FUNCTION {large.number.blocksize}{ #3 }\r
+\r
+% What is actually inserted between the number groups.\r
+FUNCTION {large.number.separator}{ "\," }\r
+\r
+% So as to save on integer variables by reusing existing ones, numnames\r
+% holds the current number of consecutive digits read and nameptr holds\r
+% the number that will trigger an inserted space.\r
+FUNCTION {large.number.separate}\r
+{ 't :=\r
+ ""\r
+ #0 'numnames :=\r
+ large.number.trigger 'nameptr :=\r
+ { t empty$ not }\r
+ { t #-1 #1 substring$ is.num\r
+ { numnames #1 + 'numnames := }\r
+ { #0 'numnames := \r
+ large.number.trigger 'nameptr :=\r
+ }\r
+ if$\r
+ t #-1 #1 substring$ swap$ *\r
+ t #-2 global.max$ substring$ 't :=\r
+ numnames nameptr =\r
+ { duplicate$ #1 nameptr large.number.blocksize - substring$ swap$\r
+ nameptr large.number.blocksize - #1 + global.max$ substring$\r
+ large.number.separator swap$ * *\r
+ nameptr large.number.blocksize - 'numnames :=\r
+ large.number.blocksize #1 + 'nameptr :=\r
+ }\r
+ { skip$ }\r
+ if$\r
+ }\r
+ while$\r
+}\r
+\r
+% Converts all single dashes "-" to double dashes "--".\r
+FUNCTION {n.dashify}\r
+{ large.number.separate\r
+ 't :=\r
+ ""\r
+ { t empty$ not }\r
+ { t #1 #1 substring$ "-" =\r
+ { t #1 #2 substring$ "--" = not\r
+ { "--" *\r
+ t #2 global.max$ substring$ 't :=\r
+ }\r
+ { { t #1 #1 substring$ "-" = }\r
+ { "-" *\r
+ t #2 global.max$ substring$ 't :=\r
+ }\r
+ while$\r
+ }\r
+ if$\r
+ }\r
+ { t #1 #1 substring$ *\r
+ t #2 global.max$ substring$ 't :=\r
+ }\r
+ if$\r
+ }\r
+ while$\r
+}\r
+\r
+\r
+% This function detects entries with names that are identical to that of\r
+% the previous entry and replaces the repeated names with dashes (if the\r
+% "is.dash.repeated.names" user control is nonzero).\r
+FUNCTION {name.or.dash}\r
+{ 's :=\r
+ oldname empty$\r
+ { s 'oldname := s }\r
+ { s oldname =\r
+ { is.dash.repeated.names\r
+ { repeated.name.dashes }\r
+ { s 'oldname := s }\r
+ if$\r
+ }\r
+ { s 'oldname := s }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+% Converts the number string on the top of the stack to\r
+% "numerical ordinal form" (e.g., "7" to "7th"). There is\r
+% no artificial limit to the upper bound of the numbers as the\r
+% least significant digit always determines the ordinal form.\r
+FUNCTION {num.to.ordinal}\r
+{ duplicate$ #-1 #1 substring$ "1" =\r
+ { bbl.st * }\r
+ { duplicate$ #-1 #1 substring$ "2" =\r
+ { bbl.nd * }\r
+ { duplicate$ #-1 #1 substring$ "3" =\r
+ { bbl.rd * }\r
+ { bbl.th * }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+% If the string on the top of the stack begins with a number,\r
+% (e.g., 11th) then replace the string with the leading number\r
+% it contains. Otherwise retain the string as-is. s holds the\r
+% extracted number, t holds the part of the string that remains\r
+% to be scanned.\r
+FUNCTION {extract.num}\r
+{ duplicate$ 't :=\r
+ "" 's :=\r
+ { t empty$ not }\r
+ { t #1 #1 substring$\r
+ t #2 global.max$ substring$ 't :=\r
+ duplicate$ is.num\r
+ { s swap$ * 's := }\r
+ { pop$ "" 't := }\r
+ if$\r
+ }\r
+ while$\r
+ s empty$\r
+ 'skip$\r
+ { pop$ s }\r
+ if$\r
+}\r
+\r
+% Converts the word number string on the top of the stack to\r
+% Arabic string form. Will be successful up to "tenth".\r
+FUNCTION {word.to.num}\r
+{ duplicate$ "l" change.case$ 's :=\r
+ s "first" =\r
+ { pop$ "1" }\r
+ { skip$ }\r
+ if$\r
+ s "second" =\r
+ { pop$ "2" }\r
+ { skip$ }\r
+ if$\r
+ s "third" =\r
+ { pop$ "3" }\r
+ { skip$ }\r
+ if$\r
+ s "fourth" =\r
+ { pop$ "4" }\r
+ { skip$ }\r
+ if$\r
+ s "fifth" =\r
+ { pop$ "5" }\r
+ { skip$ }\r
+ if$\r
+ s "sixth" =\r
+ { pop$ "6" }\r
+ { skip$ }\r
+ if$\r
+ s "seventh" =\r
+ { pop$ "7" }\r
+ { skip$ }\r
+ if$\r
+ s "eighth" =\r
+ { pop$ "8" }\r
+ { skip$ }\r
+ if$\r
+ s "ninth" =\r
+ { pop$ "9" }\r
+ { skip$ }\r
+ if$\r
+ s "tenth" =\r
+ { pop$ "10" }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+\r
+% Converts the string on the top of the stack to numerical\r
+% ordinal (e.g., "11th") form.\r
+FUNCTION {convert.edition}\r
+{ duplicate$ empty$ 'skip$\r
+ { duplicate$ #1 #1 substring$ is.num\r
+ { extract.num\r
+ num.to.ordinal\r
+ }\r
+ { word.to.num\r
+ duplicate$ #1 #1 substring$ is.num\r
+ { num.to.ordinal }\r
+ { "edition ordinal word " quote$ * edition * quote$ *\r
+ " may be too high (or improper) for conversion" * " in " * cite$ * warning$\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% LATEX BIBLIOGRAPHY CODE %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+FUNCTION {start.entry}\r
+{ newline$\r
+ "\bibitem{" write$\r
+ cite$ write$\r
+ "}" write$\r
+ newline$\r
+ ""\r
+ initialize.prev.this.status\r
+}\r
+\r
+% Here we write out all the LaTeX code that we will need. The most involved\r
+% code sequences are those that control the alternate interword spacing and\r
+% foreign language hyphenation patterns. The heavy use of \providecommand\r
+% gives users a way to override the defaults. Special thanks to Javier Bezos,\r
+% Johannes Braams, Robin Fairbairns, Heiko Oberdiek, Donald Arseneau and all\r
+% the other gurus on comp.text.tex for their help and advice on the topic of\r
+% \selectlanguage, Babel and BibTeX.\r
+FUNCTION {begin.bib}\r
+{ "% Generated by IEEEtran.bst, version: " bst.file.version * " (" * bst.file.date * ")" *\r
+ write$ newline$\r
+ preamble$ empty$ 'skip$\r
+ { preamble$ write$ newline$ }\r
+ if$\r
+ "\begin{thebibliography}{" longest.label * "}" *\r
+ write$ newline$\r
+ "\providecommand{\url}[1]{#1}"\r
+ write$ newline$\r
+ "\csname url@samestyle\endcsname"\r
+ write$ newline$\r
+ "\providecommand{\newblock}{\relax}"\r
+ write$ newline$\r
+ "\providecommand{\bibinfo}[2]{#2}"\r
+ write$ newline$\r
+ "\providecommand{\BIBentrySTDinterwordspacing}{\spaceskip=0pt\relax}"\r
+ write$ newline$\r
+ "\providecommand{\BIBentryALTinterwordstretchfactor}{"\r
+ ALTinterwordstretchfactor * "}" *\r
+ write$ newline$\r
+ "\providecommand{\BIBentryALTinterwordspacing}{\spaceskip=\fontdimen2\font plus "\r
+ write$ newline$\r
+ "\BIBentryALTinterwordstretchfactor\fontdimen3\font minus \fontdimen4\font\relax}"\r
+ write$ newline$\r
+ "\providecommand{\BIBforeignlanguage}[2]{{%"\r
+ write$ newline$\r
+ "\expandafter\ifx\csname l@#1\endcsname\relax"\r
+ write$ newline$\r
+ "\typeout{** WARNING: IEEEtran.bst: No hyphenation pattern has been}%"\r
+ write$ newline$\r
+ "\typeout{** loaded for the language `#1'. Using the pattern for}%"\r
+ write$ newline$\r
+ "\typeout{** the default language instead.}%"\r
+ write$ newline$\r
+ "\else"\r
+ write$ newline$\r
+ "\language=\csname l@#1\endcsname"\r
+ write$ newline$\r
+ "\fi"\r
+ write$ newline$\r
+ "#2}}"\r
+ write$ newline$\r
+ "\providecommand{\BIBdecl}{\relax}"\r
+ write$ newline$\r
+ "\BIBdecl"\r
+ write$ newline$\r
+}\r
+\r
+FUNCTION {end.bib}\r
+{ newline$ "\end{thebibliography}" write$ newline$ }\r
+\r
+FUNCTION {if.url.alt.interword.spacing}\r
+{ is.use.alt.interword.spacing \r
+ {url empty$ 'skip$ {"\BIBentryALTinterwordspacing" write$ newline$} if$}\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+FUNCTION {if.url.std.interword.spacing}\r
+{ is.use.alt.interword.spacing \r
+ {url empty$ 'skip$ {"\BIBentrySTDinterwordspacing" write$ newline$} if$}\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%%%%\r
+%% LONGEST LABEL PASS %%\r
+%%%%%%%%%%%%%%%%%%%%%%%%\r
+\r
+FUNCTION {initialize.longest.label}\r
+{ "" 'longest.label :=\r
+ #1 'number.label :=\r
+ #0 'longest.label.width :=\r
+}\r
+\r
+FUNCTION {longest.label.pass}\r
+{ type$ "ieeetranbstctl" =\r
+ { skip$ }\r
+ { number.label int.to.str$ 'label :=\r
+ number.label #1 + 'number.label :=\r
+ label width$ longest.label.width >\r
+ { label 'longest.label :=\r
+ label width$ 'longest.label.width :=\r
+ }\r
+ { skip$ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%%\r
+%% FORMAT HANDLERS %%\r
+%%%%%%%%%%%%%%%%%%%%%\r
+\r
+%% Lower Level Formats (used by higher level formats)\r
+\r
+FUNCTION {format.address.org.or.pub.date}\r
+{ 't :=\r
+ ""\r
+ year empty$\r
+ { "empty year in " cite$ * warning$ }\r
+ { skip$ }\r
+ if$\r
+ address empty$ t empty$ and\r
+ year empty$ and month empty$ and\r
+ { skip$ }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ address "address" bibinfo.check *\r
+ t empty$\r
+ { skip$ }\r
+ { punct.period 'prev.status.punct :=\r
+ space.large 'prev.status.space :=\r
+ address empty$\r
+ { skip$ }\r
+ { ": " * }\r
+ if$\r
+ t *\r
+ }\r
+ if$\r
+ year empty$ month empty$ and\r
+ { skip$ }\r
+ { t empty$ address empty$ and\r
+ { skip$ }\r
+ { ", " * }\r
+ if$\r
+ month empty$\r
+ { year empty$\r
+ { skip$ }\r
+ { year "year" bibinfo.check * }\r
+ if$\r
+ }\r
+ { month "month" bibinfo.check *\r
+ year empty$\r
+ { skip$ }\r
+ { " " * year "year" bibinfo.check * }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+FUNCTION {format.names}\r
+{ 'bibinfo :=\r
+ duplicate$ empty$ 'skip$ {\r
+ this.to.prev.status\r
+ this.status.std\r
+ 's :=\r
+ "" 't :=\r
+ #1 'nameptr :=\r
+ s num.names$ 'numnames :=\r
+ numnames 'namesleft :=\r
+ { namesleft #0 > }\r
+ { s nameptr\r
+ name.format.string\r
+ format.name$\r
+ bibinfo bibinfo.check\r
+ 't :=\r
+ nameptr #1 >\r
+ { nameptr num.names.shown.with.forced.et.al #1 + =\r
+ numnames max.num.names.before.forced.et.al >\r
+ is.forced.et.al and and\r
+ { "others" 't :=\r
+ #1 'namesleft :=\r
+ }\r
+ { skip$ }\r
+ if$\r
+ namesleft #1 >\r
+ { ", " * t do.name.latex.cmd * }\r
+ { s nameptr "{ll}" format.name$ duplicate$ "others" =\r
+ { 't := }\r
+ { pop$ }\r
+ if$\r
+ t "others" =\r
+ { " " * bbl.etal emphasize * }\r
+ { numnames #2 >\r
+ { "," * }\r
+ { skip$ }\r
+ if$\r
+ bbl.and\r
+ space.word * t do.name.latex.cmd *\r
+ }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ { t do.name.latex.cmd }\r
+ if$\r
+ nameptr #1 + 'nameptr :=\r
+ namesleft #1 - 'namesleft :=\r
+ }\r
+ while$\r
+ cap.status.std\r
+ } if$\r
+}\r
+\r
+\r
+\r
+\r
+%% Higher Level Formats\r
+\r
+%% addresses/locations\r
+\r
+FUNCTION {format.address}\r
+{ address duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% author/editor names\r
+\r
+FUNCTION {format.authors}{ author "author" format.names }\r
+\r
+FUNCTION {format.editors}\r
+{ editor "editor" format.names duplicate$ empty$ 'skip$\r
+ { ", " *\r
+ get.bbl.editor\r
+ capitalize\r
+ *\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% date\r
+\r
+FUNCTION {format.date}\r
+{\r
+ month "month" bibinfo.check duplicate$ empty$\r
+ year "year" bibinfo.check duplicate$ empty$\r
+ { swap$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ "there's a month but no year in " cite$ * warning$ }\r
+ if$\r
+ *\r
+ }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ swap$ 'skip$\r
+ {\r
+ swap$\r
+ " " * swap$\r
+ }\r
+ if$\r
+ *\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.date.electronic}\r
+{ month "month" bibinfo.check duplicate$ empty$\r
+ year "year" bibinfo.check duplicate$ empty$\r
+ { swap$ \r
+ { pop$ }\r
+ { "there's a month but no year in " cite$ * warning$\r
+ pop$ ")" * "(" swap$ *\r
+ this.to.prev.status\r
+ punct.no 'this.status.punct :=\r
+ space.normal 'this.status.space :=\r
+ quote.no 'this.status.quote :=\r
+ cap.yes 'status.cap :=\r
+ }\r
+ if$\r
+ }\r
+ { swap$ \r
+ { swap$ pop$ ")" * "(" swap$ * }\r
+ { "(" swap$ * ", " * swap$ * ")" * }\r
+ if$\r
+ this.to.prev.status\r
+ punct.no 'this.status.punct :=\r
+ space.normal 'this.status.space :=\r
+ quote.no 'this.status.quote :=\r
+ cap.yes 'status.cap :=\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% edition/title\r
+\r
+% Note: IEEE considers the edition to be closely associated with\r
+% the title of a book. So, in IEEEtran.bst the edition is normally handled \r
+% within the formatting of the title. The format.edition function is \r
+% retained here for possible future use.\r
+FUNCTION {format.edition}\r
+{ edition duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ convert.edition\r
+ status.cap\r
+ { "t" }\r
+ { "l" }\r
+ if$ change.case$\r
+ "edition" bibinfo.check\r
+ "~" * bbl.edition *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+% This is used to format the booktitle of a conference proceedings.\r
+% Here we use the "intype" field to provide the user a way to \r
+% override the word "in" (e.g., with things like "presented at")\r
+% Use of intype stops the emphasis of the booktitle to indicate that\r
+% we no longer mean the written conference proceedings, but the\r
+% conference itself.\r
+FUNCTION {format.in.booktitle}\r
+{ booktitle "booktitle" bibinfo.check duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ select.language\r
+ intype missing$\r
+ { emphasize\r
+ bbl.in " " *\r
+ }\r
+ { intype " " * }\r
+ if$\r
+ swap$ *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+% This is used to format the booktitle of collection.\r
+% Here the "intype" field is not supported, but "edition" is.\r
+FUNCTION {format.in.booktitle.edition}\r
+{ booktitle "booktitle" bibinfo.check duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ select.language\r
+ emphasize\r
+ edition empty$ 'skip$\r
+ { ", " *\r
+ edition\r
+ convert.edition\r
+ "l" change.case$\r
+ * "~" * bbl.edition *\r
+ }\r
+ if$\r
+ bbl.in " " * swap$ *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.article.title}\r
+{ title duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ "t" change.case$\r
+ }\r
+ if$\r
+ "title" bibinfo.check\r
+ duplicate$ empty$ 'skip$\r
+ { quote.close 'this.status.quote :=\r
+ is.last.char.not.punct\r
+ { punct.std 'this.status.punct := }\r
+ { punct.no 'this.status.punct := }\r
+ if$\r
+ select.language\r
+ "``" swap$ *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.article.title.electronic}\r
+{ title duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ "t" change.case$ \r
+ }\r
+ if$\r
+ "title" bibinfo.check\r
+ duplicate$ empty$ \r
+ { skip$ } \r
+ { select.language }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.book.title.edition}\r
+{ title "title" bibinfo.check\r
+ duplicate$ empty$\r
+ { "empty title in " cite$ * warning$ }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ select.language\r
+ emphasize\r
+ edition empty$ 'skip$\r
+ { ", " *\r
+ edition\r
+ convert.edition\r
+ status.cap\r
+ { "t" }\r
+ { "l" }\r
+ if$\r
+ change.case$\r
+ * "~" * bbl.edition *\r
+ }\r
+ if$\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.book.title}\r
+{ title "title" bibinfo.check\r
+ duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ select.language\r
+ emphasize\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% journal\r
+\r
+FUNCTION {format.journal}\r
+{ journal duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ select.language\r
+ emphasize\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% how published\r
+\r
+FUNCTION {format.howpublished}\r
+{ howpublished duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% institutions/organization/publishers/school\r
+\r
+FUNCTION {format.institution}\r
+{ institution duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.organization}\r
+{ organization duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.address.publisher.date}\r
+{ publisher "publisher" bibinfo.warn format.address.org.or.pub.date }\r
+\r
+FUNCTION {format.address.publisher.date.nowarn}\r
+{ publisher "publisher" bibinfo.check format.address.org.or.pub.date }\r
+\r
+FUNCTION {format.address.organization.date}\r
+{ organization "organization" bibinfo.check format.address.org.or.pub.date }\r
+\r
+FUNCTION {format.school}\r
+{ school duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% volume/number/series/chapter/pages\r
+\r
+FUNCTION {format.volume}\r
+{ volume empty.field.to.null.string\r
+ duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ bbl.volume \r
+ status.cap\r
+ { capitalize }\r
+ { skip$ }\r
+ if$\r
+ swap$ tie.or.space.prefix\r
+ "volume" bibinfo.check\r
+ * *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.number}\r
+{ number empty.field.to.null.string\r
+ duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ status.cap\r
+ { bbl.number capitalize }\r
+ { bbl.number }\r
+ if$\r
+ swap$ tie.or.space.prefix\r
+ "number" bibinfo.check\r
+ * *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+FUNCTION {format.number.if.use.for.article}\r
+{ is.use.number.for.article \r
+ { format.number }\r
+ { "" }\r
+ if$\r
+}\r
+\r
+% IEEE does not seem to tie the series so closely with the volume\r
+% and number as is done in other bibliography styles. Instead the\r
+% series is treated somewhat like an extension of the title.\r
+FUNCTION {format.series}\r
+{ series empty$ \r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ bbl.series " " *\r
+ series "series" bibinfo.check *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+FUNCTION {format.chapter}\r
+{ chapter empty$\r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ type empty$\r
+ { bbl.chapter }\r
+ { type "l" change.case$\r
+ "type" bibinfo.check\r
+ }\r
+ if$\r
+ chapter tie.or.space.prefix\r
+ "chapter" bibinfo.check\r
+ * *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+% The intended use of format.paper is for paper numbers of inproceedings.\r
+% The paper type can be overridden via the type field.\r
+% We allow the type to be displayed even if the paper number is absent\r
+% for things like "postdeadline paper"\r
+FUNCTION {format.paper}\r
+{ is.use.paper\r
+ { paper empty$\r
+ { type empty$\r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ type "type" bibinfo.check\r
+ cap.status.std\r
+ }\r
+ if$\r
+ }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ type empty$\r
+ { bbl.paper }\r
+ { type "type" bibinfo.check }\r
+ if$\r
+ " " * paper\r
+ "paper" bibinfo.check\r
+ *\r
+ cap.status.std\r
+ }\r
+ if$\r
+ }\r
+ { "" } \r
+ if$\r
+}\r
+\r
+\r
+FUNCTION {format.pages}\r
+{ pages duplicate$ empty$ 'skip$\r
+ { this.to.prev.status\r
+ this.status.std\r
+ duplicate$ is.multiple.pages\r
+ {\r
+ bbl.pages swap$\r
+ n.dashify\r
+ }\r
+ {\r
+ bbl.page swap$\r
+ }\r
+ if$\r
+ tie.or.space.prefix\r
+ "pages" bibinfo.check\r
+ * *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% technical report number\r
+\r
+FUNCTION {format.tech.report.number}\r
+{ number "number" bibinfo.check\r
+ this.to.prev.status\r
+ this.status.std\r
+ cap.status.std\r
+ type duplicate$ empty$\r
+ { pop$ \r
+ bbl.techrep\r
+ }\r
+ { skip$ }\r
+ if$\r
+ "type" bibinfo.check \r
+ swap$ duplicate$ empty$\r
+ { pop$ }\r
+ { tie.or.space.prefix * * }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% note\r
+\r
+FUNCTION {format.note}\r
+{ note empty$\r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ punct.period 'this.status.punct :=\r
+ note #1 #1 substring$\r
+ duplicate$ "{" =\r
+ { skip$ }\r
+ { status.cap\r
+ { "u" }\r
+ { "l" }\r
+ if$\r
+ change.case$\r
+ }\r
+ if$\r
+ note #2 global.max$ substring$ * "note" bibinfo.check\r
+ cap.yes 'status.cap :=\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+%% patent\r
+\r
+FUNCTION {format.patent.date}\r
+{ this.to.prev.status\r
+ this.status.std\r
+ year empty$\r
+ { monthfiled duplicate$ empty$\r
+ { "monthfiled" bibinfo.check pop$ "" }\r
+ { "monthfiled" bibinfo.check }\r
+ if$\r
+ dayfiled duplicate$ empty$\r
+ { "dayfiled" bibinfo.check pop$ "" * }\r
+ { "dayfiled" bibinfo.check \r
+ monthfiled empty$ \r
+ { "dayfiled without a monthfiled in " cite$ * warning$\r
+ * \r
+ }\r
+ { " " swap$ * * }\r
+ if$\r
+ }\r
+ if$\r
+ yearfiled empty$\r
+ { "no year or yearfiled in " cite$ * warning$ }\r
+ { yearfiled "yearfiled" bibinfo.check \r
+ swap$\r
+ duplicate$ empty$\r
+ { pop$ }\r
+ { ", " * swap$ * }\r
+ if$\r
+ }\r
+ if$\r
+ }\r
+ { month duplicate$ empty$\r
+ { "month" bibinfo.check pop$ "" }\r
+ { "month" bibinfo.check }\r
+ if$\r
+ day duplicate$ empty$\r
+ { "day" bibinfo.check pop$ "" * }\r
+ { "day" bibinfo.check \r
+ month empty$ \r
+ { "day without a month in " cite$ * warning$\r
+ * \r
+ }\r
+ { " " swap$ * * }\r
+ if$\r
+ }\r
+ if$\r
+ year "year" bibinfo.check \r
+ swap$\r
+ duplicate$ empty$\r
+ { pop$ }\r
+ { ", " * swap$ * }\r
+ if$\r
+ }\r
+ if$\r
+ cap.status.std\r
+}\r
+\r
+FUNCTION {format.patent.nationality.type.number}\r
+{ this.to.prev.status\r
+ this.status.std\r
+ nationality duplicate$ empty$\r
+ { "nationality" bibinfo.warn pop$ "" }\r
+ { "nationality" bibinfo.check\r
+ duplicate$ "l" change.case$ "united states" =\r
+ { pop$ bbl.patentUS }\r
+ { skip$ }\r
+ if$\r
+ " " *\r
+ }\r
+ if$\r
+ type empty$\r
+ { bbl.patent "type" bibinfo.check }\r
+ { type "type" bibinfo.check }\r
+ if$ \r
+ *\r
+ number duplicate$ empty$\r
+ { "number" bibinfo.warn pop$ }\r
+ { "number" bibinfo.check\r
+ large.number.separate\r
+ swap$ " " * swap$ *\r
+ }\r
+ if$ \r
+ cap.status.std\r
+}\r
+\r
+\r
+\r
+%% standard\r
+\r
+FUNCTION {format.organization.institution.standard.type.number}\r
+{ this.to.prev.status\r
+ this.status.std\r
+ organization duplicate$ empty$\r
+ { pop$ \r
+ institution duplicate$ empty$\r
+ { "institution" bibinfo.warn }\r
+ { "institution" bibinfo.warn " " * }\r
+ if$\r
+ }\r
+ { "organization" bibinfo.warn " " * }\r
+ if$\r
+ type empty$\r
+ { bbl.standard "type" bibinfo.check }\r
+ { type "type" bibinfo.check }\r
+ if$ \r
+ *\r
+ number duplicate$ empty$\r
+ { "number" bibinfo.check pop$ }\r
+ { "number" bibinfo.check\r
+ large.number.separate\r
+ swap$ " " * swap$ *\r
+ }\r
+ if$ \r
+ cap.status.std\r
+}\r
+\r
+FUNCTION {format.revision}\r
+{ revision empty$\r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ bbl.revision\r
+ revision tie.or.space.prefix\r
+ "revision" bibinfo.check\r
+ * *\r
+ cap.status.std\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+%% thesis\r
+\r
+FUNCTION {format.master.thesis.type}\r
+{ this.to.prev.status\r
+ this.status.std\r
+ type empty$\r
+ {\r
+ bbl.mthesis\r
+ }\r
+ { \r
+ type "type" bibinfo.check\r
+ }\r
+ if$\r
+cap.status.std\r
+}\r
+\r
+FUNCTION {format.phd.thesis.type}\r
+{ this.to.prev.status\r
+ this.status.std\r
+ type empty$\r
+ {\r
+ bbl.phdthesis\r
+ }\r
+ { \r
+ type "type" bibinfo.check\r
+ }\r
+ if$\r
+cap.status.std\r
+}\r
+\r
+\r
+\r
+%% URL\r
+\r
+FUNCTION {format.url}\r
+{ url empty$\r
+ { "" }\r
+ { this.to.prev.status\r
+ this.status.std\r
+ cap.yes 'status.cap :=\r
+ name.url.prefix " " *\r
+ "\url{" * url * "}" *\r
+ punct.no 'this.status.punct :=\r
+ punct.period 'prev.status.punct :=\r
+ space.normal 'this.status.space :=\r
+ space.normal 'prev.status.space :=\r
+ quote.no 'this.status.quote :=\r
+ }\r
+ if$\r
+}\r
+\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%%\r
+%% ENTRY HANDLERS %%\r
+%%%%%%%%%%%%%%%%%%%%\r
+\r
+\r
+% Note: In many journals, IEEE (or the authors) tend not to show the number\r
+% for articles, so the display of the number is controlled here by the\r
+% switch "is.use.number.for.article"\r
+FUNCTION {article}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.journal "journal" bibinfo.check "journal" output.warn\r
+ format.volume output\r
+ format.number.if.use.for.article output\r
+ format.pages output\r
+ format.date "year" output.warn\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {book}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ author empty$\r
+ { format.editors "author and editor" output.warn }\r
+ { format.authors output.nonnull }\r
+ if$\r
+ name.or.dash\r
+ format.book.title.edition output\r
+ format.series output\r
+ author empty$\r
+ { skip$ }\r
+ { format.editors output }\r
+ if$\r
+ format.address.publisher.date output\r
+ format.volume output\r
+ format.number output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {booklet}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.howpublished "howpublished" bibinfo.check output\r
+ format.organization "organization" bibinfo.check output\r
+ format.address "address" bibinfo.check output\r
+ format.date output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {electronic}\r
+{ std.status.using.period\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.date.electronic output\r
+ format.article.title.electronic output\r
+ format.howpublished "howpublished" bibinfo.check output\r
+ format.organization "organization" bibinfo.check output\r
+ format.address "address" bibinfo.check output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ empty.entry.warn\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {inbook}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ author empty$\r
+ { format.editors "author and editor" output.warn }\r
+ { format.authors output.nonnull }\r
+ if$\r
+ name.or.dash\r
+ format.book.title.edition output\r
+ format.series output\r
+ format.address.publisher.date output\r
+ format.volume output\r
+ format.number output\r
+ format.chapter output\r
+ format.pages output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {incollection}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.in.booktitle.edition "booktitle" output.warn\r
+ format.series output\r
+ format.editors output\r
+ format.address.publisher.date.nowarn output\r
+ format.volume output\r
+ format.number output\r
+ format.chapter output\r
+ format.pages output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {inproceedings}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.in.booktitle "booktitle" output.warn\r
+ format.series output\r
+ format.editors output\r
+ format.volume output\r
+ format.number output\r
+ publisher empty$\r
+ { format.address.organization.date output }\r
+ { format.organization "organization" bibinfo.check output\r
+ format.address.publisher.date output\r
+ }\r
+ if$\r
+ format.paper output\r
+ format.pages output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {manual}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.book.title.edition "title" output.warn\r
+ format.howpublished "howpublished" bibinfo.check output \r
+ format.organization "organization" bibinfo.check output\r
+ format.address "address" bibinfo.check output\r
+ format.date output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {mastersthesis}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.master.thesis.type output.nonnull\r
+ format.school "school" bibinfo.warn output\r
+ format.address "address" bibinfo.check output\r
+ format.date "year" output.warn\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {misc}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.article.title output\r
+ format.howpublished "howpublished" bibinfo.check output \r
+ format.organization "organization" bibinfo.check output\r
+ format.address "address" bibinfo.check output\r
+ format.pages output\r
+ format.date output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ empty.entry.warn\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {patent}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.article.title output\r
+ format.patent.nationality.type.number output\r
+ format.patent.date output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ empty.entry.warn\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {periodical}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.editors output\r
+ name.or.dash\r
+ format.book.title "title" output.warn\r
+ format.series output\r
+ format.volume output\r
+ format.number output\r
+ format.organization "organization" bibinfo.check output\r
+ format.date "year" output.warn\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {phdthesis}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.phd.thesis.type output.nonnull\r
+ format.school "school" bibinfo.warn output\r
+ format.address "address" bibinfo.check output\r
+ format.date "year" output.warn\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {proceedings}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.editors output\r
+ name.or.dash\r
+ format.book.title "title" output.warn\r
+ format.series output\r
+ format.volume output\r
+ format.number output\r
+ publisher empty$\r
+ { format.address.organization.date output }\r
+ { format.organization "organization" bibinfo.check output\r
+ format.address.publisher.date output\r
+ }\r
+ if$\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {standard}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors output\r
+ name.or.dash\r
+ format.book.title "title" output.warn\r
+ format.howpublished "howpublished" bibinfo.check output \r
+ format.organization.institution.standard.type.number output\r
+ format.revision output\r
+ format.date output\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {techreport}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.howpublished "howpublished" bibinfo.check output \r
+ format.institution "institution" bibinfo.warn output\r
+ format.address "address" bibinfo.check output\r
+ format.tech.report.number output.nonnull\r
+ format.date "year" output.warn\r
+ format.note output\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+FUNCTION {unpublished}\r
+{ std.status.using.comma\r
+ start.entry\r
+ if.url.alt.interword.spacing\r
+ format.authors "author" output.warn\r
+ name.or.dash\r
+ format.article.title "title" output.warn\r
+ format.date output\r
+ format.note "note" output.warn\r
+ format.url output\r
+ fin.entry\r
+ if.url.std.interword.spacing\r
+}\r
+\r
+\r
+% The special entry type which provides the user interface to the\r
+% BST controls\r
+FUNCTION {IEEEtranBSTCTL}\r
+{ is.print.banners.to.terminal\r
+ { "** IEEEtran BST control entry " quote$ * cite$ * quote$ * " detected." *\r
+ top$\r
+ }\r
+ { skip$ }\r
+ if$\r
+ CTLuse_article_number\r
+ empty$\r
+ { skip$ }\r
+ { CTLuse_article_number\r
+ yes.no.to.int\r
+ 'is.use.number.for.article :=\r
+ }\r
+ if$\r
+ CTLuse_paper\r
+ empty$\r
+ { skip$ }\r
+ { CTLuse_paper\r
+ yes.no.to.int\r
+ 'is.use.paper :=\r
+ }\r
+ if$\r
+ CTLuse_forced_etal\r
+ empty$\r
+ { skip$ }\r
+ { CTLuse_forced_etal\r
+ yes.no.to.int\r
+ 'is.forced.et.al :=\r
+ }\r
+ if$\r
+ CTLmax_names_forced_etal\r
+ empty$\r
+ { skip$ }\r
+ { CTLmax_names_forced_etal\r
+ string.to.integer\r
+ 'max.num.names.before.forced.et.al :=\r
+ }\r
+ if$\r
+ CTLnames_show_etal\r
+ empty$\r
+ { skip$ }\r
+ { CTLnames_show_etal\r
+ string.to.integer\r
+ 'num.names.shown.with.forced.et.al :=\r
+ }\r
+ if$\r
+ CTLuse_alt_spacing\r
+ empty$\r
+ { skip$ }\r
+ { CTLuse_alt_spacing\r
+ yes.no.to.int\r
+ 'is.use.alt.interword.spacing :=\r
+ }\r
+ if$\r
+ CTLalt_stretch_factor\r
+ empty$\r
+ { skip$ }\r
+ { CTLalt_stretch_factor\r
+ 'ALTinterwordstretchfactor :=\r
+ "\renewcommand{\BIBentryALTinterwordstretchfactor}{"\r
+ ALTinterwordstretchfactor * "}" *\r
+ write$ newline$\r
+ }\r
+ if$\r
+ CTLdash_repeated_names\r
+ empty$\r
+ { skip$ }\r
+ { CTLdash_repeated_names\r
+ yes.no.to.int\r
+ 'is.dash.repeated.names :=\r
+ }\r
+ if$\r
+ CTLname_format_string\r
+ empty$\r
+ { skip$ }\r
+ { CTLname_format_string\r
+ 'name.format.string :=\r
+ }\r
+ if$\r
+ CTLname_latex_cmd\r
+ empty$\r
+ { skip$ }\r
+ { CTLname_latex_cmd\r
+ 'name.latex.cmd :=\r
+ }\r
+ if$\r
+ CTLname_url_prefix\r
+ missing$\r
+ { skip$ }\r
+ { CTLname_url_prefix\r
+ 'name.url.prefix :=\r
+ }\r
+ if$\r
+\r
+\r
+ num.names.shown.with.forced.et.al max.num.names.before.forced.et.al >\r
+ { "CTLnames_show_etal cannot be greater than CTLmax_names_forced_etal in " cite$ * warning$ \r
+ max.num.names.before.forced.et.al 'num.names.shown.with.forced.et.al :=\r
+ }\r
+ { skip$ }\r
+ if$\r
+}\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%%\r
+%% ENTRY ALIASES %%\r
+%%%%%%%%%%%%%%%%%%%\r
+FUNCTION {conference}{inproceedings}\r
+FUNCTION {online}{electronic}\r
+FUNCTION {internet}{electronic}\r
+FUNCTION {webpage}{electronic}\r
+FUNCTION {www}{electronic}\r
+FUNCTION {default.type}{misc}\r
+\r
+\r
+\r
+%%%%%%%%%%%%%%%%%%\r
+%% MAIN PROGRAM %%\r
+%%%%%%%%%%%%%%%%%%\r
+\r
+READ\r
+\r
+EXECUTE {initialize.controls}\r
+EXECUTE {initialize.status.constants}\r
+EXECUTE {banner.message}\r
+\r
+EXECUTE {initialize.longest.label}\r
+ITERATE {longest.label.pass}\r
+\r
+EXECUTE {begin.bib}\r
+ITERATE {call.type$}\r
+EXECUTE {end.bib}\r
+\r
+EXECUTE{completed.message}\r
+\r
+\r
+%% That's all folks, mds.\r
--- /dev/null
+OpenMP Application Program Interface, 4th edition, July 2013.
+URL: http://www.openmp.org/mp-documents/OpenMP4.0.0.pdf.
+
+Peter Pacheco. Parallel Programming with MPI. Morgan Kaufmann, 1996.
+
+@Book{Peter96,
+ALTauthor = {Peter Pacheco},
+ALTeditor = {•},
+title = {Parallel Programming with MPI},
+publisher = {Morgan Kaufmann},
+year = {1996},
+OPTkey = {•},
+OPTvolume = {•},
+OPTnumber = {•},
+OPTseries = {•},
+OPTaddress = {•},
+OPTedition = {•},
+OPTmonth = {•},
+OPTnote = {•},
+OPTannote = {•}
+}
+
+
+@Article{openmp13,
+ title = "OpenMP Application Program Interface",
+ journal = "",
+ volume = "",
+ number = "",
+ pages = "",
+ year = " July 2013",
+ Edition = "4th edition",
+ URL = "http://www.openmp.org/mp-documents/OpenMP4.0.0.pdf.",
+
+}x
+
+
+@Article{Aberth73,
+ title = "Iteration Methods for Finding all Zeros of a Polynomial Simultaneously",
+ journal = "Mathematics of Computation",
+ volume = "27",
+ number = "122",
+ pages = "339--344",
+ year = "1973",
+ author = "O. Aberth",
+
+}x
+
+@Article{Ilie50,
+ title = "On the approximations of Newton",
+ journal = "Annual Sofia Univ",
+ volume = "46",
+ number = "",
+ pages = "167--171",
+ year = "1950",
+ author = "L. Ilieff",
+
+}x
+
+@Article{Docev62,
+ title = "An alternative method of Newton for simultaneous calculation of all the roots of a given algebraic equation",
+ journal = "Phys. Math. J",
+ volume = "5",
+ number = "",
+ pages = "136-139",
+ year = "1962",
+ author = "K. Docev",
+}x
+
+@Book{Durand60,
+ author = "\'E. Durand",
+ publisher = "Masson, Paris",
+ title = "Solutions num\'eriques des \'equations alg\'ebriques.
+ {T}ome {I}: \'{E}quations du type {$F(x)=0$}; racines
+ d'un polyn\^ome",
+ year = "1960",
+}x
+
+@Article{Kerner66,
+ author = "Immo O. Kerner",
+ title = "{Ein Gesamtschrittverfahren zur Berechnung der
+ Nullstellen von Polynomen}. ({German}) [{A} Complete
+ Step Method for the Computation of Zeros of
+ Polynomials]",
+ journal = "Numerische Mathematik",
+ volume = "8",
+ number = "3",
+ pages = "290--294",
+ month = may,
+ year = "1966",
+ CODEN = "NUMMA7",
+ ISSN = "0029-599X (print), 0945-3245 (electronic)",
+ bibdate = "Mon Oct 18 01:28:20 MDT 1999",
+ bibsource = "http://www.math.utah.edu/pub/tex/bib/nummath.bib",
+ acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+ of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+ City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+ 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+ \path|beebe@acm.org|, \path|beebe@computer.org|
+ (Internet), URL:
+ \path|http://www.math.utah.edu/~beebe/|",
+ fjournal = "Numerische Mathematik",
+ journal-url = "http://link.springer.com/journal/211",
+ language = "German",
+}
+
+@Article{Borch-Supan63,
+ author = "W. Boersch-Supan",
+ title = "A Posteriori Error Bounds for the Zeros of
+ Polynomials",
+ journal = "Numerische Mathematik",
+ volume = "5",
+ pages = "380--398",
+ year = "1963",
+ CODEN = "NUMMA7",
+ ISSN = "0029-599X",
+ bibdate = "Fri Jan 12 11:37:56 1996",
+ acknowledgement = "Jon Rokne, Department of Computer Science, The
+ University of Calgary, 2500 University Drive N.W.,
+ Calgary, Alberta T2N 1N4, Canada",
+}
+
+@Article{Ehrlich67,
+ title = "A modified Newton method for polynomials",
+ author = "Louis W. Ehrlich",
+ journal = "Commun. ACM",
+ year = "1967",
+ number = "2",
+ volume = "10",
+ bibdate = "2003-11-20",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/cacm/cacm10.html#Ehrlich67",
+ pages = "107--108",
+ URL = "http://doi.acm.org/10.1145/363067.363115",
+}
+@Article{Loizou83,
+ title = "Higher-order iteration functions for simultaneously approximating polynomial zeros",
+ journal = " Intern. J. Computer Math",
+ volume = "14",
+ number = "1",
+ pages = "45-58",
+ year = "1983",
+ author = "G. Loizou",
+}x
+
+@Article{Freeman89,
+ title = "Calculating polynomial zeros on a local memory
+ parallel computer",
+ author = "T. L. Freeman",
+ journal = "Parallel Computing",
+ year = "1989",
+ number = "3",
+ volume = "12",
+ bibdate = "2011-09-09",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/pc/pc12.html#Freeman89",
+ pages = "351--358",
+ URL = "http://dx.doi.org/10.1016/0167-8191(89)90093-8",
+}
+@Article{Freemanall90,
+ title = " Asynchronous polynomial zero-finding algorithms",
+ journal = " Parallel Computing",
+ volume = "17",
+ number = "",
+ pages = "673-681",
+ year = "1990",
+ author = "T.L. Freeman AND R.K. Brankin",
+}x
+
+@Article{Raphaelall01,
+ title = " Extraction de racines dans des polynômes creux de degrées élevés. {RSRCP} (Réseaux et Systèmes Répartis, Calculateurs Parallèles)",
+ journal = " Algorithmes itératifs paralléles et distribués",
+ volume = "1",
+ number = "13",
+ pages = "67-81",
+ year = "1990",
+ author = "R. Couturier AND F. Spies",
+}x
+
+@Article{Ostrowski41,
+ title = " On a Theorem by {J. L. Walsh} Concerning the Moduli of Roots of Algebraic Equations. A.M.S.",
+ journal = " Algorithmes itératifs paralléles et distribués",
+ volume = "1",
+ number = "47",
+ pages = "742-746",
+ year = "1941",
+ author = "A. Ostrowski",
+}x
+
+
+@Manual{CUDA10,
+title = {Compute Unified Device Architecture Programming Guide Version 3.0},
+OPTkey = {NVIDIA CUDA},
+OPTauthor = {•},
+OPTorganization = {NVIDIA CUDA},
+OPTaddress = {•},
+OPTedition = {•},
+OPTmonth = {March},
+OPTyear = {2010},
+OPTnote = {http://www.nvidia.com/object/cuda_develop.html},
+OPTannote = {•}
+}
+
+@Article{Kahinall14,
+ title = "Parallel implementation of the {D}urand-{K}erner algorithm for polynomial root-finding on {GPU}",
+ journal = "IEEE. Conf. on advanced Networking, Distributed Systems and Applications",
+ volume = "",
+ number = "",
+ pages = "53-57",
+ year = "2014",
+ author = "K. Ghidouche AND R. Couturier AND A. Sider",
+}x
+
+@Article{Karimall98,
+
+ title = " Perfectionnements de la méthode asynchrone de {D}urand-{K}erner pour les polynômes complexes",
+ journal = " Calculateurs Parallèles",
+ volume = "10",
+ number = "4",
+ pages = "449-458",
+ year = "1998",
+ author = "K. Rhofir AND F. Spies AND Jean-Claude Miellou",
+}x
+
+@Article{Bini96,
+ title = "Numerical computation of polynomial zeros by means of
+ Aberth's method",
+ author = "D. Bini",
+ journal = "Numerical Algorithms",
+ year = "1996",
+ number = "2",
+ volume = "13",
+ bibdate = "2015-09-27",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/na/na13.html#Bini96",
+ pages = "179--200",
+ URL = "http://dx.doi.org/10.1007/BF02207694",
+}
+@Article{Mirankar68,
+ title = " Parallel methods for approximating the roots of a function",
+ journal = " IBM Res Dev",
+ volume = "13",
+ number = "",
+ pages = "297-301",
+ year = "1968",
+ author = "WL. Mirankar",
+}x
+
+@Article{Mirankar71,
+ title = " A survey of parallelism in numerical analysis",
+ journal = " SIAM Rev",
+ volume = "13",
+ number = "",
+ pages = "524-547",
+ year = "1971",
+ author = "WL. Mirankar",
+}x
+
+@Article{Schedler72,
+ title = " Parallel Numerical Methods for Solution of Equations",
+ journal = " Commun ACM ",
+ volume = "10",
+ number = "",
+ pages = "286-290",
+ year = "1967",
+ author = "GS. Schedler",
+}x
+
+@InProceedings{Winogard72,
+ title = "Parallel Iteration Methods",
+ author = "S. Winograd",
+ bibdate = "2011-09-13",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/conf/coco/cocc1972.html#Winograd72",
+ booktitle = "Complexity of Computer Computations",
+ publisher = "Plenum Press, New York",
+ year = "1972",
+ editor = "Raymond E. Miller and James W. Thatcher",
+ ISBN = "0-306-30707-3",
+ pages = "53--60",
+ series = "The IBM Research Symposia Series",
+}x
+
+@Article{Benall68,
+ title = " A fast parallel algorithm for determining all roots of a polynomial with real roots",
+ journal = " Int: Proc of ACM",
+ volume = "",
+ number = "",
+ pages = "340-349",
+ year = "1988",
+ author = "M. Ben-Or AND E. Feig AND D. Kozzen AND P. Tiwary",
+}x
+
+@Article{Riceall06,
+ title = " A highly parallel algorithm for root extraction",
+ journal = " IEEE Trans Comp",
+ volume = "38",
+ number = "3",
+ pages = "443-449",
+ year = "2006",
+ author = "TA. Rice AND LH. Jamieson",
+}x
+
+@Article{Cosnard90,
+ title = " Finding the roots of a polynomial on an MIMD multicomputer",
+ journal = " Parallel Comput",
+ volume = "15",
+ number = "3",
+ pages = "75-85",
+ year = "1990",
+ author = "M. Cosnard AND P. Fraigniaud",
+}x
+
+@Article{Janall99,
+ title = " Efficient parallel algorithms for finding polynomial zeroes",
+ journal = "Proc of the 6th int conference on advance computing, CDAC, Pune University Campus,India",
+ volume = "15",
+ number = "3",
+ pages = "189-196",
+ year = "1999",
+ author = "PK. Jana AND BP. Sinha AND R. Datta Gupta",
+}x
+
+@Article{Jana06,
+ title = " Polynomial interpolation and polynomial root finding on OTIS-Mesh",
+ journal = " Parallel Comput",
+ volume = "32",
+ number = "3",
+ pages = "301-312",
+ year = "2006",
+ author = "PK. Jana",
+}x
+
+
+@Book{Kalantari08,
+author = {B. Kalantari},
+title = {Polynomial root finding and polynomiography},
+publisher = {World Scientifict},
+year = {2008},
+OPTkey = {•},
+OPTvolume = {•},
+OPTnumber = {•},
+OPTseries = {•},
+OPTaddress = {•},
+OPTmonth = {December},
+OPTnote = {•},
+OPTannote = {•}
+}
+
+Article{Skachek08,
+ title = " Structured matrix methods for polynomial root finding",
+ journal = " n: Proc of the 2007 Intl symposium on symbolic and algebraic computation",
+ volume = "",
+ number = "",
+ pages = "175-180",
+ year = "2008",
+ author = "V. Skachek",
+}x
+
+
+
+@InProceedings{Gemignani07,
+ author = "L. Gemignani",
+ title = "Structured matrix methods for polynomial
+ root-finding",
+ editor = "C. W. Brown",
+ booktitle = "Proceedings of the 2007 International Symposium on
+ Symbolic and Algebraic Computation, July 29--August 1,
+ 2007, University of Waterloo, Waterloo, Ontario,
+ Canada",
+ publisher = "ACM Press",
+ address = "pub-ACM:adr",
+ ISBN = "1-59593-743-9 (print), 1-59593-742-0 (CD-ROM)",
+ isbn-13 = "978-1-59593-743-8 (print), 978-1-59593-742-1
+ (CD-ROM)",
+ pages = "175--180",
+ year = "2007",
+ doi = "http://doi.acm.org/10.1145/1277548.1277573",
+ bibdate = "Fri Jun 20 08:46:50 MDT 2008",
+ bibsource = "http://portal.acm.org/;
+ http://www.math.utah.edu/pub/tex/bib/issac.bib",
+ abstract = "In this paper we discuss the use of structured matrix
+ methods for the numerical approximation of the zeros of
+ a univariate polynomial. In particular, it is shown
+ that root-finding algorithms based on floating-point
+ eigenvalue computation can benefit from the structure
+ of the matrix problem to reduce their complexity and
+ memory requirements by an order of magnitude.",
+ acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+ of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+ City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+ 801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+ \path|beebe@acm.org|, \path|beebe@computer.org|
+ (Internet), URL:
+ \path|http://www.math.utah.edu/~beebe/|",
+ keywords = "complexity; eigenvalue computation; polynomial
+ root-finding; rank-structured matrices",
+ doi-url = "http://dx.doi.org/10.1145/1277548.1277573",
+}
+
+@Article{Skachek008,
+ title = "Probabilistic algorithm for finding roots of
+ linearized polynomials",
+ author = "V. Skachek AND M. Roth",
+ journal = "Des. Codes Cryptography",
+ year = "2008",
+ number = "1",
+ volume = "46",
+ bibdate = "2008-03-11",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/journals/dcc/dcc46.html#SkachekR08",
+ pages = "17--23",
+ URL = "http://dx.doi.org/10.1007/s10623-007-9125-y",
+}
+
+@Article{Zhancall08,
+ title = " A constrained learning algorithm for finding multiple real roots of polynomial",
+ journal = " In: Proc of the 2008 intl symposium on computational intelligence and design",
+ volume = "",
+ number = "",
+ pages = "38-41",
+ year = "2008",
+ author = "X. Zhanc AND M. Wan,Z.Yi",
+}x
+
+
+@InProceedings{Zhuall08,
+ title = "An Adaptive Algorithm Finding Multiple Roots of Polynomials",
+ author = "W. Zhu AND Z. Zeng AND Dm. Lin",
+ bibdate = "2008-09-25",
+ bibsource = "DBLP,
+ http://dblp.uni-trier.de/db/conf/isnn/isnn2008-2.html#ZhuZL08",
+ booktitle = "ISNN (2)",
+ publisher = "Springer",
+ year = "2008",
+ volume = "5264",
+ editor = "Fuchun Sun and Jianwei Zhang 0001 and Ying Tan and
+ Jinde Cao and Wen Yu 0001",
+ ISBN = "978-3-540-87733-2",
+ pages = "674--681",
+ series = "Lecture Notes in Computer Science",
+ URL = "http://dx.doi.org/10.1007/978-3-540-87734-9_77",
+}
+
+@Article{Azad07,
+ title = " The performance of synchronous parallel polynomial root extraction on a ring multicomputer",
+ journal = " Clust Comput ",
+ volume = "2",
+ number = "10",
+ pages = "167-174",
+ year = "2007",
+ author = "HS. Azad",
+}x
+
+
+
+
+@Article{Bini04,
+ title = " Inverse power and Durand Kerner iterations for univariate polynomial root finding",
+ journal = " Comput Math Appl ",
+ volume = "47",
+ number = "",
+ pages = "447-459",
+ year = "2004",
+ author = "DA. Bini AND L. Gemignani",
+}x
+
+@Article{Jana99,
+ title = " Finding polynomial zeroes on a Multi-mesh of trees (MMT)",
+ journal = " In: Proc of the 2nd int conference on information technology",
+ volume = "",
+ number = "",
+ pages = "202-206",
+ year = "1999",
+ author = "PK. Jana",
+}x
+
+@Article{Weierstrass03,
+ title = " Neuer Beweis des Satzes, dass jede ganze rationale function einer veranderlichen dagestellt werden kann als ein product aus linearen functionen derselben veranderlichen",
+ journal = " Ges. Werke",
+ volume = "3",
+ number = "",
+ pages = "251-269",
+ year = "1903",
+ author = "K. Weierstrass",
+}x
+@Manual{NVIDIA10,
+title = {NVIDIA CUDA C Programming Guide},
+OPTkey = {•},
+OPTauthor = {NVIDIA Corporation},
+OPTorganization = {Design Guide},
+OPTaddress = {•},
+OPTedition = {•},
+OPTmonth = {march},
+OPTyear = {2015},
+OPTnote = {•},
+OPTannote = {•}
+}
+
+
+
