curriculum vitae
< back
download cv here >
(Click here if the lists do not appear)
articles
< back
Journal Articles:

Moir, RHC, Corless, RM, Moreno Maza, M and Xie, N. (2019) “SymbolicNumeric Integration of Rational Functions.” Numerical Algorithms. (forthcoming)

Asadi, M, Brandt, A, Moir, RHC and Moreno Maza, M. (2019) “Algorithms and Data Structures for Sparse Polynomial Arithmetic.” Mathematics, 7(5), 441 DOI: 10.3390/math7050441

Corless, RM, Kaya, CY and Moir, RHC. (2018) “Optimal residuals and the Dahlquist test problem.” Numerical Algorithms, DOI: 10.1007/s110750180624x, pp. 1–22.

Fillion, N and Moir, RHC. (2018) “Explanation and Abstraction from a BackwardError Analytic Perspective.” European Journal for Philosophy of Science, v. 8, no. 3, pp. 735–759, DOI: 10.1007/s1319401802086.

Bangu, S and Moir RHC (2018). “The ‘Miracle’ of Applicability? The Curious Case of the Simple Harmonic Oscillator.” Foundations of Physics, v. 48, no. 5, pp. 507–525.
Contributed Volume Articles:

Moir, RHC. (2019) “Effective Validity: A Generalized Logic for Approximate Inference.” In: Fillion, Nicolas, Corless, Robert and Kotsireas, Ilias (Eds.), Algorithms and Complexity in Mathematics, Epistemology and Science, Fields Institute Communications, no. 82, pp. 225–268.

Moir, RHC (2018). “Feasible Computation: Methodological Contributions from Computational Science.” In: Cuffaro, M and Fletcher, S (Eds.), Physical Perspectives on Computation, Computational Perspectives on Physics, Cambridge University Press, pp. 172–194.
Proceedings:

Asadi, M, Brandt, A, Moir, RHC and Moreno Maza, M (2018). “Sparse Polynomial Arithmetic with the BPAS Library.” In: Gerdt V., Koepf W., Seiler W., Vorozhtsov E. (Eds.) Computer Algebra in Scientific Computing. CASC 2018. Lecture Notes in Computer Science, vol 11077.

Moir, RHC. (2013). "Rational Discovery of the Natural World: An AlgebroGeometric Response to Steiner." In: A. Cupillari (Ed.), Proceedings of the Canadian Society for History and Philosophy of Mathematics, Hartford CT, July 2013, pp. 4359.
dissertations
< back
PhD Applied Mathematics (with Scientific Computing):
 Moir, RHC (2017). Feasible Computation in Symbolic and Numeric Integration. University of Western Ontario  Electronic Thesis and Dissertation Repository. Paper 5155.
PhD Philosophy:
 Moir, RHC (2013). Structures in Real Theory Application: A Study in Feasible Epistemology. University of Western Ontario  Electronic Thesis and Dissertation Repository. Paper 1578.
MSc Applied Mathematics:
extended abstracts
< back
Mathematics:
 Moir, RHC, Corless, RM, Jeffrey, DJ, (2014). "Unwinding Paths on the Riemann Sphere for Continuous Integrals of Rational Functions". In: Elias, J, FernándezSánchez, J, and Sombra, M (Eds.), Proceedings de Encuentro de Álgebra Computacional y Aplicaciones (EACA) XIV (EACA trans: Meeting on Computer Algebra and Applications), Barcelona, June 2014, pp. 139142.
Software:

Chen, C, Covanov, S, Mansouri, F, Moir, RHC, Moreno Maza, M, Xie, N and Xie, Y (2016). “The basic polynomial algebra subprograms.” ACM Communications in Computer Algebra, v. 50, no. 3, pp. 97100.
philosophy talks
< back
Conference Presentations:
 (2013) "Feasible Epistemology: Contributions of Applied Mathematics to Scientific Inference. PGSA Colloquium Series, Department of Philosophy, The University of Western Ontario, 16 October.
 (2013) “Rational Discovery of the Natural World: An AlgebroGeometric Response to Steiner” MathFest 2013/Canadian Society for the History and Philosophy of Mathematics (MathFest 2013/CSHPM) Conference, Hartford CT, 13 August.
 (2011) with Corless, RM. “Computation for Confirmation.” Conference on The Plurality of Numerical Methods and their Philosophical Analysis. Université Paris—PanthéonSorbonne, Paris, 34 November.
 (2010) with Fillion, N. “Computation in Scientific Explanation,” in the course Contemporary Philosophy of Science, Department of Philosophy, University of Guelph, 17 November.
 (2010) with Fillion, N. “Explanation and Abstraction: The Case of Backward Error Analysis” Philosophy of Science Association Biennial Meeting, Montreal, Quebec, 46 November.
 (2010) with Fillion, N. “Modeling and Explanation: Lessons from Modern Error Theory.” Canadian Society for the History and Philosophy of Science (CSHPS) Conference, Concordia University, Montreal, Quebec, 2830 May.
 (2010) with Fillion, N. “A Step Forward with Backward Error,” PGSA Colloquium Series, Department of Philosophy, The University of Western Ontario, 12 March.
 (2009) “The Conversion of Phenomena to Theory: Lessons on Applicability from the Development of Electromagnetism.” Canadian Mathematical Society/Canadian Society for the History and Philosophy of Mathematics (CMS/CSHPM) Conference, Memorial University, St. John’s, Newfoundland, 68 June.
 (2009) “From the World to Mathematics and Back Again: What We Can Understand About Applicability from the Development of Electromagnetism.” PGSA Collo quium Series, Department of Philosophy, The University of Western Ontario, 25 March.
 (2008) “Theories, Models and Representation: Lessons from Solid State Physics.” Canadian Society for the History and Philosophy of Science (CSHPS) Conference, University of British Columbia, Vancouver, British Columbia, 35 June.
 (2008) “Theories, Models and Representation: Lessons from Solid State Physics.” PGSA Colloquium Series, Department of Philosophy, University of Western Ontario, 12 March.
 (2005) “Interpretations of Probability in Quantum Mechanics.” PGSA Conference, Department of Philosophy, University of Waterloo, June.
Posters
mathematics talks
< back
Conference Presentations:

(2014) with Corless, RM, Jeffrey, DJ. "Unwinding Paths on the Riemann Sphere for Continuous Integrals of Rational Functions." 20th Conference on Applications of Computer Algebra, Fordham University, New York City, 912 July.
 (2014) with Corless, RM, Jeffrey, DJ. "Unwinding Paths on the Riemann Sphere for Continuous Integrals of Rational Functions." Encuentro de Álgebra Computacional y Aplicaciones XIV (EACAMeeting on Computer Algebra and Applications), Institut d'Estudis Catalans, Barcelona, 1820 June.