From 008d0a26999771634442ea4b157a81175b0bbeec Mon Sep 17 00:00:00 2001
From: Tim Daly
Date: Sun, 26 Jun 2016 07:57:17 0400
Subject: [PATCH] books/bookvolbib Axiom Citations in the Literature
MIMEVersion: 1.0
ContentType: text/plain; charset=UTF8
ContentTransferEncoding: 8bit
Goal: Axiom Literate Programming
\index{Gottlieben, Hanne}
\index{Kelsey, Tom}
\index{Martin, Ursula}
\begin{chunk}{axiom.bib}
@article{Gott05,
author = "Gottliebsen, Hanne and Kelsey, Tom and Martin, Ursula",
title = "Hidden verification for computational mathematics",
journal = "Journal of Symbolic Computation",
volume = "39",
number = "5",
pages = "539567",
year = "2005",
url = "http://www.sciencedirect.com/science/article/pii/S0747717105000295",
paper = "Gott05.pdf",
keywords = "axiomref",
abstract =
"We present hidden verification as a means to make the power of
computational logic available to users of computer algebra systems
while shielding them from its complexity. We have implemented in PVS a
library of facts about elementary and transcendental function, and
automatic procedures to attempt proofs of continuity, convergence and
differentiability for functions in this class. These are called
directly from Maple by a simple pipelined interface. Hence we are
able to support the analysis of differential equations in Maple by
direct calls to PVS for: result refinement and verification, discharge
of verification conditions, harnesses to ensure more reliable
differential equation solvers, and verifiable lookup tables."
}
\end{chunk}
\index{Kaplan, Michael}
\begin{chunk}{axiom.bib}
@book{Kapl05,
author = "Kaplan, Michael",
title = "Computer Algebra",
publisher = "Springer, Berlin, Germany",
year = "2005",
isbn = "3540213791",
keywords = "axiomref",
comment = "German Language"
}
\end{chunk}
\index{Oancea, Cosmin E.}
\index{Watt, Stephen M.}
\begin{chunk}{axiom.bib}
@InProceedings{Oanc05,
author = "Oancea, Cosmin E. and Watt, Stephen M.",
title = "Domains and expressions: an interface between two approaches to
computer algebra",
booktitle = "Proc. 2005 ISSAC",
series = "ISSAC 2005",
year = "2005",
isbn = "1595930957",
location = "Beijing, China",
pages = "261268",
keywords = "axiomref",
paper = "Oanc05.pdf",
url = "http://www.csd.uwo.ca/~watt/pub/reprints/2005issacalma.pdf",
abstract =
"This paper describes a method to use compiled, strongly typed Aldor
domains in the interpreted, expressionoriented Maple
environment. This represents a nontraditional approach to structuring
computer algebra software: using an efficient, compiled language,
designed for writing large complex mathematical libraries, together
with a toplevel system based on userinterface priorities and ease of
scripting.
We examine what is required to use Aldor libraries to extend Maple in
an effective and natural way. Since the computational models of Maple
and Aldor differ significantly, new runtime code must implement a
nontrivial semantic correspondence. Our solution allows Aldor
functions to run tightly coupled to the Maple environment, able to
directly and efficiently manipulate Maple data objects. We call the
overall system Alma."
}
\end{chunk}
\index{Brunelli, J.C.}
\begin{chunk}{axiom.bib}
\article{Brun04,
author = "Brunelli, J.C.",
title = "PSEUDO: applications of streams and lazy evaluation to integrable
models",
journal = "Comput. Phys. Commun.",
volume = "163",
number = "1",
pages = "2240",
year = "2004",
keywords = "axiomref",
url =
paper =
abstract =
"Procedures to manipulate pseudodifferential operators in MAPLE are
implemented in the program PSEUDO to perform calculations with
integrable models. We use lazy evaluation and streams to represent and
operate with pseudodifferential operators. No order of truncation is
needed since terms are produced on demand. We give a series of
concrete examples."
}
\end{chunk}
\index{Emiris, Ioannis Z.}
\index{Tsigaridas, Elias P.}
\begin{chunk}{axiom.bib}
@InProceedings{Emir04,
author = "Emiris, Ioannis Z. and Tsigaridas, Elias P.",
title = "Comparing real algebraic numbers of small degree",
booktitle = "12th annual European symposium",
series = "ESA 2004",
year = "2004",
isbn = "3540230254",
location = "Bergen, Norway",
pages = "652663",
keywords = "axiomref",
paper = "Emir04.pdf",
url = "http://wwwpolsys.lip6.fr/~elias/files//etesa04.pdf",
comment = "\newline\refto{domain RECLOS RealClosure}",
abstract =
"We study polynomials of degree up to 4 over the rationals or a
computable real subfield. Our motivation comes from the need to
evaluate predicates in nonlinear computational geometry efficiently
and exactly. We show a new method to compare real algebraic numbers by
precomputing generalized Sturm sequences, thus avoiding iterative
methods; the method, moreover handles all degenerate cases. Our first
contribution is the determination of rational isolating points, as
functions of the coefficients, between any pair of real roots. Our
second contribution is to exploit invariants and Bezoutian
subexpressions in writing the sequences, in order to reduce bit
complexity. The degree of the tested quantities in the input
coefficients is optimal for degree up to 3, and for degree 4 in
certain cases. Our methods readily apply to real solving of pairs of
quadratic equations, and to sign determination of polynomials over
algebraic numbers of degree up to 4. Our third contribution is an
implementation in a new module of library SYNAPS v2.1. It improves
significantly upon the efficiency of certain publicly available
implementations: Rioboo’s approach on AXIOM, the package of
GuibasKaravelasRussel, and CORE v1.6, MAPLE v9, and SYNAPS
v2.0. Some existing limited tests had shown that it is faster than
commercial library LEDA v4.5 for quadratic algebraic numbers."
}
\end{chunk}
\index{Rioboo, Renaud}
\begin{chunk}{axiom.bib}
@InProceedings{Riob92,
author = "Rioboo, Renaud",
title = "Real algebraic closure of an ordered field,
Implementation in Axiom",
booktitle = "Proc. ISSAC 92",
series = "ISSAC 92",
year = "1992",
isbn = "9783540751861",
location = "Berkeley, California",
pages = "206215",
isbn = "0897914899 (soft), 0897914902 (hard)",
paper = "Riob92.pdf",
keywords = "axiomref",
comment = "\newline\refto{domain RECLOS RealClosure}",
abstract = "
Real algebraic numbers appear in many Computer Algebra problems. For
instance the determination of a cylindrical algebraic decomposition
for an euclidean space requires computing with real algebraic numbers.
This paper describes an implementation for computations with the real
roots of a polynomial. This process is designed to be recursively
used, so the resulting domain of computation is the set of all real
algebraic numbers. An implementation for the real algebraic closure
has been done in Axiom (previously called Scratchpad)."
}
\end{chunk}
\index{Hivert, Florent}
\index{Thiery, Nicolas M.}
\begin{chunk}{axiom.bib}
@article{Hive04,
author = "Hivert, Florent and Thiery, Nicolas M.",
title = "MuPADCombinat, an opensource package for research in
algebraic combinatorics",
journal = "Seminaire Lotharingien de Combinatoire",
volume = "51",
number = "B51z",
year = "2004",
keywords = "axiomref",
url = "http://www.emis.de/journals/SLC/wpapers/s51thiery.pdf",
paper = "Hive04.pdf",
abstract =
"In this article we give an overview of the MuPADCombinat opensource
algebraic combinatorics package for the computer algebra system MuPAD
2.0.0 and higher. This includes our motivations for developing yet
another combinatorial software, a tutorial introduction with lots of
examples, as well as notes on the general design. The material
presented here is also available as a part of the MuPADCombinat
handbook; further details and references on the algorithms used can be
found there. The package and the handbook are available from the web
page, together with download and installation instructions, mailing
lists, etc."
}
\end{chunk}
\index{Hemmecke, Ralf}
\index{Rubey, Martin}
\begin{chunk}{axiom.bib}
@misc{RISC06,
title = "AXIOM Workshop 2006",
url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2006",
year = "2006",
location = "Hagenberg, Austria",
keywords = "axiomref",
abstract =
"Axiom is a computer algebra system with a long tradition. It recently
became free software.
The workshop aims at a cooperation of Axiom developers with developers
of packages written for other Computer Algebra Systems or developers
of standalone packages. Furthermore, the workshop wants to make the
potential of Axiom and Aldor more widely known in order to attract new
users and new developers."
}
\end{chunk}
\index{Hemmecke, Ralf}
\index{Rubey, Martin}
\begin{chunk}{axiom.bib}
@misc{RISC07,
title = "AXIOM Workshop 2007",
url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2007",
year = "2007",
location = "Hagenberg, Austria",
keywords = "axiomref",
abstract =
"The workshop aims at a cooperation of Axiom developers with deelopers
of packages written for other Computer Algebra Systems, and
mathematicians that would like to use a computer algebra system to
perform experiments.
One goal of the workshop is to learn about the mathematical theory,
the design of packages written for other CAS and to make those
functionalities available in Axiom."
}
\end{chunk}

