Teaching activities

As part of the responsibilities listed in the section on collective activities, related activities to educational activities were :

• creation of the testing procedures ;

• creation and implementation of validation of acquired experience (VAE), support for candidates in the VAE process, evaluation of the experiences of candidates for the award of the diploma, defense and jury ;

• Management Internship offers, alternations for students, relationships with business and management courses digital processes - installation company in the defense with mandatory visits in firms allowing to create links with industry professionals ;

• projects enabling application, rédaction collaborative, educational model building with the obligation to respect the regulations in the request for authorization of part of the Engineering Diploma Commission, amélioration continue de la maquette pédagogique ;

• organization of teaching evaluation campaigns ;

• student management (absences, mediation, recrutement des nouveaux élèves ingénieurs) ;

• organization of juries, Presidency and issuing certificates of achievement and diplomas ;

• facilitating meetings with students and teachers ;

• Steering pedagogy sector, of schedule, the assignment of teachers and teaching load control ;

• management of the allocation of educational resources, in conjunction with teachers, education and resource managers : rooms, material resources, technological ;

• participation in communication acts (salons, conferences, JPO, JPE, …) ;

• project leader for a double degree between ISTY and Coventry University (UK) and between ISTY and UQAC (Canada).

School of Engineering = NO​​​​ - ​​ Military School = EM

Internship monitoring : tutor organizes monitoring of the course, la visite en entreprise, the report and the oral.

Monitoring of apprentices : the tutor organizes the follow-up of the apprentice, site visits, the report and the oral.

The lessons are made-face. The students have a course material (CO) (slide ou PDF) or TD / TP (PDF) on their ENT.

Database : Architecture and objectives of the DBMS, Files, hashing and indexing, relational model, Creating and manipulating database, SQL, query and update, Integrity and confidentiality of data, Elementary optimization and views. ), SGBD (Mysql, SQL, phpMyAdmin).

Algorithms and Programming : Foundations and algorithmic programming, logical explanation of the operation of a computer. Description of data structures and basic operations associated used to specify an algorithm in order to give their representation in programming languages. Search Algorithms, Added, shrinkage values ​​of, linked lists : simple, doubles, circular, with sentinel, pile, file, search, addition, withdrawal, functional programming lists, trees, binary search trees : addition, withdrawal, complexity, balancing, recursive programming, tree search, tables.

Architecture and Parallel Programming : Different parallel architectures, construction of parallel algorithms, Bookseller MPI, openMP, CUDA, synchronous and asynchronous communications, tests sur HPC, grids.

Analysis and object-oriented design : Notion of objects, encapsulation, surcharge, heritage, polymorphism, dialing instructions : sequence, conditional, iteration, notion d’invariant, subroutines and modularity, software components, "Black boxes", pre-and post-conditions, sequential data structures, tables.

Langage C, C , JAVA, PYTHON : Definition and use of language, basic type, variable, expression, assignment, logic element, test (conditional statement), loop, data structure (table), program structure, string, structure data and programs (C), Simple and complex objects and their properties (C , JAVA, PYTHON), patterns (JAVA).

Operating Systems : Bases essentielles des systèmes d’exploitation (general, complexity, reliability, maintainability, modularity, portability, layered) fundamental mechanisms and operating systems centralized, distributed and real-time. multithreaded application development by using communication tools, de synchronisation et des primitives ”noyau” (process, files, virtual memory, gestion des E/S). Scripts, process, CIP, ... Linux kernel and Unix Example.

Networks : Telecom protocols and standards, IP protocols, Radio frequency technologies, Digital technologies, Analog technologies, Fiber optic technology, Multiplexing techniques, Modeling and simulation software, Signal processing (bases). Network architecture, Telecommunication networks, Service platform architectures, Fixed telephony network architectures, Mobile phone network architectures, Computer and telecom networks, Internet, Multi-service network architectures.

Algorithmique avancé : Basic concepts of graph theory, course graphs (width, in depth), connectivity, strongly connected (algorithm TARJAN), Eulérien et Hamiltonien, algorithmes de plus courts chemins (Ford, Dijkstra, Bellman, Floyd), définitions et propriétés d’arbres, minimum weight spanning trees (Premium, Kruskal), networks waves : flots maximums, minimal cuts, minimum cost of floods : Ford-Fulkerson algorithm, fermeture transitive : Algorithm Roy -Warshall, Divide and Conquer method and greedy method, Petri Nets, orderings (PERT and MPM methods and workshop problems), Introduction to the complexity of algorithms and problems : Introduction to the complexity of algorithms and problems, Petri Nets (RdP) : competing systems, Petri nets formalism , modeling examples of dynamic discrete event systems.

Web Development : HTML, PHP, CSS.

Introduction to performance evaluation of discrete event systems.

Studies of waiting phenomena, performance metrics, sizing, load characterization and prediction.

Performance evaluation and dependability : Markovian modeling, Discrete time Markov chains (CMTD) and on a continuous basis (CMTC), submerged Markov chain (EMC), Transitional regime, steady state, ergodicité, stationary distribution. Global balance equations, Waiting lines : file M/M/S, file M/G/1, Little's Law, formule de Pollaczek-Khintchine, Queue networks (RFA) to product form (monoclasses/multi-classes, open / closed) : jackson networks, Gordon-Newell et BCMP, Traffic equation, Average value algorithm (VAT), Stochastic Petri nets : the GSPN model, Provisional assessment of the safety of operation : reliability, availability, Limitations of Markovian modeling, Stochastic simulations (methodology, validity, cost).

Meta-Heuristics and Exact Methods : Presentation of the simulated annealing.

Stochastic processes : simulation project a toll station using a simulation language of stochastic processes in order to practice the course to model and predict the evolution of random phenomena (applications to the phenomena of waiting, reliability and networks).

Projects : Algorithmique et Programmation Orienté Objet - design and implement an algorithm to process a complex problem, Parallel programming digital - for example, solving the linear system GMRES method, the LU factorization, by the method Richardson, ...

Office, Algorithms and Internet : Architecture, OS, Network, Pascal, Word processor , Spreadsheet , BD, Messaging, Navigation et Sécurité.