Women-ACM @ UW-Madison is organizing WiDS UW-Madison Regional Event, where we broadcast content from WiDS Stanford and have talks by local speakers involved in Data Science. We will be having a panel followed by talks by accomplished women in Data Science!
Programming by Examples (PBE) is a technique in which a user specifies the
desired behaviour of a program as a set of input-output examples, and the
synthesizer automatically generates a program that is consistent with the
input-output examples. PBE is an especially useful technique in the domain of
data wrangling and providing input-output examples for data wrangling tasks is
significantly easier than manually writing the programs.
The structure-function relationship, where the 3D shape of a protein defines its function, is the theoretical cornerstone behind the success of computer-aided tools for protein engineering, drug design, and drug discovery. The structural dynamics of a protein are critically connected to its function; however, software tools often ignore conformational changes and localized fluctuations in order to reduce the complexity of the modeling process.
This year's SIGMOD Programming Contest (http://sigmod18contest.db.in.tum.de/index.shtml) was about evaluating as fast as possible batches of SPJA (Selection-Projection-Join-Aggregation) queries on a set of immutable relations, under a single-node multicore and in-memory setting. We built from scratch a system called Robin that ranked 1st place on the leaderboard, which was faster by a large margin (40%) than the runner-up solution.
Traditional storage systems interfaces, including POSIX file I/O and block-based interfaces have been a major success. They are easy to understand and use and their decades-long rule have prevented vendor lock-in and encouraged innovation across common interfaces. However, HPC and cloud systems are pushing their scalability, and behind their veneer of simplicity, idiosyncratic "magic" numbers are lurking, destroying performance if applications fail to discover and properly tend to them.
To celebrate the end of the academic year, the Computer Sciences Department invites you to our annual lunch on Monday, April 30th from 11:45 AM - 1:30 PM.
The lunch will be conveniently located over in WID (Wisconsin Inst. for Discovery), in the H.F. DeLuca Forum.
The event is a great opportunity to visit informally with CS faculty and other students, both undergraduates and graduates. At the lunch, we'll announce the winners of the CS Department Awards and Fellowships.
We study an online resource allocation problem where a seller has many items with multiplicities to offer and the items are arranged in a total order. Buyers are interested in buying intervals of items, and have different values for different intervals, drawn from a known distribution. The seller’s goal is to design an online allocation mechanism that maximizes social welfare. Importantly, buyers’ preferences have complementarities, so that recently-developed constant-factor approximations via item prices do not apply, and indeed strong negative results are known.