The following is the schedule of upcoming department seminars. Seminars will be added to the schedule throughout the year. All seminars are free of charge and are open to all members, affiliates, and colleagues of the university community. Seminars are typically held on Tuesday or Thursday at 1:00 pm. If you would like additional information or if you might be interested in presenting a seminar, please contact Steph Durocher or the Department of Computer Science.
-
Dr. Hironori Egi
When: February 23, 2012 @ 1:00pm
Where: EITC E2-304Title: Designing Interactive Systems toward Improvement of Teaching and Learning
Speaker: Hironori Egi, Tokyo University of Agriculture and Technology
Abstract
The primary purpose in this talk is to contribute to improving educational activities, both teaching and learning. Since the early studies in computer science were conducted mainly at universities, various educational systems have been developed as the application of their achievements. With the spread of utilizing such systems, the style of teaching and learning is being diversified these days. I will introduce several interactive systems designed to support teaching and learning as follows: an annotation tool for peer-reviewing videos of lectures, a pen with an accelerometer sensor to detect behavior of students while studying in a large classroom, and a tangible chemistry experiment supporting system that helps safety training. Through reviewing these researches, how the latest technologies can affect the ways of teaching and learning will be discussed.
Keywords: Interactive Systems, Software for Teaching and Learning, Educational Technologies, Higher Education -
Daniel Page
When: March 06, 2012 @ 1:00pm
Where: EITC E2-304Title: Generalized Methods for Restricted Weak Composition Enumeration
Speaker: Daniel Page, Department of Computer Science, University of Manitoba
ABSTRACT
Over the past decade, researchers have been trying to seek more generalized algorithms for generating mathematical objects such as finite formal languages, and combinatorial objects. In this talk I will present a new algorithm that arrives at a generalized solution for the enumeration (generation) of restricted weak compositions of n-parts. In particular, this generalized algorithm covers many commonly sought compositions such as bounded compositions, restricted compositions, weak compositions, and restricted part compositions. This algorithm is for enumerating generalized types of restricted weak compositions called First-Order, and Second-Order Restricted Weak Compositions. I will also be discussing current developments in the field of Enumeration of Compositions in relation to Theory of Computation.
Related Topics: Computational Number Theory, Automata Theory, Combinatorics, Algorithms, Enumeration
-
Dr. Fabian Kuhn
When: April 12, 2012 @ 1:00pmDepartment of Computer Science Distinguished Lecture
Speaker: Dr. Fabian Kuhn, Faculty of Informatics, University of Lugano (USI), Switzerland