University of Ottawa - EMP - 5100

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 21. Introduction to Engineering ManagementWhat is Management?Management is a distinct process of (1) planning, (2) actuating (motivating), (3) organizing and (4) controlling, performed to determi

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 33. How to be a successful engineering administratorThe Engineer as an executiveEngineers are expected to perform many kinds of tasks. We see some directing the work of engineers, technicians, an

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 44. How to Develop People in Your Organization.and how to motivate Key People in Engineering. Note that motivated people are 2-10 times more productive.Motivators1. Uncover tools of self-motivat

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 55. Developing New Engineering Products (cont.)New Product PlanningThe following two checklists are always useful when you are planning for a new product: A. Marketing checklist B. Technical and

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 66. Techniques for making better Engineering Management Decisions(cont.)Cash Flow Analysis Techniques (cont.)Compound interest (cont.)Compound interest: I = A P Present Value: P = A/(1+i)*n = A

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 76. Techniques for making better Engineering Management Decisions (cont.)Concurrent Engineering (cont.)Typical Concurrent Engineering Objectives Etc. Reduce product development cost Reduce manuf

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 87. Methods to Manage Engineering Projects (cont.)The lowest time, a, is called the optimistic time; the highest one, b, is pessimistic; and m the one in between is called the most likely. The exp

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 98. Creativity and InventivenessCreativity is basically to produce new and interesting results from nature. Top age 30-35 years: mathematicians and physicists 35-40 years: experimental physicists

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 109. Product costing (cont.)Life Cycle Costing (LLC)Concept developed in 1965 by the US DoD. Under the present economic item procurement has taken on a different thread. A system which has been f

University of Ottawa - EMP - 5100

EMP5100 - Introduction to Engineering ManagementLecture 1111. Engineering Maintenance ManagementThe fundamental objectives of maintenance engineering are to ensure that new material is designed for ease of maintenance and that an adequate economic supp

University of Ottawa - EMP - 5100

University of Ottawa - EMP - 5100

University of Ottawa - EMP - 5100

University of Ottawa - EMP - 5100

University of Ottawa - ADM - 6260

