Student Academics
Faculty Senate considers pass/fail policy
Missouri S&T’s Faculty Senate is currently considering a policy to allow students increased flexibility regarding satisfactory/unsatisfactory grades (or pass/fail) for the Spring 2020 semester. More information will be posted once it is available.
Read More »List of academic resources
Visit Academic Support (academicsupport.mst.edu) with any issues, questions, or FAQ about our services. Call us at 341-7276 for any academic support needs! Minercard ID: https://pro.mst.edu/minercard/ or visit 109 Centennial (call first to get access to the building!) – 1-800-266-9035 Writing center – online writing consultations by appointment, and an online scheduler – https://writingcenter.mst.edu/ Student success center – online […]
Read More »Updated form process for undergraduate research opportunities
The OURE application form is now available by electronic submission only. If students have already submitted a hard copy of the form, then they do not need to submit the electronic form. Students will need to sign-in using their “umsystem” credentials. Applications are due May 1, 2020
Read More »LEAD course assistance is now available through Zoom
The Learning Enhancement Across Disciplines (LEAD) program will transition to provide free online tutoring in over 70 courses – including all the introductory courses in Math, Chemistry, Physics, and Comp Sci, via ZOOM. Check the schedule at https://lead.mst.edu/schedule/ to see if assistance is offered in your courses and to obtain the appropriate ZOOM meeting link.
Read More »After-hours mental health resources available
The counseling services staff has compiled a list of local and national resources available for support after office hours of 8 a.m. to 4:30 p.m. Monday through Friday. These include:
Read More »“Enabling Scalable Learning on Massive Datasets” Seminar
Dr. Praveen Rao will be giving a seminar about Enabling Scalable Learning on Massive Datasets on December 2nd, 2019 in CS 209 from 10:00-11:00am.
Read More »2019 Ozark Biomedical Reseach Symposium: Save the date | Call for speakers
Mark your calendars for this year’s Ozark Biomedical Research Symposium to be held 9 a.m. to 1 p.m., Saturday, Sept. 14, in the Havener Center. The event promotes the current, collaborative research and education activities between Missouri S&T and Phelps Health and applications for speakers are still being accepted. If you would like to apply […]
Read More »Coterie Scholarship open for applications
The Coterie Scholarship is available to female S&T students that have completed at least 50% of the hours required for the completion of a degree from Missouri S&T.
Read More »Computer Science Seminar-Parallel balanced binary trees using just join
Yihan Sun
Department of Computer Science, Carnegie Mellon Univeristy
February 6, 2019
10:00 – 10:50 am
209 Computer Science Building
Computer Science Seminar
With the evolution of hardware and growth in the volume of data, parallelism has become imperative and the key to improving performance. As such, it is of great interest to have simple and efficient parallel algorithms and data structures for programmers to easily organize and process data. My research designs such simple and efficient parallel algorithms and data structures, with provable guarantees in theory, good performance in practice, as well as simplicity in programming. In particular, this talk will introduce my work on parallel tree structures, that are highly-parallelized, safe for concurrency, theoretically work-efficient, supporting a wide range of functions and augmentations and multi-versioned. The tree structure is also implemented in a C++ library called PAM, and applied to various areas such as computational geometry and databases.
Bio: Yihan Sun is currently a Ph.D. student in Computer Science Department at Carnegie Mellon University, advised by Prof. Guy Blelloch. Prior to that, she received her Bachelor’s degree in Computer Science from Tsinghua University, working on data mining and social network analysis. Her research interests broadly lie in the theory and practice of parallel algorithms, data structures, as well as their implementations and applications.
Research On Tap: The Formula for Happiness in Russian Fairy Tales
Dr. Irina V. Ivliyeva, Department of Arts Languages and Philosophy
Wednesday, February 13 at 6:00 p.m.
Public House Brewing Company’s Rolla Brewpub Loft
Title: “The Formula for Happiness in Russian Fairy Tales”
Abstract: Everybody has a special place in their heart for fairy tales from their childhood, no matter what culture they are from. Focusing on discovering the secret of happiness, rather than on the recipe for success, Russian fairy tales show how an average (undereducated, weak, or disadvantaged) person overcomes all obstacles to “live happily ever after to a ripe old age”. After a brief review of the history of Russian oral tradition, which was influenced by a unique blend of Christian and Pagan beliefs, Ivliyeva will present the most famous Russian fairy tale collections, discuss their educational nature, and examine the social and psychological values they reflect. Examples include the use of magic numbers and patterns, symbolic colors, fixed epithets, transformation, and the role of animals.
