DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF WATERLOO SEMINAR ACTIVITIES Computer Science Seminar - Thursday, November 6, 1997 Eric G. Manning, P.Eng., F.EIC, F.IEEE President, Canadian Association for Computer Science, Wighton Professor & Director Parallel, Networked & Distributed Computing & Applications (PANDA) Group, Departments of Computer Science and Electrical and Computer Engineering, University of Victoria will speak on ``Computer Science, Software Engineering and Professional Engineering'' ROOM: Davis Centre Room DC1304 TIME: 2:30 p.m. - 3:30 p.m. ABSTRACT We review the history of software engineering and find that it is a subdiscipline of computer science, and that the term ``software engineering'' is the term used globally to denote this subdiscipline. We touch on issues of public safety and protection for mission-critical systems, and review the organizations of computer scientists which have been created to address these needs. We then consider embedded systems in general, noting that the successful and safe design of many requires both software engineering expertise and engineering domain expertise (mechanical, electrical, nuclear, ... engineering). This leads us directly to recommendations for mutually beneficial co-operation between computer scientists and Professional Engineers, in education and in professional practice. ------------------------------------------------------------ DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF WATERLOO SEMINAR ACTIVITIES SCIENTIFIC COMPUTATION SEMINAR - Monday, Nov. 10, 1997 Professor Emilio Spedicato, University of Bergamo, will speak on ``ABS methods for linear equations and applications to optimization''. TIME: 3:30-4:30 p.m. ROOM: DC 1304 ABSTRACT We present the main properties of ABS methods for solving linear algebraic equations, stressing their unifying approach and some computationaladvantages. Then we discuss some applications to optimization, e.g.: - derivation of the general solution of the Quasi- Newton equation with also sparsity and symmetry conditions. Existence of SSPD formulas is shown following a natural imbedding of the problem in a class of problems with one extra variable - derivation of the general feasible direction algorithm for linearly constrained optimization. The simplex method and the interior point methods follow as special cases when the function to be minimized is linear. The reformulation of the simplex method in terms of the so called implicit LX method is given.------------------------------------------------------------