多伦多大学Geoffrey Hinton教授是世界上机器学习与人工智能领域的杰出研究者之一，他近日获得了加拿大2012年基廉奖（Killam Prizes）。Killam Prizes是有“加拿大诺贝尔奖”之称的国家最高科学奖。Hinton主要研究领域包括现代科学尖端领域的机器学习，以及机器如何在庞大、复杂的数据中执行辨认功能。
斯坦福大学研究教授，是Udacity的创始人与CEO。在此之前，他创建了Google X（Google X秘密实验室是Google最神秘的一个部门，探索前沿科学技术与未来他的主要研究领域是机器学习与人工智能。
"Algorithm Design and Analysis" is an important course for the major of computer science. This course introduces the basic models of algorithm design, the basic methods of algorithm analysis and the semi formal description of the problem as well as the proof of the algorithm. It will help the junior students of computer science establish a complete and systematic method for analyzing and solving the problem.
This Course aims at guiding students to describing and modelling non-determinative iphenomenons mathematically, and provides chances for students to practice Set Theory,Calculus and Advanced Algebra.
Mathematical Statitics is a basic course with wide application, it mainly focuses on the analysis of randon sample and other data set, including how to effectively collect data, parameter estimation , hypothesis testing, linear model and statistical design. The purpose is to let the students to understand elementary ststistica concepts and ideas, to study the most commonly used statistical methods and to solve some practical problems, and to establish the way of statistical thinking.
C++ is a low-level language with modern programming ideas. Maybe you have to learn other programming languages, but C + + allows you to better understand the computing machine. Creating more complex programs would need that you would have to have direct access over how memory is used. Pointers, for instance is something that you cannot utilize in other high level languages. If you are really interested about serious programming, C++ should be your main priority.
Understand principle and theory of Data Structures and Algorithms, able to design and implement fundamental data structures and algorithms.
Covers programming, data structures, algorithms.
Topics include the organization and implementation of fundamental data structures such as list, binary tree, tree and forest, and graph; sorting and searching; data abstraction and problem solving.
The content of the course consists of polynomials, linear spaces and linear transformations. This course will train the students with mathematical thinkings and the preliminary ability for solving practical problems.
Java、C++、C#、Ruby和Python，R， Matlab， SPSS， SAS， Stata，Hadoop， Spark， Flink