EMP 5117Foundations of Software EngineeringGuy-Vincent JourdanGuy-Vincent JourdanBSc computer science (Montpellier, France) MSc computer science and mathematics (Paris, France) PhD computer science (Rennes, France) 1996 Alcatel Alsthom Research (Paris

University of Ottawa - ADM - 6260

SAMPLE Questions1T F Q1. Lags are used to break larger activities into smaller segments so that activities that follow can be started earlier. Answer: False Level: Medium Page: 172 T F Q2. By definition, the critical path always has zero slack. Answer: F

University of Ottawa - ADM - 6260

Introduction to Project Management Session 1James Bowen, Ph.D, PMP 1of 61AGENDAClass goals Course Outline Background Teaching style Speakers, videos, etc. Notes Text book Grading and assignments Contest Groups Objectives Generally accepted practic

University of Ottawa - ADM - 6260

Introduction to Project Management Session 2James Bowen, Ph.D, PMP1of 48AGENDAClass presentations Plan/Scope WBS Introduction Methodology Discussion Assignment #2 Summary Fun Contest MS Project Introductionhttp:/www.youtube.com/watch?v=f2tQLHD1cRkh

University of Ottawa - ADM - 6260

Introduction to Project ManagementSession 3James Bowen, Ph.D, PMP1 of 42AGENDANetwork Diagrams Sequencing and scheduling 2of 41SchedulingA schedule is the conversion of a project action plan into an operating timetable It serves as the basis for

University of Ottawa - ADM - 6260

Estimating Projects EstimatingTypes of EstimatesThe process of forecasting or approximating the time and cost of completing project deliverables The task of balancing the expectations of stakeholders and the need for control while the project is implem

University of Ottawa - ADM - 6260

Introduction to Project Management Session 4James Bowen, Ph.D, PMP 1of 30AGENDAStudent Presentations Resources Estimating Fun Contest2of 29Resourcesresource leveling network analysis in which scheduling decisions are drive by resource manageme

University of Ottawa - ADM - 6260

Introduction to Project Management Session 5James Bowen, Ph.D, PMP1of 38AGENDAStudent Presentations Risk Change Control Discuss Assignment #5 Fun Contest2of 38Project Risk DefinitionRisk is the chance that an undesirable event will occur and the

University of Ottawa - ADM - 6260

Introduction to Project Management Session 6James Bowen, Ph.D, PMP1of 24AGENDAStudent Presentations Final topics Tradeoffs/Integration, Communication, Change Management, types of contracts, closing the project, etc. Discuss Final Assignment Fun Conte

University of Toronto - ORGBUS - OBO261

Structure of the Midterm ExamFormat60 multiple choice (worth 1 point each)~10 multiple choice questions each from:Chapters 1, 2, 3, 4, 5, 6 and corresponding lectures7 brief concepts: answer with a few words/sentences Worth 1.5-6 points each 25 poi

University of Toronto - ORGBUS - OBO261

CONSENT FORM: PARTICIPATION IN GROUP STUDY PROJECT INTERVIEW UNIVERSITY OF TORONTO: INFORMED CONSENT STATEMENTINFORMATION: You are invited to participate in a research project on organizational behaviour. If you agree to participate, you will be asked a

University of Toronto - ORGBUS - OBO261

November 17CafesGroup 5 Victor Chan, Coey Cheng, Miao Li, Rolanda Lim, Xu Shi, Krishna (KJ) Tailor, & Shang WangNovember 24Car CompaniesGroup 6 Deyu Feng, Vienna Luong, Faizan Sheikh, Jin Son, Jessica Wan, Jiayi Wang, & Jianqiang ZhuInsuranceGroup

University of Toronto - CSC - CSC371

SDLC ProcessDescriptionDiscusses the application of software assurance best practices in the context of various SDLC methodologies, including RUP, XP, Agile, Waterfall, and the Spiral Model.Overview ArticlesName Secure Software Development Life Cycle

Bilkent University - CS - cs464

Bayesian Learning CS 464: Introduction to Machine LearningBayesian LearningSlides adapted from Section 6.1, 6.2, 6.3, and 6.9 Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html 1 2 Bayes Theorem MAP,

Bilkent University - CS - cs464

Concept Learning CS 464: Introduction to Machine LearningConcept LearningSlides adapted from Chapter 2, Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html1 2Acquiring the definition of a general cat

Bilkent University - CS - cs464

Decision Tree Learning CS 464: Introduction to Machine LearningDecision Tree LearningSlides adapted from Chapter 3 Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html 12 Decision tree learning is a m

Bilkent University - CS - cs464

Input: Concepts, instances, attributes CS 464: Introduction to Machine LearningInput:Concepts, instances, attributesSlides for Chapter 2 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.htmlTerminology What's a concept? Classification, associati

Bilkent University - CS - cs464

TextbooksMachine Learning by Tom M. MitchellCS 464: Introduction to Machine LearningAynur DayanikSlides for Chapter 1 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.htmlhttp:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.htmlData Mi

Bilkent University - CS - cs464

Statistical modeling CS 464: Introduction to Machine LearningStatistical Modeling (Nave Bayes Classifier)Slides for Section 4.2 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.html1Nave Bayes Classifier Use all the attributes Two assumptions: A

Bilkent University - CS - cs464

Outline CS 464: Introduction to Machine LearningArtificial eural etworksSlides adapted from Chapter 4 Machine Learning by Tom M. Mitchell http:/www-2.cs.cmu.edu/afs/cs.cmu.edu/user/mitchell/ftp/mlbook.html The Brain Perceptrons Gradient descent Multi-

Bilkent University - CS - cs464

Output: Knowledge representation CS 464: Introduction to Machine LearningOutput: Knowledge representationSlides for Chapter 3 adapted from http:/www.cs.waikato.ac.nz/ml/weka/book.html10/06/11 1 10/06/11Tables Linear models Trees Rules Classifica

Bilkent University - CS - cs464

Bilkent University - CS - cs464

CS 421 HW#1, due Nov. 8, 2010 1) Given the following parameters for a datagram packet switching network: N: number of hops between two given stations; L: total number of bits to be Xmitted; B: common data rate, in bits/second, on all links; H: number of o

Bilkent University - CS - cs464

Bilkent University - CS - cs464

CS421 HW#1, due Nov. 25, 20111. Assume that there are 3 links on a path connecting hosts A and B passing through routers R1 and R2 as shown in the following figure. Each link has a distance of 400 km and the transmission rate of each link is shown in the

Bilkent University - CS - cs464

Bilkent University - CS - cs464

CS421, HW#1, due Mar. 25, 2010 1. I wrote down a UDP based ping program, which can send ping request packets of variable size, in order to measure the propagation delay and transmission rate to the nearest router. I made some measurements using this tool

Bilkent University - CS - cs464

Bilkent University - CS - cs464

Bilkent University - CS - cs464

CS 421 HW#1, due Apr. 1, 2011 1) Assume that there are 3 links on a path connecting nodes A and B, where each link has a distance of 200 km and a transmission rate of 10 Mbps. We are transmitting a file composed of three packets from node A to node B usin

Bilkent University - CS - cs464

Bilkent University - CS - cs464

Bilkent University - CS - cs464

Chapter 2: Application LayerLast Update: Oct 18, 20112: Application Layer1Chapter 2: Application LayerOur goals: conceptual, implementation aspects of network application protocols o transport-layer service models o client-server paradigm o peer-to-p

Bilkent University - CS - cs464

Chapter 3: Transport LayerLast Update: Oct 25, 2011Transport Layer3-1Chapter 3: Transport LayerOur goals: understand principles behind transport layer services:learn about transport layer protocols in the Internet: multiplexing/ demultiplexing rel

Bilkent University - CS - cs464

Chapter 4: Network LayerChapter goals: understand principles behind network layerservices:routing (path selection) dealing with scale how a router works instantiation and implementation in theInternetNetwork layer transport segment from sending

Bilkent University - CS - cs464

Chapter 5: The Data Link LayerOur goals: understand principles behind data link layerservices: error detection, correction sharing a broadcast channel: multiple access link layer addressing reliable data transfer, flow control: done! instantiation a

Bilkent University - CS - cs464

EPFL-logoComputer Networks - Final ExamProf. J.-P. Hubaux and Dr. M. H. Manshaei January 27, 2009 Duration: 3:15 hours, closed book.Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on

Bilkent University - CS - cs464

EPFL-logoComputer Networks - Final ExamProf. J.-P. Hubaux and Dr. M. H. Manshaei January 18, 2010 Duration: 3:00 hours, closed book.Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra she

Bilkent University - CS - cs464

Computer Networks - Final examProf. J.-P. Hubaux and Dr. M. H. Manshaei December 21, 2010 Duration: 3:00 hours, closed book.Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra sheets if ne

Bilkent University - CS - cs464

EPFL-logoMidterm - Computer NetworksProf. J.-P. Hubaux and Dr. M. H. Manshaei November 4, 2008 Duration: 2 hours, closed book.Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on them).

