Department of Computer Science and Electrical Engineering
Master of Science in Artificial Intelligence and Machine Learning
The Master's degree in Artificial Intelligence and Machine Learning (AIML) is designed to prepare students for career advancement, or for further studies at the doctoral level. The program has two options, thesis and professional (non-thesis), each offered either completely online or face-to-face at the Stephenville campus. It is a research-based program of study, requiring students to complete independent work that culminates in several projects, and, in one of the options, a thesis project.
Admission to the program requires a Bachelor’s degree in computer science, AIML, or a related discipline from an accredited institution. Students not meeting this requirement will be considered for admission on an individual basis and may be admitted subject to the completion of appropriate undergraduate leveling courses to remove any deficiencies in preparation; in this case the department will recommend leveling courses, depending on the student's transcript.
Students must maintain a GPA of 3.0 or better, and make grades of C or better in all courses on the degree plan. No undergraduate courses can be counted towards this Master’s degree. A maximum of 12 graduate credit hours may be transferred.
Additional details can be found on the department website www.tarleton.edu/csee.
COSC 5360 | Artificial Intelligence | 3 |
MATH 5305 | Statistical Models | 3 |
Choose four courses from the following 1 | 12 | |
Robotics and Autonomous Systems | ||
Reinforcement Learning | ||
High Performance Computing | ||
Optimization for Machine Learning | ||
Deep Neural Networks | ||
Advanced Algorithms | ||
Parallel Computing and Algorithms | ||
Robot Vision | ||
Choose three 5000 level courses from COSC, CPEN, or MATH | 9 | |
Total Hours | 27 |
- 1
If student chooses the Non-Thesis concentration, the named elective they take for the concentration requirement must be different from the elective courses they chose for the program requirement. The student cannot repeat a course.
Non-Thesis (Professional)
Choose one from the following | 3 | |
Robotics and Autonomous Systems | ||
Reinforcement Learning | ||
High Performance Computing | ||
Optimization for Machine Learning | ||
Deep Neural Networks | ||
Advanced Algorithms | ||
Parallel Computing and Algorithms | ||
Robot Vision | ||
Choose two 5000 level courses from COSC, CPEN, or MATH | 6 | |
Total Hours | 9 |
Thesis (Research)
COSC 5088 | Thesis Research | 6 |
Total Hours | 6 |
Master of Science in Computer Engineering Description
The Master's degree in Computer Engineering is designed to prepare students for career advancement, or for further studies at the doctoral level. It has two options, thesis and professional (non-thesis). It is a research-based program of study, requiring students to complete independent research that culminates in several projects, and, in one of the options, with a thesis project. Either option includes rigorous curriculum and allows students to concentrate their program in the following specialized areas: Computer Architecture and Distributed Computing; Advanced Computer Networks; VLSI Circuit Design; Robotics, Artificial Intelligence, and Machine Learning.
Admission to the program requires a Bachelor’s degree in computer engineering, electrical engineering or computer science from an accredited institution. Students not meeting this requirement will be considered for admission on an individual basis and may be admitted subject to the completion of appropriate undergraduate leveling courses to remove any deficiencies in preparation; in this case the department will recommend leveling courses, depending on the student's transcript.
Students must maintain a GPA of 3.0 or better, and make grades of C or better in all courses on the degree plan. No undergraduate courses can be counted towards this Master’s degree. A maximum of 12 graduate credit hours may be transferred.
Master of Science in Computer Engineering
CPEN 5343 | Advanced Computer Architecture | 3 |
CPEN 5351 | Introduction to Convex Optimization | 3 |
CPEN 5355 | VLSI Architectures | 3 |
CPEN 5378 | Advanced Computer Networks | 3 |
CPEN Electives | 6 | |
Total Hours | 18 |
Professional (non-thesis)
CPEN Electives | 6 | |
Electives - 5000-level: ELEN, COSC, MATH, or BCIS | 12 | |
Total Hours | 18 |
Thesis
Electives - 5000-level: ELEN, COSC, MATH, or BCIS | 9 | |
CPEN 5099 | Thesis Research | 6 |
Total Hours | 15 |
Computer Engineering Courses
CPEN 5099. Thesis Research. 1-6 Credit Hours (Lecture: 1-6 Hours, Lab: 0 Hours).
Research for Master’s thesis in Computer Engineering Prerequisites: Graduate standing.
CPEN 5341. Advanced Algorithms. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Amortized analysis, graph, network flow, string matching, matrix and polynomial algorithms, linear programming, NP-completeness, approximation algorithms, and an introduction to parallel algorithms. Prior knowledge or experience in data structures and algorithms recommended. Prerequisite: Approval of department head.
CPEN 5342. Parallel Computing and Algorithms. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Taxonomy of parallel computers, shared-memory and message-passing architectures, theoretical models; patterns and strategies for designing parallel algorithms; parallel data structures; automatic parallelization of sequential programs; communication; synchronization and granularity; applications. Prior knowledge or experience in Computer Architecture is recommended.
CPEN 5343. Advanced Computer Architecture. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
The course is structured around the three primary building blocks of general-purpose computing systems: processors, memories, and networks. Topics include the limitations of scalar pipelines, superscalar execution, out-of-order execution, register renaming, memory disambiguation, branch prediction, and speculative execution; multithreaded, VLIW, and SIMD processors; non-blocking cache memories, and memory synchronization, consistency, and coherence; multi-core, shared-memory architectures. The course also covers techniques for quantitative analysis of computer systems, to understand and compare alternative design choices. Prior knowledge or experience in Computer Architecture is recommended. Prerequisite: Approval of department head.
CPEN 5348. Advanced VLSI Circuit Design. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Analysis and design of key analog and mixed-signal IC blocks: analog switches, sampling circuits, switched-capacitor filters, ADCs, DACs, PLLs. Low-power design techniques and machine learning applications for analog and mixed-signal ICs. Prior knowledge or experience in Electronics II and Digital Signal Processing is recommended. Prerequisite: Approval of department head.
CPEN 5351. Introduction to Convex Optimization. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course introduces convex optimization problems, the basics of convex analysis, algorithms for convex optimization and their complexities, and applications of convex optimization. The course also trains students to recognize convex optimization problems that arise in scientific and engineering applications, and to use software tools to solve convex optimization problems. Prior knowledge or experience in Calculus III and Matrix Algebra is recommended. Prerequisite: Approval of department head.
CPEN 5355. VLSI Architectures. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
The course covers the most important methodologies for designing custom or semi-custom VLSI systems for typical signal processing and communications applications. Techniques for the inner and outer receiver, mapping of algorithms onto array structures, digital signal processing (DSP) systems, and field programmable gate arrays (FPGAs), programmable signal processors. Prior knowledge or experience in Computer Architecture is recommended. Prerequisite: Approval of department head.
CPEN 5361. Deep Neural Networks. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Introduction to the principles and theory of neural networks, with emphasis on deep neural networks. Topics include convolutional networks, recurrent and LSTM networks, reinforcement learning, preprocessing, regularization, tuning and optimization, as well as mathematical and programming tools. Applications to classification, image recognition, autonomous vehicles. Prior knowledge or experience in Data Science, Machine Learning is recommended. Prerequisite: Approval of department head.
CPEN 5366. Robot Vision. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course aims at bridging the gap between computer vision and deep learning. It covers topics such as object detection and recognition, machine learning algorithms for computer vision, and advanced techniques for 3D computer vision. Real world applications and projects will be implemented in the areas of autonomous vehicles and robotics. Prior knowledge or experience in Computer Vision, Python, and C/C++ programming is recommended. Prerequisite: Approval of department head.
CPEN 5377. Wireless and Mobile Communication Networks. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Advanced architectures for wireless communication networks; advanced wireless technologies; challenges and issues in designing such networks; queueing theory and other stochastic models. Prior knowledge or experience in Computer Networks or Communication Systems Theory, Probability, one semester of programming is recommended. Prerequisite: Approval of department head.
CPEN 5378. Advanced Computer Networks. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course concentrates on routing and inter-networking in IP networks, while addressing contemporary topics like wireless networks, security, voice and video over IP, the Internet of Things (IoT), software-defined networking, and network virtualization. Prior knowledge or experience in Computer Networks is recommended. Prerequisite: Approval of department head.
CPEN 5379. Performance of Computer and Communication Networks. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Application of probability, Markov chains, and queueing theory to the analysis and design of computer and communication networks. Case studies in traffic shaping and multiplexing, static routing, dynamic routing, and peer-to-peer file sharing systems. Both continuous-time and discrete-time models are explored. Prior knowledge or experience in Computer Networks or Communication Systems Theory, Probability is recommended. Prerequisite: Approval of department head.
Computer Science Courses
COSC 5086. Advanced Special Problems in Computer Science. 1-6 Credit Hours (Lecture: 1-6 Hours, Lab: 0 Hours).
Advanced special problems in computer science. Work may be either theory or laboratory. May be repeated with approval of the department head for additional credit.
COSC 5088. Thesis Research. 1-6 Credit Hours (Lecture: 1-6 Hours, Lab: 0 Hours).
Research for Master’s thesis in AI and Machine Learning (AIML-MS).
COSC 5330. Simulation. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Introduction to simulation with emphasis on simulation methodology, random number generation, time flow mechanisms, sampling techniques, and validation and analysis of simulation models and results. Simulation languages and their applications will be investigated.
COSC 5345. Reinforcement Learning. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course will provide an introduction to, and comprehensive overview of, reinforcement learning (RL). Topics include Markov decision process and dynamic programming, Monte-Carlo methods, temporal difference learning, integration of planning and learning, policy gradient and actor-critic methods, deep learning and deep RL algorithms. Students will engage in exercises and projects that involve coding in simulated RL environments. Credit will not be awarded for both COSC 4345 and 5345. Graduate students will have to complete additional assignments. Prerequisite: Advanced background in statistics and artificial intelligence.
COSC 5346. Robotics and Autonomous Systems. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Overview of the major areas of robotics and autonomous systems. AI, machine learning and optimization algorithms that enable autonomous agents to operate in unstructured, dynamic environments, including localization and mapping, sensor fusion, computer vision, path planning, communication, and obstacle avoidance. Students will engage in exercises and projects that involve developing robotics systems with autonomous actions, and evaluating their performance using computer simulations and physical robotic systems. Credit will not be awarded for both COSC 4346 and 5346. Graduate students will have to complete additional assignments. Prerequisite: Advanced background in statistics, linear algebra and artificial intelligence.
COSC 5347. High Performance Computing. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course provides an introduction to programming massively parallel processors and the architectures therein. It covers methods to harness the potential of Graphical Processing Units (GPUs) and parallel algorithms using the CUDA parallel computing platform. Algorithms from the fields of Scientific Computing, Machine Learning, and Computer Vision are introduced and explored.
COSC 5352. Optimization for Machine Learning. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
This course will explore the theory and algorithms that arise in machine learning and modern data analysis. The topics will be tailored with a particular focus on complexity, implementation, robustness, and scalability of algorithms to large datasets. Students will engage in exercises and projects that involve programming optimizations algorithms, and evaluating their performance.
COSC 5360. Artificial Intelligence. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Introduces representations, algorithms and architectures used to build intelligent systems. Predicate calculus, state-space representation and search, heuristic search, knowledge-based problem-solving, symbol-based and connectionist machine learning, intelligent agents, robotics.
COSC 5361. Deep Neural Networks. 3 Credit Hours (Lecture: 3 Hours, Lab: 0 Hours).
Introduction to the principles and theory of neural networks, with emphasis on deep neural networks. Topics include convolutional networks, recurrent and LSTM networks, reinforcement learning, preprocessing, regularization, tuning and optimization, as well as mathematical and programming tools. Applications to classification, image recognition, autonomous vehicles. Credit will not be awarded for both COSC 4361 and 5361. Graduate students will have to complete additional assignments. Prerequisite: Advanced background in statistics, linear algebra and artificial intelligence.
Dr. Mircea Agapie, Department Head
Department of Computer Science and Electrical Engineering
Box T-0390
Stephenville, Texas 76402
254-968-9863
agapie@tarleton.edu
www.tarleton.edu/encs