Upcoming Events

To submit new events to this listing please login or email jensmith@cs.wisc.edu.

Calendar View

  • Tuesday, October 21, 2014 - 4:00pm to 5:00pm
    Timothy Rhoads, CIBM Postdoctoral Fellow
    Genome Center, UW-Madison

    We recently described a quantitative proteomics approach called NeuCode that provides the accuracy of SILAC while permitting additional multiplexing by leveraging atomic mass defects along with high resolution mass spectrometry. Additionally, since the comparisons between samples are all done with heavy labeled amino acids, rather than light to heavy as in SILAC, we can acquire accurate quantitative information from samples with less than 100% label incorporation. This makes NeuCode particularly amenable to in vivo labeling in multicellular organisms.

  • Thursday, October 23, 2014 - 11:00am to 12:00pm
    Christoph Koch
    EPFL

    It has been said that all problems in computer science can be solved by adding another level of indirection, except for performance problems, which are solved by removing levels of indirection. Compilers are our tools for removing levels of indirection automatically. However, we do not trust them when it comes to systems building. Performance-critical systems such as database systems are built in low-level programming languages such as C.

  • Thursday, October 23, 2014 - 4:00pm to 5:00pm
    Mary Czerwinski
    Microsoft Research

    In this talk, novel systems we designed that allow users to reflect upon their moods while doing daily events will be described. We are building systems and applications that perform mood detection in real time using mobile technology. We are exploring novel user interface applications to help users reflect upon and manage their affective experiences. Many questions remain from our work, in terms of how useful a system like this would be over the long term and how valuable a personalized, mobile, awareness system might be in real time. Finally, we feel that there is a huge opportunity in the remote familial space, or in a close social network, where knowing about the emotional health of separated loved ones or close friends comes in to play. These new research areas are also tightly coupled to privacy issues. A few examples of applications in some of these new areas will be presented.

  • Friday, October 24, 2014 - 10:00am to 12:00pm
    Jason Power
    UW-Madison

    Committee: Dr. Mark Hill (Advisor)
    Dr. David Wood (Advisor)
    Dr. Dan Negrut
    Dr. Jignesh Patel
    Dr. Karu Sankaralingam

  • Monday, October 27, 2014 - 12:15pm to 1:15pm
    Karthik Ramachandra
    Microsoft

    Queries containing user-defined functions (UDFs) are widely used, since they allow queries to be written using a mix of imperative language constructs and SQL, thereby increasing the expressive power of SQL; further, they encourage modularity, and make queries easier to understand. However, not much attention has been paid to their optimization, except for simple UDFs without imperative constructs. Queries invoking UDFs with imperative constructs are executed using iterative invocation of the UDFs, leading to poor performance, especially if the UDF contains queries.

  • Tuesday, October 28, 2014 - 4:00pm to 5:00pm
    Kurt Weiss, CIBM Postdoctoral Fellow
    Department of Psychiatry, UW-Madison

    While sleep behavior (reduced activity and a decreased arousal threshold) is present in all species that have been assayed, its biological function remains unclear. The synaptic homeostasis hypothesis of sleep suggests that in a waking state, synaptic potentiation continually occurs as a result of learning and memory formation and sleep is needed to curtail this process by reducing ancillary synaptic connections.  We are using serial block-face scanning electron microscopy (SBF-SEM) to assay ultrastructural changes in the brains of sleep deprived and rested rodents and flies.

  • Wednesday, October 29, 2014 - 4:00pm to 5:00pm
    tba
    VMWare

    tba

  • Tuesday, November 4, 2014 - 4:00pm to 5:00pm
    Matthew Watkins
    Bucknell University

    TBA

  • Wednesday, November 5, 2014 - 7:00pm
    Raissa D'Souza
    UC-Davis, Department of Aerospace & Mechanical Engineering

    The Center for Complexity and Collective Computation (C4) at WID presents the John von Neumann Public Lecture Series in Complexity and Computation, featuring Raissa D'Souza from the Department of Aerospace & Mechanical Engineering at the University of California-Davis.  D'Souza will lead a talk titled, “The Science of Networks: Modeling Our Complex, Interdependent World.”

  • Monday, November 10, 2014 - 1:00pm to 2:00pm
    Pranjal Awasthi
    Princeton University

    We study the problem of learning halfspaces in the malicious noise model of Valiant. In this model, an adversary can corrupt an η fraction of both the label part and the feature part of an example. We design a polynomial-time algorithm for learning halfspaces in R^d under the uniform distribution with near optimal noise tolerance.

    Our results also imply the first active learning algorithm for learning halfspaces that can handle malicious noise.

    Joint work with Nina Balcan and Phil Long.

  • Monday, November 10, 2014 - 4:00pm
    Prof. Krishna V. Palem
    Rice University

    Well over a decade ago, many believed that an engine of growth driving the semiconductor and computing industries, captured nicely by Gordon Moore’s remarkable prophecy (Moore’s law), was speeding towards a dangerous cliff-edge. Ranging from expression of concern to doomsday scenarios, the exact time when serious hurdles would beset us varied quite a bit—some of the more optimistic warnings giving Moore’s law till 2020!

  • Tuesday, November 11, 2014 - 4:00pm
    Mark D. Hill & David Wood
    University of Wisconsin-Madison

    Graphics Processing Units (GPUs) are being re-purposed to perform general-purpose computations as they offer the potential for better performance and and lower energy than conventional CPUs for some workloads. Effective use of GPGPUs, however often requires the programmer and/or runtime software to explicitly manage the logical name (address) and/or physical location of data. It is our hypothesis--shared by some--that GPGPUs can be made more generally effective if all CPU-GPU program threads can access data via a uniform virtual address backed by hardware data movement support.

  • Wednesday, November 26, 2014 - 12:00pm to 1:00pm
    Veljko M. Milutinovic
    University of Belgrade

    This presentation analyses the essence of DataFlow SuperComputing, defines its advantages and sheds light on the related programming model. DataFlow computers, compared to ControlFlow computers, offer speedups of 20 to 200 (even 2000 for some applications), power reductions of about 20, and size reductions of also about 20. However, the programming paradigm is different, and has to be mastered. The talk explains the paradigm, using Maxeler as an example, and sheds light on the ongoing research in the field. Examples include Physics, Engineering, DataMining, FinancialAnalytics, etc.

  • TBD
    Tuesday, December 2, 2014 - 4:00pm
    Hadi Esmaeilzadeh
  • Tuesday, December 9, 2014 - 4:00pm to 5:00pm
    Jayneel Gandhi
    UW Madison

    Virtualization provides value for many workloads, but its cost rises for workloads with poor memory access locality. This overhead comes from translation lookaside buffer (TLB) misses where the hardware performs a 2D page walk (up to 24 memory references on x86-64) rather than a native TLB miss (up to only 4 memory references). The first dimension translates guest virtual addresses to guest physical addresses, while the second translates guest physical addresses to host physical addresses.

  • Thursday, January 29, 2015 - 4:00pm to 5:00pm
    Ben Bederson
    University of Maryland, College Park

    TBA.