BEGIN:VCALENDAR VERSION:2.0 PRODID:Data::ICal 0.19 X-LIC-LOCATION:America/Los_Angeles X-WR-CALNAME:UW CSE Colloquium Calendar X-WR-TIMEZONE:America/Los_Angeles BEGIN:VEVENT DESCRIPTION:The Web has transformed the nature of creative work. For the fi rst time\, millions of people have a direct outlet for sharing their creat ions with the world. As a result\, the Web has become the largest reposito ry of design knowledge in human history\, and the ensuing "democratization of design" has created a critical feedback loop\, engendering a new cultu re of reuse and remixing.\n \nThe means and methods designers employ to dr aw on prior work\, however\, remain mostly informal and ad hoc. How can co ntent producers find relevant examples amongst hundreds of millions of pos sibilities and leverage existing design practice to inform and improve the ir creations? My research explores data-driven techniques for working with examples at scale during the design process\, automating search and curat ion\, enabling rapid retargeting\, and learning generative probabilistic m odels to support new design interactions. Knowledge discovery and data min ing have revolutionized informatics\; in this talk\, I'll discuss what we can learn from mining design.\n \nbio\nRanjitha Kumar is a PhD candidate i n the Computer Science Department at Stanford University\, where she build s principled\, data-driven tools for amplifying human creativity in design . Her work has received best paper awards or nominations at both of the pr emiere HCI conferences (CHI and UIST)\, and been recognized by the machine learning community through invited papers at IJCAI and ICML. She is the r ecipient of the 2011 Google PhD Fellowship in Design Development\, and hol ds a BS in Computer Science from Stanford. DTEND:20130402T163000 DTSTART:20130402T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Ranjitha Kumar (Stanford University): Design Min ing the Web UID:20130402T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2345 END:VEVENT BEGIN:VEVENT DESCRIPTION:TSP is a central and perhaps one of the most well-known problem s in theoretical computer science. Due to its combination of simplicity\, appeal to imagination\, and intractability\, TSP has attracted the attenti on of mathematicians and computer scientists for decades. Despite this att ention\, the best approximation algorithm known for TSP goes back to 1976. In his unpublished manuscript\, Christofides presented a simple 3/2-appro ximation algorithm for the problem.\n \nIn a joint work with Saberi and Si ngh\, we design a new approximation algorithm for a canonical special case of the TSP known as graphic TSP. This algorithm finally breaks the 3/2 ba rrier by a very small constant. Our algorithm employs a new technique for rounding the optimum fractional solution of linear programming relaxation s of\ncombinatorial optimization problems\, called the rounding by samplin g method. Our analysis builds on recent developments in probability theor y on properties of strongly Rayleigh measures\, as well as new insights fr om combinatorics and polyhedral theory. As a byproduct of our result\, we show new properties of near minimum cuts of any graph\, which may be of in dependent interest.\n \nBio:\nShayan Oveis Gharan is currently finishing h is PhD at Stanford University under the supervision of Amin Saberi. Prior to Stanford\, Shayan received a BA in computer engineering from Sharif Uni versity of Technology. His research interests\ninclude Approximation Algor ithms\, Spectral Algorithms\, Online Algorithms and Applied Probability. H e is a recipient of several awards including best paper award at SODA 2010 and FOCS 2011 for his works on the Traveling Salesman Problem\, Stanford Graduate Fellowship\, and the Miller Fellowship. DTEND:20130404T163000 DTSTART:20130404T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Shayan Oveis Gharan (Stanford University): New A pproximation Algorithms for Traveling Salesman Problem UID:20130404T153000b@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2360 END:VEVENT BEGIN:VEVENT DESCRIPTION:Procedural tasks such as following a recipe or editing an image are very common. They require a person to execute a sequence of operation s (e.g. chop onions\, or sharpen the image). People commonly use step-by-s tep tutorials to learn these tasks. We focus on the domain of photo manipu lations and have developed tools and techniques to help people learn\, com pare and automate photo manipulation procedures. We present a demonstratio n-based system for automatically generating succinct step-by-step visual t utorials of photo manipulations. Our tutorials are quick to generate. More over\, users are faster and make fewer errors with our tutorials compared to book and video tutorials. We also demonstrate a new interface that allo ws learners to browse\, analyze and compare large collections (i.e. thousa nds) of photo manipulation tutorials based on their command-level structur e. Finally\, we present a framework for generating content-adaptive macros (programs) that can transfer complex photo manipulation procedures to new target images. Together these tools allow people to learn\, compare and a utomate procedural knowledge. \n \nBio: \nFloraine Berthouzoz is a Ph.D. c andidate in the Computer Science Department at the University of Californi a\, Berkeley. Her research lies at the intersection of computer graphics a nd human-computer interactions\, and aims at building tools that ultimatel y make it faster and easier for people to create high quality visual conte nt. She has also developed a number of techniques that improve the way peo ple learn procedural instructions. She is the recipient of a 2009 ETH Meda l of Honor and a 2010 Google Anita Borg Memorial Scholarship. During her g raduate studies\, Floraine worked as a visiting researcher at the Universi ty of Tokyo\, the Hebrew University\, Columbia University and Adobe System s. Floraine also co-founded CS KickStart\, an outreach program for incomin g undergraduate women. Since 2011\, this program has significantly increas ed the number of undergraduate women pursuing computer science degrees at Berkeley. \nFloraine's webpage\n DTEND:20130411T163000 DTSTART:20130411T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Floraine Berthouzoz (UC Berkeley): Teaching Peop le and Machines how to Enhance Images UID:20130411T153000b@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2361 END:VEVENT BEGIN:VEVENT DESCRIPTION:As our dependence on software grows\, so too do the risks posed by programming errors. In principle\, programmers could eliminate the dan gerous and exploitable errors that plague modern systems by formally provi ng their code correct. Unfortunately\, the overwhelming burden of construc ting such machine-checkable proofs has made formal verification prohibitiv ely expensive for most applications.\n \nIn this talk I will describe tech niques I developed to radically reduce the formal verification proof burde n. In particular\, I will focus on formal shim verification\, a new method to scale formal verification up to large systems. With formal shim verifi cation\, a system is partitioned into components which must interact and a ccess resources through a narrow interface known as the shim. By sandboxin g all untrusted components and verifying the shim\, we can establish forma l correctness guarantees for the entire system while only reasoning about a tiny fraction of the code. We applied formal shim verification to guaran tee several important security properties in a new\, modern web browser du bbed QUARK. In addition\, I will also briefly discuss my previous work on automated\, domain specific language (DSL) based techniques to reduce the proof burden for formally verifying compiler optimizations.\n \nBio:\nZach Tatlock is a PhD candidate in Computer Science and Engineering at UC San Diego where he is a member of the Programming Systems group. He received B S degrees in Computer Science and Mathematics from Purdue University. His research draws upon proof assistants\, Satisfiability Modulo Theories (SMT ) solvers\, and type systems to improve software reliability and security in domains ranging from embedded database query languages and compiler opt imizations to web browsers. DTEND:20130416T163000 DTSTART:20130416T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Zachary Tatlock (UC San Diego): Securing Softwar e via Design and Proof UID:20130416T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2363 END:VEVENT BEGIN:VEVENT DESCRIPTION:Modern web applications are developed largely in so-called "dyn amic" or "scripting" languages like JavaScript\, PHP\, and Python. In addi tion to being untyped\, these languages sport several features -- run-time type tests\, value-indexed dictionaries\, and dynamic code loading -- tha t make it easy to rapidly prototype and to glue together applications from disparate components. As applications grow large\, however\, the lack of static typing makes it difficult to achieve reliability and\nmaintainabili ty. Moreover\, third-party code like ads and browser extensions are routin ely downloaded and run in the client's browser\, and the flexibility of sc ripting languages makes it hard to ensure security.\n \nIn the first part of this talk\, I will present Dependent JavaScript (DJS)\, a statically ty ped dialect that facilitates precise reasoning about JavaScript and other web scripting languages. I will describe the major obstacles that have sty mied prior attempts at static reasoning for JavaScript\, and I'll outline how DJS overcomes them using several key innovations based on refinement t ypes.\n \nIn the second part of the talk\, I will show how to build on DJS to verify security properties of third-party JavaScript. After describing preliminary experiments that use DJS to author provably-secure JavaScript browser extensions\, I will identify several future directions of work th at will lead to a platform for fine-grained web security.\n \nBio:\nRavi C hugh is a Computer Science Ph.D. student at UC San Diego and holds master' s and bachelor's degrees from the University of Pennsylvania. Ravi's resea rch interests include developing programming language techniques (such as type systems\, dataflow analyses\, and run-time instrumentation) to improv e software reliability. DTEND:20130418T163000 DTSTART:20130418T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Ravi Chugh (UC San Diego): Static Verification f or Web Scripting Languages UID:20130418T153000d@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2364 END:VEVENT BEGIN:VEVENT DESCRIPTION:Advances in robotics research and supporting technologies are e nabling the development of more and more sophisticated general-purpose rob ots. These robots could carry out useful tasks for and with humans\, in ap plication domains ranging from elder care to manufacturing. Given the dive rsity of the operation environments and user needs for such robots\, it is infeasible to fully program them prior to their deployment. Therefore\, a key challenge is to enable end-users to program a general-purpose robot f or their own unique purposes. In this talk\, I will highlight some of the challenges in allowing everyday people\, who have no prior experience with robots or programming\, to teach new skills or tasks to a robot. I will p resent techniques that I have developed for addressing those challenges\, focusing on mechanisms for the robot to ask questions to its user. I will demonstrate how user-studies involving real human-robot interactions can l ead to alternative representations\, algorithms and user-interfaces that i mprove the efficiency and effectiveness of the robot\, as well as the user experience. I will conclude with a research agenda towards long-term depl oyment of end-user programmable robots.\n \nBio: \nMaya Cakmak is a post-d octoral research fellow at Willow Garage. She received her Ph.D. in Roboti cs from the Georgia Institute of Technology in 2012. Her research interest s are at the intersection of Human-Robot Interaction and Programming by De monstration. In particular\, her research aims to develop functionalities and interfaces for personal robots that can be programmed by their end-use rs to assist everyday tasks. Maya's work has been published at major Robot ics and AI conferences and journals\, demonstrated live in various venues and has been featured in numerous media outlets. DTEND:20130425T163000 DTSTART:20130425T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Maya Cakmak (Georgia Tech): Enabling End-Users t o Program General-Purpose Robots UID:20130425T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2383 END:VEVENT BEGIN:VEVENT DESCRIPTION:Virtualization software is increasingly a part of the infrastru cture behind our online activities. The companies and institutions that pr oduce online content are taking advantage of the "infrastructure as a serv ice" cloud computing model to obtain cheap and reliable computing power. T hese content producers -- news media organizations\, social networking sit es\, online shopping companies\, universities\, and government agencies -- rent compute time from the cloud provider during which they can run their entire software stack on the cloud provider's server. The cloud providers are able to provide cheap computing power by letting multiple client oper ating systems share a single physical machine\, and they use virtualizatio n technology to do that. The virtualization layer also provides isolation between guests\, protecting each from unwanted access by the co-tenants. \ n \nIn this talk I will discuss my research toward verifying the security of this virtualization layer\, and in particular\, the isolation propertie s. I will discuss some of the challenges and opportunities in using tradit ional formal methods to verify security properties at this level of the so ftware stack\, and I will present a new methodology\, based on model check ing\, for handling one of the biggest challenges: verification in the face of very large data structures. One weakness of using model checking is th at the verification result is only as good as the model\; I will also pres ent work I've done to give stronger confidence in the validity of the mode l. DTEND:20130430T163000 DTSTART:20130430T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Cynthia Sturton (University of California\, Berk eley): Secure Virtualization with Formal Methods UID:20130430T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2367 END:VEVENT BEGIN:VEVENT DESCRIPTION:Every integrated circuit is released with latent bugs. The dama ge and risk implied by an escaped bug ranges from almost imperceptible to potential tragedy\; unfortunately it is impossible to discern within this range before a bug has been exposed and analyzed. While the past few decad es have witnessed significant efforts to improve verification methodology for hardware systems\, these efforts have been far outstripped by the mass ive complexity of modern digital designs\, leading to product releases for which an always smaller fraction of system's state has been verified. The news of escaped bugs in large market designs and safety critical domains is alarming because of safety and cost implications (due to replacements\, lawsuits\, etc.).\n \nThis talk will present some of our solutions to sol ve the verification challenge\, such that users of future designs can be a ssured that their devices will operate completely free of bugs. We will at tack the problem both at design-time\, with statistical techniques to be d eployed during post-silicon validation\; and after deployment in the field \, with novel solutions that can steer clear of escaped bugs after a syste m has been shipped.\n \nBio:\nValeria Bertacco is an Associate Professor o f Electrical Engineering and\nComputer Science at the University of Michig an. Her research interests are in\nthe area of design correctness\, with e mphasis on digital system reliability\,\npost-silicon and runtime validati on\, and hardware-security assurance. Valeria\njoined the faculty at the U niversity of Michigan in 2003\, after being in the\nAdvanced Technology Gr oup of Synopsys for four years as a lead developer of Vera\nand Magellan. During the Winter of 2012\, she was on sabbatical at the Addis\nAbaba Inst itute of Technology in Ethiopia.\n \nValeria is the author of three books on design errors and validation. She\nreceived her M.S. and Ph.D. degrees in Electrical Engineering from Stanford\nUniversity in 1998 and 2003\, res pectively\; and a Computer Engineering degree\n("Dottore in Ingegneria") s umma cum laude from the University of Padova\, Italy\nin 1995. Valeria is the recipient of the IEEE CEDA Early Career Award\, NSF\nCAREER award\, th e Air Force Office of Scientific Research's Young Investigator\naward\, th e IBM Faculty Award and the Vulcans Education Excellence Award from the\nU niversity of Michigan. DTEND:20130507T163000 DTSTART:20130507T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Valeria Bertacco (University of Michigan): Makin g system-level lemonade out of hardware lemons UID:20130507T153000b@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2380 END:VEVENT BEGIN:VEVENT DESCRIPTION:Wireless communication has already enabled the phenomenal growt h of mobile computing. But what other impacts can Maxwell's four humble eq uations have on the world of computing? In this talk I will show some exam ples of how advances in the wireless world can change the way we think abo ut computing through innovations in energy\, communication\, sensing\, and imaging.\n \nOne example is a tiny wireless backpack that enables neural and EMG telemetry from dragonflies in flight\, with a 5 Mbps uplink\, 1.2m W total power\, and a weight of only 38 mg. The backpack is wirelessly pow ered and employs a modulated backscatter communication link that achieves an energy cost of only a few pJ/bit\, over 100X lower power per bit than W i-Fi. I will then present results that extend MIMO techniques from communi cation to wireless power transmission\, to enhance long range wireless pow er delivery to mobile devices\, and some results\, recently reported in Sc ience\, on lensless compressive imaging at millimeter wavelengths.\n \nSpe aker Bio:\nMatt Reynolds is the Nortel Networks Assistant Professor in the Department of Electrical and Computer Engineering at Duke University. He is also co-founder of the RFID systems firm ThingMagic Inc (acquired by Tr imble Navigation)\, the energy conservation firm Zensi (acquired by Belkin )\, and the home sensing company SNUPI Inc. \n \nMatt's research interests include RFID\, energy efficiency at the physical layer of wireless commun ication\, and the physics of sensing and actuation. Matt received the Ph.D . from the MIT Media Lab in 2003\, where he was a Motorola Fellow\, as wel l as S.B. and M.Eng. degrees in Electrical Engineering and Computer Scienc e from MIT. He is a Senior Member of the IEEE\, has received five Best Pap er awards\, and has 13 issued and over 30 pending patents. DTEND:20130509T163000 DTSTART:20130509T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Matt Reynolds (MIT/Duke University): Wireless Be yond Wi-Fi UID:20130509T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2366 END:VEVENT BEGIN:VEVENT DESCRIPTION:Energy and power constraints have emerged as one of the greates t lingering challenges to progress in the computing industry. In this talk \, I will highlight some of the "rules" of low-power design and show how t hey bind the creativity and productivity of architects and designers. I be lieve the best way to deal with these rules is to disregard them\, through innovative design solutions that abandon traditional design methodologies . Releasing oneself from these ties is not as hard as one might think. To support my case\, I will highlight two rule-breaking design technologies f rom my work. The first technique (Razor) combines low-power designs with r esiliency mechanisms to craft highly introspective and efficient systems. The\nsecond technique (Subliminal) embraces subthreshold voltage design\, which holds great promise for highly energy efficient systems.\n \nBIO:\nT odd Austin is a Professor of Electrical Engineering and Computer Science a t the University of Michigan in Ann Arbor. His research interests include computer architecture\, robust system design\, hardware and software verif ication\, and performance analysis tools and techniques. Prior to joining academia\, Todd was a Senior Computer Architect in Intel's Microcomputer R esearch Labs\, a product-oriented research laboratory in Hillsboro\, Orego n. Todd is the first to take credit (but the last to accept blame) for cre ating the SimpleScalar Tool Set\, a popular collection of computer archite cture performance analysis tools. Todd is co-author (with Andrew Tanenbaum ) of the undergraduate computer architecture textbook\, "Structured Comput er Architecture\, 6th Ed." In addition to his work in academia\, Todd is f ounder and President of SimpleScalar LLC and co-founder of InTempo Design LLC. In 2002\, Todd was a Sloan Research Fellow\, and in 2007 he received the ACM Maurice Wilkes Award for "innovative contributions in Computer Arc hitecture including the SimpleScalar Toolkit and the DIVA and Razor archit ectures." Todd received his PhD in Computer Science from the University of Wisconsin in 1996. DTEND:20130514T163000 DTSTART:20130514T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Todd Austin (University of Michigan): On the Rul es of Low Power Design (and Why You Should Break Them) UID:20130514T153000b@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2381 END:VEVENT BEGIN:VEVENT DESCRIPTION:Modern computer networks perform a bewildering array of tasks\, from routing and traffic monitoring\, to access control and server load b alancing. Moreover\, historically\, managing these networks has been hide ously complicated and error-prone\, due to a heterogeneous mix of devices (e.g.\, routers\, switches\, firewalls\, and middleboxes) and their ad hoc \, closed and proprietary configuration interfaces.\nSoftware-Defined Netw orking (SDN) is poised to change this state of affairs by offering a clean \, simple and open interface between network devices and the software that controls them. In particular\, many commercial switches now support the OpenFlow protocol\, and a number of campus\, data-center\, and backbone ne tworks have deployed the new technology.\n \nHowever\, while SDN makes it possible to program the network\, it does not make it easy: The first gene ration of SDN controllers offered application developers the "assembly lan guage" of network programming platforms. To reach SDN's full potential\, research in programming languages and compilers is desperately needed. In this talk\, I discuss our work to date on the Frenetic project\, which in volves the design of language\, compiler and run-time system support for S DN programming. Our languages allow programmers to work declaratively\, s pecifying global behaviors of their network at a high level of abstraction . The compiler and run-time system take care of the tedious details of im plementing these high-level policies using the OpenFlow protocol.\n \nA ke y strength of our design is its support for modular programming.\nComplex network applications can be decomposed in to logical subcomponents --- an access control policy\, a load balancer\, a traffic monitor\, a router --- and coded independently. Frenetic's rich combinator library makes it pos sible to stitch such components back together to form a fully functioning whole. In this talk\, we will discuss our latest design ideas\, including technology that allows programmers to define abstract\, virtual networks and isolated network slices. We will also touch on the semantics of Frene tic\, explain some of its key properties\, and describe a few of the algor ithms needed to implement it.\nFrenetic language\n \n------\n \nBio:\nDavi d Walker is a Professor of Computer Science at Princeton University\, havi ng received tenure in July 2008 and the rank of full professor in February 2013. He received his B.Sc. from Queen's University (Canada) in 1995 and his Ph.D. in Computer Science from Cornell University in 2001. At Prince ton\, he studies programming languages\, compilers\, type systems\, and do main-specific languages.\nAfter arriving at Princeton in February 2002\, h e won an NSF Career award in 2003 and Alfred Sloan Fellowship in 2004. In 2007\, with his students and colleagues at Princeton\, he won the PLDI be st paper award for the paper entitled "Fault-Tolerant Typed Assembly Langu age." In 2008\, his paper "From System F to Typed Assembly Language\,"\nc o-authored with Greg Morrisett\, Karl Crary and Neal Glew\, won a 10-year retrospective award for the highest impact POPL 1998 paper.\nIn 2013\, wit h his students and colleagues at Princeton and Cornell\, he won the NSDI c ommunity award for his paper on "Composing Software-Defined Networks." He is currently serving as an associate editor for the ACM Transactions on P rogramming Languages and Systems and for Foundations and Trends in Program ming Languages. DTEND:20130515T143000 DTSTART:20130515T133000 LOCATION:691\, Gates Commons\, Paul G. Allen Center for Computer Science & Engineering SUMMARY:Research Seminar: David Walker (Princeton University): Networking: A killer app for programming languages researchers UID:20130515T133000@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2403 END:VEVENT BEGIN:VEVENT DESCRIPTION:NOTE: This talk will NOT be broadcast live\, nor will it be tap ed for future on-demand or UWTV viewing. It will be taped for internal CS E/EE use only.\n \nThis talk will present our work on scaling the platform s and protocols for pervasive and perpetual computing at scale\, from mill iwatt mobile sensors to microwatt motes to nanowatt smart dust\, enabling multi-scale sensing of people\, places\, and things. We will begin by see ing how it is possible to hijack power and bandwidth from the mobile phone 's audio interface to create a new class of disruptive\, phone-centric per ipherals. Looking ahead\, we will discuss how the next tier of computing - pervasive\, wireless\, networked\, energy-harvesting sensors with ever-d ecreasing dimensions\, from cubic-cm to cubic-mm - will lead to perpetual monitoring of the built and natural environments. Our work at the cm-scal e has shown the viability of wireless nodes built from commercial off-the- shelf components to operate from ambient indoor light levels (~5 uW) and d eliver sensor readings wirelessly to already existing battery-powered sens or networks\, thus extending their reach without sacrificing a decade of p rogress in multi-hop routing while achieving 25-50x lower power per sense point. At the mm-scale\, we are creating a modular\, stacked-die architec ture to finally realize the decades-old vision of smart dust\, with a full y self-contained wireless sensor system operating on ultralow power budget s (~10 nW). The common thread in this work is that scaling sensors presen ts challenges at every level of the system\, including multi-tier network architecture\, power supply design and interface\, timer systems\, communi cations primitives\, discovery protocols\, and system software. Taking a quantitative and systems-oriented approach\, this talk will highlight some of the key system architecture challenges and our solutions to them. \n \ nBio: \nPrabal Dutta is an Assistant Professor at the University of Michig an\, Ann Arbor. He researches the circuits\, systems\, and software neces sary to realize pervasive sensing\, computing\, and communications at scal e and in the service of society. His work has yielded over a dozen hardwa re and software systems\, has won four best paper awards and several desig n awards\, has been directly commercialized by Aginova\, Arch Rock (now Ci sco)\, Crossbow (now Memsic)\, Moteiv (now Sentilla)\, Moteware\, Seeed St udio\, Sonnonet\, and Vectare (and indirectly by dozens more)\, and has be en utilized by thousands of researchers and practitioners worldwide. His work was recognized with an Intel Early Career Award and he was named a Mi crosoft Research Faculty Fellowship Finalist. His students have won a num ber of awards including three NSF Fellowships\, an NDSEG Fellowship\, a Mi crosoft Women's Scholarship\, and a Qualcomm Innovation Fellowship (honora ble mention). He earned a Ph.D. in Computer Science from the University o f California\, Berkeley in 2009\, where he designed and deployed some of t he largest academic sensor networks\, and where his work was supported by NSF and Microsoft Graduate Fellowships. DTEND:20130516T163000 DTSTART:20130516T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Prabal Dutta (University of Michigan): From Perv asive to Perpetual Computing: Realizing the Next Computing Class UID:20130516T153000c@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2384 END:VEVENT BEGIN:VEVENT DESCRIPTION:Advances in computer and information science and engineering ar e catalyzing a societal transformation. We are witnessing unprecedented gr owth of scientific and social data\, deep integration of the cyber and phy sical worlds\, wireless connectivity at broadband speeds\, and seamless ac cess to resources in the "cloud." These advances are transforming the way we work\, play\, communicate\, learn and discover. Investments in ambitiou s\, long-term research and infrastructure\, as well as in the development of a computing and information technology workforce\, are national imperat ives in this new era of data and information.\n\n\nThis talk will focus on the technological advances and emerging frontiers that are shaping our fu ture and accelerating the pace of discovery and innovation across all scie nce and engineering disciplines. It will also describe how these trends in form the National Science Foundation's priorities and programs. These effo rts provide a foundation for economic competitiveness and will drive new i nnovations supporting our national priorities\, such as sustainability\, s mart transportation\, disaster resilience\, education and life-long learni ng\, public safety\, and national security. \n \nSPEAKER BIO:\n\n\n\nFarna m Jahanian leads the National Science Foundation Directorate for Computer and Information Science and Engineering (CISE) . He guides CISE\, with a b udget of over $850 million\, in its mission to uphold the Nation's leaders hip in scientific discovery and engineering innovation through its support of fundamental research in computer and information science and engineeri ng as well as transformative advances in cyberinfrastructure. \n \nDr. Ja hanian is on leave from the University of Michigan\, where he holds the Ed ward S. Davidson Collegiate Professorship and served as Chair for Computer Science and Engineering from 2007 - 2011 and as Director of the Software Systems Laboratory from 1997 - 2000. His research on Internet infrastructu re security formed the basis for the Internet security company Arbor Netwo rks\, co-founded in 2001\, where he served as Chairman until its acquisiti on in 2010. Dr. Jahanian holds a master's degree and a Ph.D. in Computer S cience from the University of Texas at Austin. He is a Fellow of ACM\, IEE E and AAAS. DTEND:20130523T163000 DTSTART:20130523T153000 LOCATION:EEB-105 SUMMARY:UW CSE Colloquium: Farnam Jahanian (NSF Assistant Director for Comp uter and Information Science and Engineering (CISE) ): Innovating for Soci ety: Realizing the Transformative Impact of Computing and Communication UID:20130523T153000c@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2394 END:VEVENT BEGIN:VEVENT DESCRIPTION:TBD DTEND:20130606T163000 DTSTART:20130606T153000 LOCATION:EEB-105 SUMMARY:CSE 481D: Various (UW CSE Capstone course): Games Capstone Present ation UID:20130606T153000a@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2404 END:VEVENT BEGIN:VEVENT DESCRIPTION:TBD DTEND:20131031T163000 DTSTART:20131031T153000 LOCATION:EEB-105 SUMMARY:CSE Distinguished Lecture Series: TBD TBD (TBD): TBD UID:20131031T153000@colloquia.cs.washington.edu URL:http://www.cs.washington.edu/htbin-post/mvis/mvis?ID=2382 END:VEVENT END:VCALENDAR