books/bookvolbib.pamphlet  319 +++++++++++++++++++++++++++++
changelog  2 +
patch  252 +++++++++++++++++++++++++++++++
src/axiomwebsite/patches.html  2 +
4 files changed, 492 insertions(+), 83 deletions()
diff git a/books/bookvolbib.pamphlet b/books/bookvolbib.pamphlet
index 65207c4..c587ea9 100644
 a/books/bookvolbib.pamphlet
+++ b/books/bookvolbib.pamphlet
@@ 1037,7 +1037,7 @@ when shown in factored form.
\index{polynomial factoring in many variables}
\index{Diaz, Angel}
\index{Emiris, I.}
+\index{Emiris, Ioannis Z.}
\index{Kaltofen, Erich}
\index{Pan, Victor}
\begin{chunk}{axiom.bib}
@@ 3917,6 +3917,37 @@ Kelsey, Tom; Martin, Ursula; Owre, Sam
\end{chunk}
+\index{Gottlieben, Hanne}
+\index{Kelsey, Tom}
+\index{Martin, Ursula}
+\begin{chunk}{axiom.bib}
+@article{Gott05,
+ author = "Gottliebsen, Hanne and Kelsey, Tom and Martin, Ursula",
+ title = "Hidden verification for computational mathematics",
+ journal = "Journal of Symbolic Computation",
+ volume = "39",
+ number = "5",
+ pages = "539567",
+ year = "2005",
+ url = "http://www.sciencedirect.com/science/article/pii/S0747717105000295",
+ paper = "Gott05.pdf",
+ keywords = "axiomref",
+ abstract =
+ "We present hidden verification as a means to make the power of
+ computational logic available to users of computer algebra systems
+ while shielding them from its complexity. We have implemented in PVS a
+ library of facts about elementary and transcendental function, and
+ automatic procedures to attempt proofs of continuity, convergence and
+ differentiability for functions in this class. These are called
+ directly from Maple by a simple pipelined interface. Hence we are
+ able to support the analysis of differential equations in Maple by
+ direct calls to PVS for: result refinement and verification, discharge
+ of verification conditions, harnesses to ensure more reliable
+ differential equation solvers, and verifiable lookup tables."
+}
+
+\end{chunk}
+
\index{Jackson, Paul Bernard}
\begin{chunk}{axiom.bib}
@phdthesis{Jack95,
@@ 9443,6 +9474,48 @@ J. Symbolic Computation 5, 237259 (1988)
\end{chunk}
+\index{Emiris, Ioannis Z.}
+\index{Tsigaridas, Elias P.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Emir04,
+ author = "Emiris, Ioannis Z. and Tsigaridas, Elias P.",
+ title = "Comparing real algebraic numbers of small degree",
+ booktitle = "12th annual European symposium",
+ series = "ESA 2004",
+ year = "2004",
+ isbn = "3540230254",
+ location = "Bergen, Norway",
+ pages = "652663",
+ keywords = "axiomref",
+ paper = "Emir04.pdf",
+ url = "http://wwwpolsys.lip6.fr/~elias/files//etesa04.pdf",
+ comment = "\newline\refto{domain RECLOS RealClosure}",
+ abstract =
+ "We study polynomials of degree up to 4 over the rationals or a
+ computable real subfield. Our motivation comes from the need to
+ evaluate predicates in nonlinear computational geometry efficiently
+ and exactly. We show a new method to compare real algebraic numbers by
+ precomputing generalized Sturm sequences, thus avoiding iterative
+ methods; the method, moreover handles all degenerate cases. Our first
+ contribution is the determination of rational isolating points, as
+ functions of the coefficients, between any pair of real roots. Our
+ second contribution is to exploit invariants and Bezoutian
+ subexpressions in writing the sequences, in order to reduce bit
+ complexity. The degree of the tested quantities in the input
+ coefficients is optimal for degree up to 3, and for degree 4 in
+ certain cases. Our methods readily apply to real solving of pairs of
+ quadratic equations, and to sign determination of polynomials over
+ algebraic numbers of degree up to 4. Our third contribution is an
+ implementation in a new module of library SYNAPS v2.1. It improves
+ significantly upon the efficiency of certain publicly available
+ implementations: Rioboo’s approach on AXIOM, the package of
+ GuibasKaravelasRussel, and CORE v1.6, MAPLE v9, and SYNAPS
+ v2.0. Some existing limited tests had shown that it is faster than
+ commercial library LEDA v4.5 for quadratic algebraic numbers."
+}
+
+\end{chunk}
+
\index{England, Matthew}
\index{Bradford, Russell}
\index{Davenport, James H.}
@@ 9528,13 +9601,21 @@ J. Symbolic Computation 5, 237259 (1988)
\end{chunk}
\index{Rioboo, Renaud}
\begin{chunk}{ignore}
\bibitem[Rioboo 92]{Rio92} Rioboo, R.
 title = "Real algebraic closure of an ordered field, implementation in Axiom",
In Wang [Wan92], pp206215 ISBN 0897914899 (soft cover)
0897914902 (hard cover) LCCN QA76.95.I59 1992
 paper = "Rio92.pdf",
+\begin{chunk}{axiom.bib}
+@InProceedings{Riob92,
+ author = "Rioboo, Renaud",
+ title = "Real algebraic closure of an ordered field,
+ Implementation in Axiom",
+ booktitle = "Proc. ISSAC 92",
+ series = "ISSAC 92",
+ year = "1992",
+ isbn = "9783540751861",
+ location = "Berkeley, California",
+ pages = "206215",
+ isbn = "0897914899 (soft), 0897914902 (hard)",
+ paper = "Riob92.pdf",
keywords = "axiomref",
+ comment = "\newline\refto{domain RECLOS RealClosure}",
abstract = "
Real algebraic numbers appear in many Computer Algebra problems. For
instance the determination of a cylindrical algebraic decomposition
@@ 9544,6 +9625,7 @@ In Wang [Wan92], pp206215 ISBN 0897914899 (soft cover)
used, so the resulting domain of computation is the set of all real
algebraic numbers. An implementation for the real algebraic closure
has been done in Axiom (previously called Scratchpad)."
+}
\end{chunk}
@@ 10725,6 +10807,31 @@ Soc. for Industrial and Applied Mathematics, Philadelphia (1990)
\end{chunk}
+\index{Brunelli, J.C.}
+\begin{chunk}{axiom.bib}
+\article{Brun04,
+ author = "Brunelli, J.C.",
+ title = "PSEUDO: applications of streams and lazy evaluation to integrable
+ models",
+ journal = "Comput. Phys. Commun.",
+ volume = "163",
+ number = "1",
+ pages = "2240",
+ year = "2004",
+ keywords = "axiomref",
+ url =
+ paper =
+ abstract =
+ "Procedures to manipulate pseudodifferential operators in MAPLE are
+ implemented in the program PSEUDO to perform calculations with
+ integrable models. We use lazy evaluation and streams to represent and
+ operate with pseudodifferential operators. No order of truncation is
+ needed since terms are produced on demand. We give a series of
+ concrete examples."
+}
+
+\end{chunk}
+
\index{Boehm, HansJ.}
\begin{chunk}{axiom.bib}
@inproceedings{Boe89,
@@ 12714,32 +12821,6 @@ In Fitch [Fit93], pp193202. ISBN 0387572724 (New York),
\end{chunk}
\index{Gottlieben, Hanne}
\index{Kelsey, Tom}
\index{Martin, Ursula}
\begin{chunk}{ignore}
\bibitem[Gottliebsen 05]{GKM05} Gottliebsen, Hanne; Kelsey, Tom;
Martin, Ursula
 title = "Hidden verification for computational mathematics",
Journal of Symbolic Computation, Vol39, Num 5, pp539567 (2005)
 url = "http://www.sciencedirect.com/science/article/pii/S0747717105000295",
 paper = "GKM05.pdf",
 keywords = "axiomref",
 abstract = "
 We present hidden verification as a means to make the power of
 computational logic available to users of computer algebra systems
 while shielding them from its complexity. We have implemented in PVS a
 library of facts about elementary and transcendental function, and
 automatic procedures to attempt proofs of continuity, convergence and
 differentiability for functions in this class. These are called
 directly from Maple by a simple pipelined interface. Hence we are
 able to support the analysis of differential equations in Maple by
 direct calls to PVS for: result refinement and verification, discharge
 of verification conditions, harnesses to ensure more reliable
 differential equation solvers, and verifiable lookup tables."

\end{chunk}

\index{Gr\"abe, HansGert}
\begin{chunk}{ignore}
\bibitem[Grabe 98]{Gra98} Gr\"abe, HansGert
@@ 12955,6 +13036,50 @@ Vol. 8 No. 3 pp195210 (2001)
\end{chunk}
+\index{Hemmecke, Ralf}
+\index{Rubey, Martin}
+\begin{chunk}{axiom.bib}
+@misc{RISC06,
+ title = "AXIOM Workshop 2006",
+ url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2006",
+ year = "2006",
+ location = "Hagenberg, Austria",
+ keywords = "axiomref",
+ abstract =
+ "Axiom is a computer algebra system with a long tradition. It recently
+ became free software.
+
+ The workshop aims at a cooperation of Axiom developers with developers
+ of packages written for other Computer Algebra Systems or developers
+ of standalone packages. Furthermore, the workshop wants to make the
+ potential of Axiom and Aldor more widely known in order to attract new
+ users and new developers."
+}
+
+\end{chunk}
+
+\index{Hemmecke, Ralf}
+\index{Rubey, Martin}
+\begin{chunk}{axiom.bib}
+@misc{RISC07,
+ title = "AXIOM Workshop 2007",
+ url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2007",
+ year = "2007",
+ location = "Hagenberg, Austria",
+ keywords = "axiomref",
+ abstract =
+ "The workshop aims at a cooperation of Axiom developers with deelopers
+ of packages written for other Computer Algebra Systems, and
+ mathematicians that would like to use a computer algebra system to
+ perform experiments.
+
+ One goal of the workshop is to learn about the mathematical theory,
+ the design of packages written for other CAS and to make those
+ functionalities available in Axiom."
+}
+
+\end{chunk}
+
\index{Heras, Jonathan}
\index{MartinMateos, Franciso Jesus}
\index{Pascual, Vico}
@@ 13033,6 +13158,35 @@ Vol. 8 No. 3 pp195210 (2001)
\end{chunk}
+\index{Hivert, Florent}
+\index{Thiery, Nicolas M.}
+\begin{chunk}{axiom.bib}
+@article{Hive04,
+ author = "Hivert, Florent and Thiery, Nicolas M.",
+ title = "MuPADCombinat, an opensource package for research in
+ algebraic combinatorics",
+ journal = "Seminaire Lotharingien de Combinatoire",
+ volume = "51",
+ number = "B51z",
+ year = "2004",
+ keywords = "axiomref",
+ url = "http://www.emis.de/journals/SLC/wpapers/s51thiery.pdf",
+ paper = "Hive04.pdf",
+ abstract =
+ "In this article we give an overview of the MuPADCombinat opensource
+ algebraic combinatorics package for the computer algebra system MuPAD
+ 2.0.0 and higher. This includes our motivations for developing yet
+ another combinatorial software, a tutorial introduction with lots of
+ examples, as well as notes on the general design. The material
+ presented here is also available as a part of the MuPADCombinat
+ handbook; further details and references on the algorithms used can be
+ found there. The package and the handbook are available from the web
+ page, together with download and installation instructions, mailing
+ lists, etc."
+}
+
+\end{chunk}
+
\index{Hoarau, Emma}
\index{David, Claire}
\begin{chunk}{axiom.bib}
@@ 13502,6 +13656,20 @@ SIGSAM Communications in Computer Algebra, 157 2006
\subsection{K} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\index{Kaplan, Michael}
+\begin{chunk}{axiom.bib}
+@book{Kapl05,
+ author = "Kaplan, Michael",
+ title = "Computer Algebra",
+ publisher = "Springer, Berlin, Germany",
+ year = "2005",
+ isbn = "3540213791",
+ keywords = "axiomref",
+ comment = "German Language"
+}
+
+\end{chunk}
+
\index{Kauers, Manuel}
\begin{chunk}{ignore}
\bibitem[Kauers 08]{Kau08} Kauers, Manuel
@@ 14589,6 +14757,42 @@ IBM T.J. Watson Research RC4998
\subsection{O} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+\index{Oancea, Cosmin E.}
+\index{Watt, Stephen M.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Oanc05,
+ author = "Oancea, Cosmin E. and Watt, Stephen M.",
+ title = "Domains and expressions: an interface between two approaches to
+ computer algebra",
+ booktitle = "Proc. 2005 ISSAC",
+ series = "ISSAC 2005",
+ year = "2005",
+ isbn = "1595930957",
+ location = "Beijing, China",
+ pages = "261268",
+ keywords = "axiomref",
+ paper = "Oanc05.pdf",
+ url = "http://www.csd.uwo.ca/~watt/pub/reprints/2005issacalma.pdf",
+ abstract =
+ "This paper describes a method to use compiled, strongly typed Aldor
+ domains in the interpreted, expressionoriented Maple
+ environment. This represents a nontraditional approach to structuring
+ computer algebra software: using an efficient, compiled language,
+ designed for writing large complex mathematical libraries, together
+ with a toplevel system based on userinterface priorities and ease of
+ scripting.
+
+ We examine what is required to use Aldor libraries to extend Maple in
+ an effective and natural way. Since the computational models of Maple
+ and Aldor differ significantly, new runtime code must implement a
+ nontrivial semantic correspondence. Our solution allows Aldor
+ functions to run tightly coupled to the Maple environment, able to
+ directly and efficiently manipulate Maple data objects. We call the
+ overall system Alma."
+}
+
+\end{chunk}
+
\begin{chunk}{axiom.bib}
@misc{ORMS,
author = "Unknown",
@@ 20390,55 +20594,6 @@ Math. Tables Aids Comput. 10 9196. (1956)
\end{chunk}
\index{Thiery, Nicolas M.}
\begin{chunk}{axiom.bib}
@misc{Thie15,
 author = "Thiery, Nicolas M.",
 title = "Open Digital Research Environment Toolkit for the Advancement of Mathematics",
 year = "2015",
 url = "http://opendreamkit.org",
 paper = "Thie15.pdf",
 abstract =
 "OpenDreamKit will deliver a flexible toolkit enabling research groups
 to set up Virtual Research Environments, customised to meet the varied
 needs of research projects in pure mathematics and applications, and
 supporting the full research lifecycle from exploration, through
 proof and publication, to archival and sharing of data and code.

 OpenDreamKit will be built out of a sustainable ecosystem of
 communitydeveloped open software, databases, and ser vices,
 including popular tools such as LINBOX, MPIR, SAGE (sagemath.org),
 GAP, PARI/GP, LMFDB, and SINGULAR. We will extend the JUPYTER Notebook
 environment to provide a flexible user interface. By improving and
 unifying existing build ing blocks, OpenDreamKit will maximise both
 sustainability and impact, with beneficiaries extending to scientific
 computing, physics, chemistry, biology and more, and including
 researchers, teachers, and industrial practitioners.

 We will define a novel componentbased VRE architecture and adapt
 existing mathematical software, databases, and user interface
 components to work well within it on varied platforms. Interfaces to
 standard HPC and grid services will be built in. Our architecture will
 be informed by recent research into the sociology of mathematical
 collaboration, so as to properly support actual research practice. The
 ease of set up, adaptability and global impact will be demonstrated in
 a variety of demonstrator VREs.

 We will ourselves study the social challenges associated with
 largescale open source code development and publications based on
 executable documents, to ensure sustainability.

 OpenDreamKit will be conducted by a Europewide steered by demand
 collaboration, including leading mathematicians, computational
 researchers, and software developers with a long track record of
 delivering innovative open source software solutions for their
 respective communities. All produced code and tools will be open
 source."
}

\end{chunk}

\eject
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\cleardoublepage
\phantomsection
diff git a/changelog b/changelog
index 80454d5..2bb2dc8 100644
 a/changelog
+++ b/changelog
@@ 1,3 +1,5 @@
+20160626 tpd src/axiomwebsite/patches.html 20160625.01.tpd.patch
+20160626 tpd books/bookvolbib Axiom Citations in the Literature
20160625 tpd src/axiomwebsite/patches.html 20160625.08.tpd.patch
20160625 tpd books/bookvol10.4 add Rube06, Hebi10 GUESS references
20160625 tpd src/axiomwebsite/patches.html 20160625.07.tpd.patch
diff git a/patch b/patch
index b646beb..ce40e2a 100644
 a/patch
+++ b/patch
@@ 1,4 +1,254 @@
books/bookvol10.4 add Rube06, Hebi10 GUESS references
+books/bookvolbib Axiom Citations in the Literature
Goal: Axiom Literate Programming
+\index{Gottlieben, Hanne}
+\index{Kelsey, Tom}
+\index{Martin, Ursula}
+\begin{chunk}{axiom.bib}
+@article{Gott05,
+ author = "Gottliebsen, Hanne and Kelsey, Tom and Martin, Ursula",
+ title = "Hidden verification for computational mathematics",
+ journal = "Journal of Symbolic Computation",
+ volume = "39",
+ number = "5",
+ pages = "539567",
+ year = "2005",
+ url = "http://www.sciencedirect.com/science/article/pii/S0747717105000295",
+ paper = "Gott05.pdf",
+ keywords = "axiomref",
+ abstract =
+ "We present hidden verification as a means to make the power of
+ computational logic available to users of computer algebra systems
+ while shielding them from its complexity. We have implemented in PVS a
+ library of facts about elementary and transcendental function, and
+ automatic procedures to attempt proofs of continuity, convergence and
+ differentiability for functions in this class. These are called
+ directly from Maple by a simple pipelined interface. Hence we are
+ able to support the analysis of differential equations in Maple by
+ direct calls to PVS for: result refinement and verification, discharge
+ of verification conditions, harnesses to ensure more reliable
+ differential equation solvers, and verifiable lookup tables."
+}
+
+\end{chunk}
+
+\index{Kaplan, Michael}
+\begin{chunk}{axiom.bib}
+@book{Kapl05,
+ author = "Kaplan, Michael",
+ title = "Computer Algebra",
+ publisher = "Springer, Berlin, Germany",
+ year = "2005",
+ isbn = "3540213791",
+ keywords = "axiomref",
+ comment = "German Language"
+}
+
+\end{chunk}
+
+\index{Oancea, Cosmin E.}
+\index{Watt, Stephen M.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Oanc05,
+ author = "Oancea, Cosmin E. and Watt, Stephen M.",
+ title = "Domains and expressions: an interface between two approaches to
+ computer algebra",
+ booktitle = "Proc. 2005 ISSAC",
+ series = "ISSAC 2005",
+ year = "2005",
+ isbn = "1595930957",
+ location = "Beijing, China",
+ pages = "261268",
+ keywords = "axiomref",
+ paper = "Oanc05.pdf",
+ url = "http://www.csd.uwo.ca/~watt/pub/reprints/2005issacalma.pdf",
+ abstract =
+ "This paper describes a method to use compiled, strongly typed Aldor
+ domains in the interpreted, expressionoriented Maple
+ environment. This represents a nontraditional approach to structuring
+ computer algebra software: using an efficient, compiled language,
+ designed for writing large complex mathematical libraries, together
+ with a toplevel system based on userinterface priorities and ease of
+ scripting.
+
+ We examine what is required to use Aldor libraries to extend Maple in
+ an effective and natural way. Since the computational models of Maple
+ and Aldor differ significantly, new runtime code must implement a
+ nontrivial semantic correspondence. Our solution allows Aldor
+ functions to run tightly coupled to the Maple environment, able to
+ directly and efficiently manipulate Maple data objects. We call the
+ overall system Alma."
+}
+
+\end{chunk}
+
+\index{Brunelli, J.C.}
+\begin{chunk}{axiom.bib}
+\article{Brun04,
+ author = "Brunelli, J.C.",
+ title = "PSEUDO: applications of streams and lazy evaluation to integrable
+ models",
+ journal = "Comput. Phys. Commun.",
+ volume = "163",
+ number = "1",
+ pages = "2240",
+ year = "2004",
+ keywords = "axiomref",
+ url =
+ paper =
+ abstract =
+ "Procedures to manipulate pseudodifferential operators in MAPLE are
+ implemented in the program PSEUDO to perform calculations with
+ integrable models. We use lazy evaluation and streams to represent and
+ operate with pseudodifferential operators. No order of truncation is
+ needed since terms are produced on demand. We give a series of
+ concrete examples."
+}
+
+\end{chunk}
+
+\index{Emiris, Ioannis Z.}
+\index{Tsigaridas, Elias P.}
+\begin{chunk}{axiom.bib}
+@InProceedings{Emir04,
+ author = "Emiris, Ioannis Z. and Tsigaridas, Elias P.",
+ title = "Comparing real algebraic numbers of small degree",
+ booktitle = "12th annual European symposium",
+ series = "ESA 2004",
+ year = "2004",
+ isbn = "3540230254",
+ location = "Bergen, Norway",
+ pages = "652663",
+ keywords = "axiomref",
+ paper = "Emir04.pdf",
+ url = "http://wwwpolsys.lip6.fr/~elias/files//etesa04.pdf",
+ comment = "\newline\refto{domain RECLOS RealClosure}",
+ abstract =
+ "We study polynomials of degree up to 4 over the rationals or a
+ computable real subfield. Our motivation comes from the need to
+ evaluate predicates in nonlinear computational geometry efficiently
+ and exactly. We show a new method to compare real algebraic numbers by
+ precomputing generalized Sturm sequences, thus avoiding iterative
+ methods; the method, moreover handles all degenerate cases. Our first
+ contribution is the determination of rational isolating points, as
+ functions of the coefficients, between any pair of real roots. Our
+ second contribution is to exploit invariants and Bezoutian
+ subexpressions in writing the sequences, in order to reduce bit
+ complexity. The degree of the tested quantities in the input
+ coefficients is optimal for degree up to 3, and for degree 4 in
+ certain cases. Our methods readily apply to real solving of pairs of
+ quadratic equations, and to sign determination of polynomials over
+ algebraic numbers of degree up to 4. Our third contribution is an
+ implementation in a new module of library SYNAPS v2.1. It improves
+ significantly upon the efficiency of certain publicly available
+ implementations: Rioboo’s approach on AXIOM, the package of
+ GuibasKaravelasRussel, and CORE v1.6, MAPLE v9, and SYNAPS
+ v2.0. Some existing limited tests had shown that it is faster than
+ commercial library LEDA v4.5 for quadratic algebraic numbers."
+}
+
+\end{chunk}
+
+\index{Rioboo, Renaud}
+\begin{chunk}{axiom.bib}
+@InProceedings{Riob92,
+ author = "Rioboo, Renaud",
+ title = "Real algebraic closure of an ordered field,
+ Implementation in Axiom",
+ booktitle = "Proc. ISSAC 92",
+ series = "ISSAC 92",
+ year = "1992",
+ isbn = "9783540751861",
+ location = "Berkeley, California",
+ pages = "206215",
+ isbn = "0897914899 (soft), 0897914902 (hard)",
+ paper = "Riob92.pdf",
+ keywords = "axiomref",
+ comment = "\newline\refto{domain RECLOS RealClosure}",
+ abstract = "
+ Real algebraic numbers appear in many Computer Algebra problems. For
+ instance the determination of a cylindrical algebraic decomposition
+ for an euclidean space requires computing with real algebraic numbers.
+ This paper describes an implementation for computations with the real
+ roots of a polynomial. This process is designed to be recursively
+ used, so the resulting domain of computation is the set of all real
+ algebraic numbers. An implementation for the real algebraic closure
+ has been done in Axiom (previously called Scratchpad)."
+}
+
+\end{chunk}
+
+\index{Hivert, Florent}
+\index{Thiery, Nicolas M.}
+\begin{chunk}{axiom.bib}
+@article{Hive04,
+ author = "Hivert, Florent and Thiery, Nicolas M.",
+ title = "MuPADCombinat, an opensource package for research in
+ algebraic combinatorics",
+ journal = "Seminaire Lotharingien de Combinatoire",
+ volume = "51",
+ number = "B51z",
+ year = "2004",
+ keywords = "axiomref",
+ url = "http://www.emis.de/journals/SLC/wpapers/s51thiery.pdf",
+ paper = "Hive04.pdf",
+ abstract =
+ "In this article we give an overview of the MuPADCombinat opensource
+ algebraic combinatorics package for the computer algebra system MuPAD
+ 2.0.0 and higher. This includes our motivations for developing yet
+ another combinatorial software, a tutorial introduction with lots of
+ examples, as well as notes on the general design. The material
+ presented here is also available as a part of the MuPADCombinat
+ handbook; further details and references on the algorithms used can be
+ found there. The package and the handbook are available from the web
+ page, together with download and installation instructions, mailing
+ lists, etc."
+}
+
+\end{chunk}
+
+\index{Hemmecke, Ralf}
+\index{Rubey, Martin}
+\begin{chunk}{axiom.bib}
+@misc{RISC06,
+ title = "AXIOM Workshop 2006",
+ url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2006",
+ year = "2006",
+ location = "Hagenberg, Austria",
+ keywords = "axiomref",
+ abstract =
+ "Axiom is a computer algebra system with a long tradition. It recently
+ became free software.
+
+ The workshop aims at a cooperation of Axiom developers with developers
+ of packages written for other Computer Algebra Systems or developers
+ of standalone packages. Furthermore, the workshop wants to make the
+ potential of Axiom and Aldor more widely known in order to attract new
+ users and new developers."
+}
+
+\end{chunk}
+
+\index{Hemmecke, Ralf}
+\index{Rubey, Martin}
+\begin{chunk}{axiom.bib}
+@misc{RISC07,
+ title = "AXIOM Workshop 2007",
+ url = "http://axiomwiki.newsynthesis.org/WorkShopRISC2007",
+ year = "2007",
+ location = "Hagenberg, Austria",
+ keywords = "axiomref",
+ abstract =
+ "The workshop aims at a cooperation of Axiom developers with deelopers
+ of packages written for other Computer Algebra Systems, and
+ mathematicians that would like to use a computer algebra system to
+ perform experiments.
+
+ One goal of the workshop is to learn about the mathematical theory,
+ the design of packages written for other CAS and to make those
+ functionalities available in Axiom."
+}
+
+\end{chunk}
+
diff git a/src/axiomwebsite/patches.html b/src/axiomwebsite/patches.html
index 1e051cb..df99a83 100644
 a/src/axiomwebsite/patches.html
+++ b/src/axiomwebsite/patches.html
@@ 5392,6 +5392,8 @@ books/bookvol* standardize the bibliography/index sections
books/bookvolbib Axiom Citations in the Literature
20160625.08.tpd.patch
books/bookvol10.4 add Rube06, Hebi10 GUESS references
+20160626.01.tpd.patch
+books/bookvolbib Axiom Citations in the Literature

1.7.5.4