Differences between revisions 3 and 4
Revision 3 as of 2012-04-20 15:36:10
Size: 2449
Editor: saliola
Comment:
Revision 4 as of 2012-04-20 15:48:35
Size: 4566
Editor: saliola
Comment:
Deletions are marked like this. Additions are marked like this.
Line 19: Line 19:
 * 09h00 : Talk: *Welcome and Introduction to Sage*  * 09h00 : *Welcome and Introduction to Sage*, Sébastien Labbé
Line 21: Line 21:
 * 10h30 : Tour de Table and Installations  * 10h30 : Tour de Table and Installations, Franco Saliola
Line 26: Line 26:
 **Afternoon Session**:  **Afternoon Session**, 14h30-17h30:
Line 43: Line 43:
 * 09h00 : Talk: *QPA by O. Solberg*  * 09h00 : *QPA by O. Solberg*
Line 45: Line 45:
 * 10h30 : Tutorial III: Basic Python (given by Montréal Python)
 * 11h30 : Talk: PyCox by M. Geck
 * 10h30 : Tutorial III: Basic Python (given by Montréal Python ?)
 * 11h30 : Meinolf Geck, *High performance computations around Kazhdan-Lusztig cells*

            *Abstract.* We present the computer algebra package PyCox, written
            entirely in Python and compatible with Sage, for computations with
            finite Coxeter groups and Hecke algebras. It includes some new
            variations of the traditional algorithms for computing Kazhdan-Lusztig
            cells (which now work up to type E_7) and distinguished involutions
            (which even work in type E_8).
Line 50: Line 57:
 **Afternoon Session**: exercises and coding sprints  **Afternoon Session**, 14h30-17h30: exercises and coding sprints with coffee break and status reports
Line 61: Line 68:
 * 09h00 : Talk: *Zen by D. Ruths*  * 09h00 : Derek Ruths, *Introducing Zen: the Zero-Effort Network Library for Python*

            *Abstract.* This talk will introduce a new python library for network
            analysis and algorithmics. As datasets increase in size and algorithms
            demand increasing amounts of resources, it is critically important for
            network libraries to be efficient and performant. Few libraries
            available for Python (or any other platform for that matter) deliver
            this kind of efficiency: few can load massive network datasets or
            execute intensive algorithms on them. Of those that can, efficiency
            comes at a cost to ease of use. We don't believe that this compromise
            is necessary. Designed from scratch, the Zen library aims to provide the
            fastest, most memory efficient network routines without compromising
            good pythonic conventions. To date it's benchmarked network functions
            match or beat the fastest network libraries available in Python. In
            this talk, we will give a brief introduction to network analysis,
            discuss the design elements of Zen that make it both fast and
            easy-to-use, briefly overview its functionality, and discuss
            opportunities for integration and use with Sage.
Line 63: Line 88:
 * 10h30 : Tutorial IV: Some useful Python libraries (given by Montréal Python)
 * 11h30 : Tutorial V:
 * 10h30 : Tutorial IV: *Some useful Python libraries* (given by Montréal Python ?)
 * 11h30 : Tutorial V: *Contributing to Sage*, Anne Schilling
Line 68: Line 93:
 **Afternoon Session**: exercises and coding sprints  **Afternoon Session**, 14h30-17h30: exercises and coding sprints with coffee break and status reports
Line 86: Line 111:
 **Afternoon Session**: exercises and coding sprints  **Afternoon Session**, 14h30-17h30: exercises and coding sprints with coffee break and status reports
Line 104: Line 129:
 **Afternoon Session**: exercises and coding sprints  **Afternoon Session**, 14h30-17h30: exercises and coding sprints with coffee break and status reports

Preliminary Schedule for Sage Days 38

Morning sessions will will include talks, tutorials and open presentations.

Afternoon sessions will be dedicated to working on the exercises from the tutorials, coding sprints, follow-up discussions, etc.

Status reports: There will be a status report every day at 17h00.

