Poster Session: CS/Psych/EdPsych-770 Human-Computer Interaction

Please join us for the CS/Psych/EdPsych-770 Human-Computer Interaction poster session where 17 project teams will present semester-long course projects studying how computer systems—from voice assistants to connected vehicles and from digital wallets to health apps—shape human trust, privacy, financial decision-making, and learning. Below are project titles, teams, and abstracts.

Cookies will be served.



Title: How do Voice Assistants (Siri, Google, Alexa) Affect Human Emotions Under Day-to-Day Interactions?

What Should We Do With Persistent Main Memory?

Memory systems are on the verge of a renaissance: Scalable, persistent main memories (e.g., Intel’s 3DXPoint) are the first new technology to enter the upper layers of the memory hierarchy in 50 years. They bring a fundamentally new capability (i.e., persistence), a dramatic increase in capacity, and an array of complications (e.g., asymmetric read and write performance, power limitations, and wear out). This combination of characteristics raises a deceptively simple but fundamental question: What should we do with persistent main memory?

Quick, Simple, and Easy Solutions to Hard Software Problems

I present quick, simple, and easy solutions to hard software
problems such as security vulnerabilities, memory leaks, addressing
errors, infinite loops, program optimization, and automatic
parallelization. Each solution is implemented as an automated program
transformation that takes as input a program that may have one or more
of these problems and produces as output a program without the
problem. A key to these solutions is transcending the traditional
requirement that program transformations preserve the semantics of the

High-level Abstractions for Network Programming

Abstract: Over the past ten years, programmable networks have gone from a dream to a reality. Software-defined networking (SDN) architectures provide interfaces for specifying network-wide control algorithms, and emerging hardware platforms are exposing programmability at the forwarding plane level as well. But despite much progress, several fundamental questions remain: What are the right abstractions for writing network programs? How do they differ from the abstractions we use to write ordinary software? Can we implement these abstractions efficiently on current hardware?

WACM Game Night

Its that stressful, unfortunate time of the semester again, and we all need some good stress relief and snacks to keep us going!
Come join WACM for a fun game night on Thursday, December 6 from 5:30-7:30pm in CS 2310.
We will have some pizza or snacks for the night! We are also planning on a lot of fun games.
Just come, have fun, take some time-out from studying, and enjoy the food!

Theory Seminar: Efficient Density Evaluation for Smooth Kernels

Given a kernel function k and a dataset P (of points from R^d), the kernel density function of P at a point q from R^d is equal to KDF_P(q) := 1/|P| sum_{p in P} k(p,q). Kernel density evaluation has numerous applications, in scientific computing, statistics, computer vision, machine learning and other fields. In all of them it is necessary to evaluate KDF_P(q) quickly, often for many inputs q and large point-sets P.

"Virtual Reality and Impact" Tech Talk && Coding for Good First Semester Projects Presentation

The UW-Madison Student Group Coding for Good is aiming to use technology to push the change beyond campus. We endorse social entrepreneurship, collaborate and volunteer projects with student orgs, non-profits and community groups.



Facebook: Coding for Good


Talk Description:


Subscribe to UW-Madison Computer Sciences Department RSS