Art and technology have a similar origin, but since 18th century they have been separated from one another (e.g., in Romanticism). However, with the rapid technological advancement, art and technology seem to be reintegrated. Specifically, we see considerable effects of computing and technology on art and aesthetics. On the contrary, relatively little effort has been put to investigate the potential effects of aesthetics on computing. Aesthetic Computing started to address this aspect. Aesthetic Computing is defined as “the application of art theory and practice to computing”.
At this first WICS meeting of the semester we will talk about plans for this semester including the annual University of Iowa Computing Conference. We'll have pizza and drinks.
At this first meeting of the semester, we’ll have pizza, talk about some of the events we have coming up, volunteer opportunities, and cool tech talks.
Lectures will meet, but discussion sections will not meet the first week.
Instructor: Ines Curto, 201E MLH
Lectures and discussion sections will meet the first week.
Instructor: Denise Szecsei, 101J MLH
Synchronous dataflow languages and their compilers are increasingly used to develop safety-critical applications, like fly-by-wire controllers in aircraft and monitoring software for power plants. A striking example is the SCADE Suite tool of ANSYS/Esterel Technologies which is DO-178B/C qualified for the aerospace and defense industries. This tool allows engineers to develop and validate systems at the level of abstract block diagrams that are automatically compiled into executable code.
The Computer Science, Mathematics, and Statistics Departments are offering a new Certificate on Big Data Analysis starting this Fall (2015).
Program synthesis refers to the problem of constructing programs from some kind of specification. In this talk, we discuss two automatic program synthesis techniques. First, we ask the question, how can we synthesize a recursive program from simple examples describing its inputs and outputs? We present a technique that inductively generalizes from the examples to arrive at a recursive function. The tool we will discuss was able to synthesize a range of programs, from integer- to tree-manipulating recursive programs.
This lecture by CS Professor Aaron Stump is part of the Fall 2015 CLAS Master Class, entitled "What We Talk About When We Talk About Love" which brings together some of the College’s best teachers, each of whom will lecture on a single topic, demonstrating how varied experts would differently approach the subject at hand (love!). Students will gather for weekly lectures in the majestic auditorium of Macbride Hall, home of the UI Natural History Museum, and one of the most historic buildings on campus.
In this talk, we explore the performance limits of recovering structured signals from low-dimensional linear projections, using tools from high dimensional convex geometry. In particular, we focus on two signal reconstructions: a total variation minimization for recovering gradients-sparse signals and a low-rank Hankel matrix completion for super-resolution of spectrally sparse signals. Using the tool of Gaussian width, we obtain counter-intuitive performance bounds on the sample complexity for these two applications.
In this talk, I’ll introduce my research on descriptive and predictive analytics for complex social networks from three perspectives:
To support my research, I used various computational and quantitative methods, including network analysis and modeling, data and text mining, agent-based simulations, optimization, and statistical analysis.