Bilkent University - CS - cs464

EPFL-logoMidterm - Computer NetworksProf. J.-P. Hubaux and Dr. M. H. Manshaei November 3, 2009 Duration: 1:45 hours, closed book.Please write your answers on these sheets, at the end of each question; use extra sheets if necessary (put your name on the

Bilkent University - CS - cs464

Computer Networks - MidtermProf. J.-P. Hubaux and Dr. M. H. Manshaei November 9, 2010 Duration: 1:45 hours, closed book.Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra sheets if necess

Bilkent University - CS - cs464

Computer Networks - MidtermProf. J.-P. Hubaux and Dr. M. Jadliwala November 8, 2011 Duration: 1:45 hours, closed book.Please write your answers on these sheets in a readable way. Poorly written answers will not be corrected. Use extra sheets if necessar

Bilkent University - CS - cs464

Mid-Term Exam for Computer NetworksFall 2009> SOLUTIONS <Welcome to the Mid-Term Exam for Computer Networks. Read each problem carefully. There are eight required problems (each worth 12 points you get 4 points for correctly following these instruction

Bilkent University - CS - cs464

Mid-Term Exam for Computer NetworksFall 2010> SOLUTIONS <Welcome to the Mid-Term Exam for Computer Networks. Read each problem carefully. There are eight required problems (each worth 12 points you get 4 points for correctly following these instruction

Bilkent University - CS - cs464

Final Exam for Computer NetworksFall 2009> SOLUTIONS <Welcome to the Final Exam for Computer Networks. Read each problem carefully. There are ten required problems (each problem is worth 10 points). There is also an additional extra credit question wor