ACA 2019

Conference booklet for download

Louis-Xavier — Fri, 12 Jul 2019 20:00:15 +0000

The conference booklet with all abstracts can be downloaded here.

The program schedule is online!

Louis-Xavier — Thu, 11 Jul 2019 01:17:59 +0000

Download the final program schedule in PDF format.

Early bird registration deadline coming up!

Louis-Xavier — Thu, 16 May 2019 12:00:06 +0000

Only 2 months left before ACA 2019!

Don’t forget to register by May 31 2019 to benefit from our early bird registration fee. You will find all information regarding the online registration process here: http://aca2019.etsmtl.ca/registration/online-registration/

Check out the accommodation options for which the organizing committee has secured discounted rates. There is a limited number of rooms, so book quickly !

We look forward to welcoming you to Montréal in July!

Second call for abstracts

Louis-Xavier — Fri, 19 Apr 2019 21:05:08 +0000

It is still time to send an abstract to one of the 11 Sessions!

Abstracts for a talk or a poster presentation must be submitted with the abstract template to the session chairs before May 10, 2019.

Notification of acceptance will be transmitted before May 17, 2019.

Call for abstracts

Louis-Xavier — Fri, 01 Mar 2019 14:37:20 +0000

The Program Chairs invite all future participants to submit an abstract for a talk or a poster presentation. Abstracts must be sent to the session chairs before April 19, 2019, using the abstract template. There are 11 sessions listed on the Sessions page. The aim and scope of each session and the contact information of the chairs are available on the webpage of each session.

Second call for session proposals

Louis-Xavier — Fri, 08 Feb 2019 19:48:51 +0000

You are invited to send proposals for sessions at ACA2019 before February 22, 2019 to the Program Chairs. The Scientific Committee will evaluate, review and approve proposals on a regular basis. All accepted sessions will be immediately announced on the Sessions page.

A proposal for a session must include:

Title of the session;
Short abstract describing the session;
Contact information of the organizers.

After the approval of the session, the session organizers will be in charge of:

Inviting the speakers;
Approving the talk abstracts;
Maintaining a web page describing the session with talk abstracts provided;
Sending the session web page URL and approved talk abstracts to ACA organizers.

Sessions are held in 2 to 3 hour blocks of time, each of which typically consists of either 4 to 6 half-hour talks or a one hour overview and 2 to 4 half-hour talks. These time blocks may include a half-hour break in the middle. Note that the half-hour slot includes time for questions.

Call for session proposals

Louis-Xavier — Mon, 05 Nov 2018 11:00:21 +0000

Proposals for sessions at ACA 2019 are welcomed by the Program Chairs. Early submission of proposals is encouraged! Good proposals will be approved on a regular basis before the deadline (February 8, 2019). Accepted sessions will be immediately announced on the Sessions page. A non-exhaustive list of sessions held in previous ACA conferences is available here.

A proposal for a session has to include:

Title of the session;
Short abstract describing the session;
Contact information of the organizers.

After the approval of the session, the session organizers will be in charge of:

Inviting the speakers;
Approving the talk abstracts;
Maintaining a web page describing the session with talk abstracts provided;
Sending the session web page URL and approved talk abstracts to ACA organizers.

Simon Plouffe

Louis-Xavier — Sat, 27 Oct 2018 18:59:19 +0000

Simon Plouffe is an independent mathematician born in St-Jovite Canada and now living in France. In 1995 he published with Neil Sloane, The Encyclopedia of Integer Sequences. The EIS was then put on the internet just after the publishing and became the OEIS, a central reference for sequences, as of today more than 7000 users are feeding the OEIS every day. In 1995 he found a formula and algorithm for the computation of the n’th binary digit of π ,and later in 1996 an algorithm for base 10. He worked on a program (with Bergeron, Salvy and Zimmermann) called GFUN which is capable of finding a formula for a sequence given a few terms. The package is now a standard issue in Maple and Mathematica and is used in the OEIS. Most of the findings and discoveries were made using Maple and experimental techniques. In 2016 he became professor at Université de Nantes (IUT). In 1995 he opened the Inverse Symbolic Calculator web site, renamed later : Plouffe Inverter in UQAM. Part of the database is now on his own web site. It contains 11.3 billon entries, the full database has now 17.5 billion entries. These engines contains mathematical constants and are used to find formulas and identities, many of them are currently within Wikipedia web. At age 19 he had the Guinness World Record for memorizing π to 4096 digits.

➥Abstract

Sylvie Ratté

Louis-Xavier — Sat, 27 Oct 2018 18:57:53 +0000

Sylvie Ratté is a Professor in the Department of Software and IT Engineering at École de technologie supérieure in Montreal, QC, Canada and serves as Research Director of the LiNCS (Semantics and Cognitive Engineering Laboratory). Previously, she has been postdoctoral fellow in the Department of Brain and Cognitive Sciences at MIT. Her current research interests include natural language processing, data mining, and machine learning, with applications in health (detecting and monitoring aging patients and Alzheimer’s disease patients), and education (tracking and monitoring students’ use of specialized concepts and learning disorders). Her research collaborators include Potsdam university (Germany), Universidad Nacional Autónoma de Mexico (Mexico), Medical University of South Carolina (USA), and Universidad Técnica Particular de Loja (Ecuador).

➥Abstract

Franco Saliola

Louis-Xavier — Sat, 27 Oct 2018 18:55:05 +0000

Franco Saliola is a young researcher in the Department of mathematics of Université du Québec à Montréal who has successfully integrated computer algebra exploration into many facets of his research program. He works in an area of mathematics where properties of algebraic and geometric objects can be explored by looking at the interactions between certain combinatorial data structures. A main thread of this research program is dedicated to developing techniques to decompose certain intricate objects (“representations”) and to applying these techniques to longstanding decomposition problems in linear algebra, probability theory, and group representation theory. Some of the uses of computer exploration include: the effective development of intuition and visualizations for research problems; the ability to explore elaborate examples that would be hard to explore otherwise; and the development of proof strategies through high-level formal algebra manipulations.

➥Abstract