Institute of Computing and Cybersystems (ICC) Blog

Leo Ureel Receives 2020-21 CTL Award for Innovative Teaching

Published February 17, 2021

The 2020-2021 CTL Instructional Award for Innovative or Out of Class Teaching is being presented to two instructors, and Assistant Professor Leo Ureel, Computer Science, and Libby Meyer, senior lecturer, Visual and Performing Arts.

Ureel was nominated in recognition of his “student-centric efforts which have increased retention and diversified the cohort of first-year computing students.”

Ureel’s presentation, “Three course innovations to support communication,” will be presented at 3:30 p.m. on Thursday, February 18, 2021, as part of the CTL Instructional Award Presentation Series.

Link here to register for the event.

Ureel is a member of the Institute of Computing and Cybersystems’s (ICC) Computing Education Center.

Meyer’s presentation, “Beyond Carrots and Sticks: Mastery Based Grading and Narrative Assessment” will also be presented on February 18.

During spring 2017, academic deans were asked to begin recognizing instructors making contributions in these areas as part of the Deans’ Teaching Showcase, effectively nominating them for instructional awards.

CTL and Provost’s office members along with previous awardees then select one individual in each category from a pool composed of the Showcase and those nominated to the Academy of Teaching Excellence.

Ureel Lecture Abstract

Three course innovations to support communication Introductory courses present many communication challenges between faculty and first year students. In this context, we discuss three innovations used in our introductory computer science courses.

The first is the use of Snap, a high-level, visual programming language, as a form of pseudocode during the first five weeks of the course to build student vocabulary and problem solving skills before tackling programming in Java.

The second is a Code Critiquer developed as a Canvas plugin to provide immediate guidance and feedback to students when they submit their programming assignments.

The third is a grade visualization tool that helps students understand their current performance in the course and project a range that will contain their final grade. While not everyone teaches introductory computer science, we discuss how these or similar innovations and tools might apply to your course.

Michigan Tech Announces NSF CyberCorps: Scholarship for Service Program

Published February 16, 2021

By Karen Johnson

Michigan Technological University is one of six universities to join the National Science Foundation CyberCorps: Scholarship for Service (SFS) program, a nationwide program to recruit and train the next generation of information technology professionals, industrial control system security professionals and security managers.

The five-year, $3.3 million NSF grant provides up to three years of full scholarship support for 20 undergraduate and graduate students.

In return, following graduation, recipients must work in a cybersecurity-related job for federal, state, local or tribal government for a period equal to the length of the scholarship, among other requirements.

“The U.S. is facing a significant shortage of well-trained and well-prepared cybersecurity professionals,” said Yu Cai, professor of applied computing at Michigan Tech and the principal investigator of the grant. “Michigan Tech has developed a national and international reputation in cybersecurity education, research and outreach activities. We are thrilled to be part of the solution to the nation’s cybersecurity workforce challenge.”

Applications for Michigan Tech’s 2021-2022 cohort are now being accepted. Application guidelines and requirements can be found on the SFS website. The deadline to apply is June 1, 2021. Student informational sessions will be announced shortly.

The degree programs included in the CyberCorps scholarship opportunity are listed below.

The SFS program at Michigan Tech involves multiple programs and departments, including the College of Computing and its Department of Applied Computing and Department of Computer Science, the College of Engineering’s Department of Electrical and Computer Engineering, and the College of Business’s Management Information Systems B.S. program.

The SFS program also partners with the Pavlis Honors College to engage SFS scholars in a blend of faculty mentoring, peer mentoring and customized pathways.

Michigan Tech joins 78 current CyberCorps: Scholarship for Service universities across the country. In its announcement, NSF noted that Michigan Tech has a long history of K-12 outreach, which it expects to leverage as part of its project.

The project PI is Professor Yu Cai, Applied Computing. Co-PIs and other important personnel include Professor Jean Mayo, Professor Todd O. Arney, Professor Bo Chen, Professor Chee-Wooi Ten, Professor Kedmon N. Hungwe, and Dr. Laura Kasson Fiss.

Michigan Technological University is a public research university, home to more than 7,000 students from 54 countries. Founded in 1885, the University offers more than 120 undergraduate and graduate degree programs in science and technology, engineering, forestry, business and economics, health professions, humanities, mathematics, and social sciences. Our campus in Michigan’s Upper Peninsula overlooks the Keweenaw Waterway and is just a few miles from Lake Superior.