Monday

Morning Session:

  • 08h30 : Coffee & Croissants
  • 09h00 : Welcome and Introduction to Sage, Sébastien Labbé
  • 10h00 : Coffee Break
  • 10h30 : Tour de Table and Installations, Franco Saliola
  • 11h30 : Tutorial I : Using the Sage notebook and navigating the help system

Lunch Break: 12h30 - 14h30

Afternoon Session, 14h30-17h30:

  • 14h30 : Tutorial II : Calculus and Linear Algebra in Sage
  • 15h30 : Coffee Break
  • 16h00 : Coding Sprints
  • 17h00 : Status Reports

Buffet at CRM: 17h30 - 18h30

Special event: Montréal Python Meeting, 18h30 - 21h30

Tuesday

Morning Session:

  • 08h30 : Coffee & Croissants

  • 09h00 : QPA by O. Solberg

  • 10h00 : Coffee Break

  • 10h30 : Tutorial III: Basic Python (given by Montréal Python ?)

  • 11h30 : Meinolf Geck, High performance computations around Kazhdan-Lusztig cells

    Abstract. We present the computer algebra package PyCox, written entirely in Python and compatible with Sage, for computations with finite Coxeter groups and Hecke algebras. It includes some new variations of the traditional algorithms for computing Kazhdan-Lusztig cells (which now work up to type E_7) and distinguished involutions (which even work in type E_8).

Lunch Break: 12h30 - 14h30

Afternoon Session, 14h30-17h30: exercises and coding sprints with coffee break and status reports

  • 15h30 : Coffee Break
  • 17h00 : Status Reports

Wednesday

Morning Session:

  • 08h30 : Coffee & Croissants

  • 09h00 : Derek Ruths, Introducing Zen: the Zero-Effort Network Library for Python

    Abstract. This talk will introduce a new python library for network analysis and algorithmics. As datasets increase in size and algorithms demand increasing amounts of resources, it is critically important for network libraries to be efficient and performant. Few libraries available for Python (or any other platform for that matter) deliver this kind of efficiency: few can load massive network datasets or execute intensive algorithms on them. Of those that can, efficiency comes at a cost to ease of use. We don't believe that this compromise is necessary. Designed from scratch, the Zen library aims to provide the fastest, most memory efficient network routines without compromising good pythonic conventions. To date it's benchmarked network functions match or beat the fastest network libraries available in Python. In this talk, we will give a brief introduction to network analysis, discuss the design elements of Zen that make it both fast and easy-to-use, briefly overview its functionality, and discuss opportunities for integration and use with Sage.

  • 10h00 : Coffee Break

  • 10h30 : Tutorial IV: Some useful Python libraries (given by Montréal Python ?)

  • 11h30 : Tutorial V: Contributing to Sage, Anne Schilling

Lunch Break: 12h30 - 14h30

Afternoon Session, 14h30-17h30: exercises and coding sprints with coffee break and status reports

  • 15h30 : Coffee Break
  • 17h00 : Status Reports

Thursday

Morning Session:

  • 08h30 : Coffee & Croissants
  • 09h00 : Open Presentations
  • 10h00 : Coffee Break
  • 10h30 : Open Presentations
  • 11h30 : Tutorial VI: Cython

Lunch Break: 12h30 - 14h30

Afternoon Session, 14h30-17h30: exercises and coding sprints with coffee break and status reports

  • 15h30 : Coffee Break
  • 17h00 : Status Reports

Friday

Morning Session:

  • 08h30 : Coffee & Croissants
  • 09h00 : Open Presentations
  • 10h00 : Coffee Break
  • 10h30 : Open Presentations
  • 11h30 : Open Presentations

Lunch Break: 12h30 - 14h30

Afternoon Session, 14h30-17h30: exercises and coding sprints with coffee break and status reports

  • 15h30 : Coffee Break
  • 17h00 : Status Reports

days38_schedule (last edited 2013-07-06 05:15:37 by saliola)