Nokia Distinguished Lecture: Eric Feron on Control Systems S
February 8th, 2010Nokia Distinguished Lecture: Eric Feron on Control Systems Software Assurance Eric Feron School of Aerospace Engineering Georgia Institute of Technology Abstract: Control systems has historically been concerned with the development of provably good control software specifications for cyber-physical systems. Closely associated with control systems engineering, one can find extensive tools derived from numerical analysis, dynamical system theory, complex analysis, linear algebra and other fields. Comparatively speaking, little or no attention has been spent on control software, leaving it aside as an “implementation issue”. In this talk, we will motivate the need to look more closely at control system software. After pointing out the commonalities existing between invariant theory and Lyapunov stability theory, we will outline some basic techniques that may help make control systems software more easily and independently verifiable. We will also describe ongoing efforts aimed at the case-by-case verification of auto coded software. Bio: Eric Feron is the Dutton-Ducoffe Professor of Aerospace Software Engineering at the Georgia Institute of Technology. Prior to that, he has been on the faculty of mits department of Aeronautics and Astronautics for 12 years. He holds his BS, MS and phd degrees from Ecole Polytechnique, France, Ecole Normale Supérieure, France and Stanford University. Eric Ferons interests are to use fundamental concepts of control systems, optimization and computer science to address important problems in aerospace engineering, including: Aerobatic control of unmanned aerial vehicles, air traffic control systems and aerospace system certification. Eric Feron has published two books and several research papers; his former research students are distributed throughout academia, government and industry. He is an advisor to the Academy of Technologies.
Free Video Ebooks
February 7th, 2010Lecture 24 | Programming Abstractions (Stanford)
February 5th, 2010Lecture 24 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie introduces hashing and it’s uses in search and retrieval; map implementations and the different kinds of search algorithms are then discussed. Thereafter she explains that logarithmic searches are relatively fast and often finish the search in an immeasurable amount of time. She introduces a different approach to search that works in a faster manner than linear search. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on youtube: www.youtube.com