Student Town Hall Meetings Scheduled for Feb. 23 and Feb. 25

Published February 11, 2021

By Karen Johnson

College of Computing Dean Dennis Livesay will host two 60-minute virtual Town Hall meetings for College undergraduate and graduate students on February 23 and February 25, 2021.

At the Town Hall meetings, student are invited to share with Dean Livesay their thoughts and input about the College, curriculum, degree programs, departments, and other topics of interest.

The Undergraduate Town Hall is February 23, 2021, from 4:00 to 5:00 p.m. Join that meeting here: https://michigantech.zoom.us/j/87889920742.

The Graduate Town Hall is February 25, 2021, from 4:00 to 5:00 p.m. Join here: https://michigantech.zoom.us/j/82512917783.

Vijay Garg, UT Austin, to Present Lecture Feb. 19, 3 pm

Published February 11, 2021

By Karen Johnson

This lecture has been canceled.

Dr. Vijay Garg, University of Texas Austin, will present a lecture on February 19, 2021, at 3:00 p.m. The lecture is hosted by the Department of Computer Science.

Vijay Garg Bio

Vijay Garg is a Cullen Trust Endowed Professor in the Department of Electrical & Computer Engineering at The University of Texas at Austin. He received his Ph.D. in computer science at the University of California at Berkeley and B. Tech. in computer science at IIT, Kanpur.

His research interests are in distributed computing, discrete event systems and lattice theory. He is the author of “Elements of Distributed Computing” (Wiley, 2002), “Introduction to Lattice Theory with Computer Science Applications” (Wiley, 2015), and “Modeling and Control of Logical Discrete Event Systems” (Springer, 2012). He is an IEEE Fellow.

Lecture Title

Applying Predicate Detection to Discrete Optimization Problems

Lecture Abstract

We present a method to design parallel algorithms for the constrained combinatorial optimization problems. Our method solves and generalizes many classical combinatorial optimization problems including the stable marriage problem, the shortest path problem and the market clearing price problem.

These three problems are solved in the literature using Gale-Shapley algorithm, Dijkstra’s algorithm, and Demange, Gale, Sotomayor algorithm. Our method solves all these problems by casting them as searching for an element that satisfies an appropriate predicate in a distributive lattice. Moreover, it solves generalizations of all these problems — namely finding the optimal solution satisfying additional constraints called lattice-linear predicates.

For stable marriage problems, an example of such a constraint is that Peter’s regret is less than that of Paul. Our algorithm, called Lattice-Linear Predicate Detection (LLP) can be implemented in parallel with without any locks or compare-and-set instructions. It just assumes atomicity of reads and writes.

In addition to finding the optimal solution, our method is useful in enumerating all constrained stable matchings, and all constrained market clearing price vectors. The talk is an extended version of a paper that appeared in ACM SPAA’20.

Weihua Zhou to Present Seminar Feb. 12, 3 pm

Published February 11, 2021

By Karen Johnson

Assistant Professor Weihua Zhou, Applied Computing, will present a Chemistry department seminar on Friday, February 12, 2021, from 3:00 to 4:00 p.m. He will present ” Artificial intelligence for medical image analysis: our approaches.”

Career Fair is Around the Corner

Published February 10, 2021

By Karen Johnson

by Career Services

Michigan Tech’s Spring Career Fair is next week. We have 166 recruiting organizations registered so far. The event will be held virtually from 10 a.m. to 7 p.m. on Wednesday, Feb. 17.

Students can start registering for time slots to meet with company reps starting at 12:05 a.m. tomorrow (Feb. 11) on CareerFair Plus. We also encourage our first-year students to check out the group meetings at the fair, which are similar to company information sessions.

In preparation for the big day, we are hosting career fair prep workshops and events this week and next. Please pass this information on to your students and encourage them to register, as we have staff and recruiters who are eager to help prepare students for the fair.

Preparing for a Virtual Career Fair

Wednesday, Feb. 10 | 4 to 5 p.m. via Zoom (passcode MTUPrepare)

Resume and Interview Blitz

Thursday, Feb. 11 | 3-5 p.m. Register here
Monday, Feb. 15 | 3-5 p.m. Register here

ICPC Programming Competition Info Session Is Feb. 11, 6 pm

Published February 9, 2021

By Karen Johnson

What: Info Session: ICPC Programming Competition
When: Thursday, February 11, 6:00 to 7:00 p.m.
Where: Zoom

An information session about the ICPC Programming Competition will take place this Thursday, February 11, from 6:00 to 7:00 p.m.

