-
Sessional Instructional Assistant - MAT302H5F - Intro to Algebraic Cryptography (emergency posting)1
University of Toronto | Downtown Toronto University of Toronto Harbord, Ontario | Canada | 11 days agocryptography, from Euclid to Zero Knowledge Proofs. Topics include: block ciphers and the Advanced Encryption Standard (AES); algebraic and number-theoretic techniques and algorithms in cryptography, including
-
learning models, including their strengths, deficiencies, and strategies for (hyper)parameter optimization. Prior use of Bayesian optimization or other relevant active learning algorithms is preferred
-
machine learning algorithms. It also serves as a foundation for more advanced ML courses. The students will learn about ML problems (supervised, unsupervised, and reinforcement learning), models (linear and
-
edge AI for localized knowledge preservation; AI governance and data sovereignty in digital heritage institutions and collections; study and design of recommendation systems and ranking algorithms used
-
, Python, or C/C++, with the ability to develop custom scripts and algorithms for data analysis and modeling. Familiarity with rheological characterization techniques, such as rheometry or viscometry
-
technical subjects such as programming, data science, machine learning, and algorithmic fairness is highly desirable. Candidates must have teaching experience in a degree-granting program, including lecture
-
), debuggers, code verifiers and unit test frameworks and gain experience in graphical user interface design and algorithm development. Posting end date: July 11, 2025 Number of positions (est): One (1) position
-
: Course number and title: MIE1624F/S – Introduction to Data Science and Analytics Course description: The objective of the course is to learn analytical models and overview quantitative algorithms
-
, strings, pointer-based data structures and searching and sorting algorithms. The laboratories reinforce the lecture topics and develops essential programming skills. Estimated course enrolment: ~150
-
, lists, maps. Program structure: control flow, functions, classes, objects, methods. Algorithms and problem solving. Searching, sorting, and complexity. Unit testing. Floating-point numbers and numerical