Dear all,
If you have attended a seminar during the semester, please email me a paragraph describing your experience asap, but no later than Friday 12/6.
Thank you.
Credit for Attending a Seminar
29 Friday Nov 2013
Posted Announcements
in29 Friday Nov 2013
Posted Announcements
inDear all,
If you have attended a seminar during the semester, please email me a paragraph describing your experience asap, but no later than Friday 12/6.
Thank you.
29 Friday Nov 2013
Posted Announcements
inExam 3 grades are now posted on Blackboard.
26 Tuesday Nov 2013
Posted Announcements
inThe last homework assignment for this course is:
Two_Sample_Tests_and_Confidence_Intervals
There will be no other assignment after this.
25 Monday Nov 2013
Posted Announcements
inThe faculty/course evaluation process is important in providing feedback for continuous improvement.
The
course evaluation site is https://www.udmercy.edu/evaluate/
College
of Engineering & Science, School of Business and ALL other programs Faculty/Course evaluations for the standard 14 week course sections may be completed during “dead” week between Monday, December 2, 2013 and Sunday, December 8, 2013.
Students
may access the system from any internet connected computer whether on or off campus. For those students who prefer to use a University computer, systems are available in the ITS labs across the McNichols campus. All evaluations are completely anonymous.
If
you are unable to complete your online evaluation(s) due to technical reasons, please contact the Helpdesk with details ASAP. All evals must be in the system by the published end-date. If contacting the Helpdesk afterhours, please leave a voice-mail at 313.993.1500 or e-mail at helpdesk or submit a ticket into the http://helpdesk.udmercy.edu system and someone will follow up with you the next business day.
ITS
20 Wednesday Nov 2013
19 Tuesday Nov 2013
Posted Announcements
inFriday Engineering &Science Symposium
“Control from the Continuous
to the Discrete”
Dr. Rick Hill, UDM Dept. of Mechanical Engineering
Friday, November 22nd, in Engineering 220
The complexity of modern engineered systems and the amount of autonomy they have is astounding, yet the design of such systems still relies heavily on heuristic and ad hoc techniques. Verification of such systems is thus achieved through extensive system-level simulation and testing. These techniques are very time consuming and susceptible to error.
A common approach for dealing with the complexity of modern engineered systems is to model the systems and their control at a high level of abstraction by using discrete-event models. In recent years, a formal framework has been developed that not only verifies the correctness of discrete control logic, but is also able to automatically synthesize this logic so that it is correct by construction.
These tools are useful to a wide range of industrial problems ranging from routing parts through a factory to tasking fleets of autonomous vehicles. However, these techniques result in overwhelming computational complexity when applied to systems with even a moderate amount of concurrency. Some techniques for addressing this complexity by employing modularity and hierarchy are discussed.
Presentation:3:00pm
Reception beforehand
19 Tuesday Nov 2013
Hello Professor,
Online, you have it listed that we are going to be tested on “Tests For Population Proportion”, but that does not appear on the homework assignment list. I just want to verify that we are not going to be tested on this section since we have no means of any practice with the subject material.
Thank you, have a great night!
15 Friday Nov 2013
Posted Announcements
inUPDATE: The assignment “Tests_For_Population_Proportion” was never assigned. So, it will not be included in Exam3. END of UPDATE.
Exam 3 will take place on Wednesday 11/20.
Exam problems will be created from the homework problems. It is recommended you study the homework problems again, in such a way you understand how to solve them in each case.
In particular, the exam covers the following:
Explain the idea behind confidence intervals, prediction and tolerance intervals, and hypothesis testing.
Assignments:
Confidence_Intervals_for_Mean |
Confidence_Intervals_for_Proportion |
Confidence_Intervals_for_the_Variance_and_Standard_Deviation_of_a_Normal_Population |
Hypotheses_and_Test_Procedures |
Intervals_Based_on_Normal_Population_Distribution |
Tests_About_a_Population_Mean |
The_Distribution_of_the_Sample_Mean |
Assignments “Tests About a Population Mean” and “Tests For Population Proportion” are due on Wednesday 11/20).
The following will be provided and you do not have to memorize: Confidence intervals for the variance and s.d. of normal distributions.
You will also be provided with the following statistical tables:
Cumulative Normal Probabilities Table
Duration of the exam will be 50 minutes. You can use a pen and a calculator. Nothing else.
Please do not be late.
15 Friday Nov 2013
Posted Announcements
inStep 3– Inferential Statistics
Using the statistical program R, provide a file named xxxxyyyy3.R as well as a documentation file named xxxxyyyy3.doc. The xxxxyyyy3.R file must load all the data in the xxxxyyyy.RData file into R and must perform all the following in the order provided:
Submissions for the project are by email only.
Deadline: Tuesday 11/26 at 11:59pm EST.
04 Monday Nov 2013
Posted Announcements
in4th Annual Mike Skaff Memorial Lecture
Friday Engineering &Science Symposium
“Topics in Graph Theory:
Drawing, Connectivity and
Synchronization in Networks”
Dr. Nart Shawash, UDM Dept. Math-CSSE
Friday, November 8th,
in Engineering 220
This talk covers few topics in Graph theory, beginning with sparse symmetric graphs and their connectivity.
Connectivity is a variation on a theme of “How many nodes should be deleted from a network to disconnect it?”
Next we will discuss the tools used to demonstrate how graphs are drawn. Graph drawing borrows physical
analogies as it models vertices as a repelling particles, and the edges as a rubber bands between adjacent
vertices.
Finally, with the aid of graph drawing tools, we demonstrate Kuramoto model synchronization process on few sparse symmetric networks.
Presentation:3:00pm
Reception at 2:30 pm
featuring numerous
Lebanese foods
and desserts