ICPC Programming Competition, North America North Central Regionals, will be held, Saturday, February 27, 2021. The contest will be held remotely using the Kattis contest system and Zoom for team communication.

Practice contests will be organized prior to the event.

Please contact Associate Professor Laura Brown (lebrown@mtu.edu), Computer Science, with questions.

What are programming competitions?

Programming competitions are team events (groups of 3 students) that test student knowledge through the answering of programming questions, correctly and quickly. Top teams at the various events can go on to compete against top teams in the world.

Why do you want to participate?

The programming contest tests your skills against other teams and universities, helps in developing problem solving skills, and can aid in preparation for job interviews, offering practice in solving problems quickly.

When and how you can participate?

The programming contest is usually held in the Fall, but runs virtually in spring 2021. Student eligibility rules are listed here: https://icpc.baylor.edu/regionals/rules, which basically indicate that the student 1) can compete a maximum of five times at the regional levels, 2) started college in 2016 or later, and 3) was born 1997 or later. First year graduate students may be able to participate under these rules.

Forming teams

Students who are interested and eligible may sign up to form teams of up to three students.

If you are unable to attend the information session, please complete the form linked to below to indicate your interest, register teammates, or notify organizers that you are looking for teammates.
https://forms.gle/AYtCmJzxNyf2YWGb6

Fine more information and resources at https://bit.ly/3aLiu1O.

Dean Livesay Asks Students to Share Diversity and Inclusion Experiences

Published February 9, 2021

By Karen Johnson

“My goal — nay our goal — is to make the College of Computing a place where everyone feels welcome and can thrive. And admittedly, I don’t know how to do that, which is why I am asking for your help.”
Dean Livesay

Dean Dennis Livesay wants to hear your story. What has your experience been with regard to diversity and inclusion at Michigan Tech?

What does the Dean need to be aware of as he starts his new position? What is working? What needs to change? How can we improve?

“My commitment to you, in this request and as dean, is that you will always have a forum to speak and be heard on topics of concern to you and our educational community,” Livesay says. “I will ask questions, listen to your responses, seek to understand your experiences, and proactively address your concerns.

Please reach out to Dean Livesay via email (dlivesay@mtu.edu) if you’d like to schedule a time to talk.

“I know that speaking truth to power can be uncomfortable, so please feel free to bring a friend. Our conversation will be completely confidential,” Livesay stresses.

Learn more about Dean Livesay’s commitment to diversity and inclusion here.

Yakov Nekrich Paper Accepted for Top Computing Conference

Published February 9, 2021

By Karen Johnson

A publication by Associate Professor Yakov Nekrich, Computer Science, has been accepted to the 53rd Annual ACM Symposium on Theory of Computing (STOC).

The paper, “Optimal-Time Dynamic Planar Point Location in Connected Subdivisions,” describes an optimal-time solution for the dynamic point location problem and answers an open problem in computational geometry.

The data structure described in the paper supports queries and updates in logarithmic time. This result is optimal in some models of computation. Nekrich is the sole author of the publication.

The annual ACM Symposium on Theory of Computing (STOC), is the flagship
conference of SIGACT, the Special Interest Group on Algorithms and
Computation Theory, a special interest group of the Association for
Computing Machinery (ACM).

Registration Open for Graduate Research Colloquium

Published February 9, 2021

By Karen Johnson

by Graduate Student Government

Registration for this year’s virtual Graduate Research Colloquium (GRC) is open. Due to the continuation of the SARS-CoV-19 pandemic, the GRC will be held virtually on Thursday and Friday, April 1and 2.

The GRC is a great opportunity to work on your presentation skills and prepare for upcoming conferences. Students are free to give an oral presentation, a poster talk, or both. All talks will be scored by judges from the same field as the presenter.

Cash prizes are available for the top three places in both oral and poster presentations (1st – $300, 2nd – $200, and 3rd – $100). Registration closes Tuesday March 2, at 11:59 PM. Register today.

Poster presentations will take place in a pre-recorded video style. The deadline for video submission is Monday, March 22. A short Q&A session will take place with judges between 4-6 p.m. on April 1. Oral presentations are limited to 12 minutes plus a Q&A session.

The GRC will be capped off with a virtual awards ceremony. All participants and judges are invited to attend. The ceremony will be held on April 2, from 5-7 pm. Full information can be found on our website.

Feel free to contact Sarvada Chipkar if you have any questions or concerns.