EECS Prof. Emeriti Ruzena Bajcsy and Eric Brewer have been named 2021 Honorary Fellows of  the American Association for the Advancement of Science (AAAS), one of the scientific community’s highest honors.  Bajcsy, who was elected in the Engineering category, is known for her pioneering and multidisciplinary contributions to machine perception, robotics and artificial intelligence. Her work in the area of active perception revolutionized the field of robotic sensing and vision, as well as the area of elastic matching, which has advanced the field of medical imaging.  Brewer, who is currently the vice-president of infrastructure at Google, was elected in the Information, Computing and Communication category. He is known for his design and development of highly scalable internet services, and innovations in bringing information technology to developing regions.

CS alumna Prof. Marti Hearst (B.A. '85/M.S '89./Ph.D. '94,  advisor: Robert Wilensky), whose primary appointment is in the School of Information, has been named to the 2021 inaugural class of the ACM Special Interest Group on Information Retrieval (SIGIR) Academy. SIGIR Academy membership recognizes the "principal leaders in IR" who have made "significant, cumulative contributions" to the development of the field, and whose "efforts have shaped the discipline and/or industry through significant research, innovation, and/or service."  Hearst literally wrote the first book on Search User Interfaces in 2009.   She is known for her early work on automating sentiment analysis and word sense disambiguation, including the invention of an algorithm known as "Hearst patterns" which is widely used in commercial text mining applications including ontology learning.  She also developed a now well-known approach to automatic segmentation of text into topical discourse boundaries, called TextTiling.  Hearst is an Edge Foundation contributing author and a member of the Usage panel of the American Heritage Dictionary of the English Language. Her current research interests include user interfaces for search engines, information visualization, natural language processing, and MOOCs.

A number of EECS faculty and students are slated to participate in the 2022 Diversity in Tech Symposium, which will be held virtually on March 10 & 11.  This year's theme is "Advancing Climate Resilience."  EECS Prof. Tsu-Jae King Liu, dean of Berkeley Engineering, will warm up the audience with a fireside chat on the symposium's topic;  EECS Prof. Costas Spanos, director of the CITRIS and Banatao Institute, will welcome participants to the second day of the event;  Adjunct Prof. Sascha von Meier will participate in the UC Berkeley-hosted panel Getting to zero: Trends in the built environment; and senior EECS major Katherine Shu will represent WiCSE in a presentation on the Career Fair.  The symposium is open to the public and anyone interested in climate innovation and action, and the advancement of women and underrepresented communities working in technology fields, is encouraged to attend.

CS Prof. Jelani Nelson has won the 2022 Computing Research Association Education (CRA-E) Undergraduate Research Faculty Mentoring Award.  This award recognizes "individual faculty members who have provided exceptional mentorship, undergraduate research experiences and, in parallel, guidance on admission and matriculation of these students to research-focused graduate programs in computing."  Nelson was cited for exceptional mentoring of undergraduate students at a time when "interest in graduate school and research careers is relatively low" and graduate students are crucially needed for "the health of the computing research pipeline."  The award will be presented at a conference later this year.

CS Profs. John Kubiatowicz and Ken Goldberg, along with Berkeley's Director of Research IT, Ken Lutz, have collaborated with the Lawrence Hall of Science (LHS) and the Lawrence Berkeley Lab (LBL) to create an animated series called "Tuff Pupil" which teaches children, ages 7 to 10,  about important cyber security concepts and other global STEM issues. Familiarizing children with these topics has become even more critical since the full-scale adoption of computers for remote learning in response to the pandemic.  Tuff Pupil has so far launched three 5-minute animated video episodes featuring "high school hip hop duo" Taye and Flori (Tommy Soulati Shepherd and Kaitlin McGaw of Grammy-nominated Alphabet Rock) who rap about data privacy in catchy ways that evoke the Schoolhouse Rock shorts of the 1970s and 80s. Parents, educators, librarians and community leaders are encouraged to share these videos with children in their "homes, schools and youth organizations to support conversations about how to safely and smartly use the internet."  New episodes are planned for 2022 which will demystify everyday phenomena related to "data science, climate disruption, contagion, clean energy, and artificial intelligence."

CS Associate Prof. Laura Waller, and Assistant Profs. Sarah Chasins and Nilah Ioannidis, are among the newest cohort of scientists to be named Chan Zuckerberg Biohub Investigators.  The Chan Zuckerberg Biohub Investigator Program, open to faculty from Stanford, UCSF, and UC Berkeley, funds "innovative, visionary research with the goal of building and sustaining an engaged, interactive, and collaborative community of researchers that spans across disciplines and across the three campuses to help solve critical challenges in biomedicine."  Waller leads the Computational Imaging Lab, which develops new methods for optical imaging designed jointly with optics and computational algorithms; Chasins' research focuses on programming languages and program synthesis, with an emphasis on work that brings together programming systems, HCI, and data science; and Ioannidis works on computational methods for personal genome interpretation, including machine learning tools to predict the clinical significance of rare genetic variants of unknown significance and statistical methods to link genetic variation with personal complex disease risks.  Recipients  receive $1M in unrestricted gift funds over a nonrenewable 5-year term ($200,000 per year).

CS Prof. Emeritus David Patterson has won the 2022 Charles Stark Draper Prize for Engineering from the National Academy of Engineering (NAE).  Recognized as one of the world's preeminent awards for engineering achievement, the prize "honors an engineer whose accomplishment has significantly impacted society by improving the quality of life, providing the ability to live freely and comfortably, and/or permitting the access to information."  Patterson, and his co-recipients, John Hennessy, Stephen Furber, and Sophie Wilson, were cited "for contributions to the invention, development, and implementation of reduced instruction set computer (RISC) chips."  Patterson began the seminal Berkeley RISC project in 1980 to design a basic, neutral, freely-available set of microprocessor instructions that could be used in different types of machines and which could be optimized for different characteristics, like efficiency, physical size, and monetary cost.  When different devices are capable of running the same machine code, a better quality, higher-performance machine can replace a less expensive, lower-performance machine without having to replace software.  The open-source Berkeley RISC design was later commercialized by Sun Microsystems as the SPARC architecture, and inspired the ARM architecture used in virtually all new computer chips in the world today.  The biennial Draper prize is open to both NAE members and non-members worldwide, and comes with a $500K cash award.

EE Prof. Chunlei Liu has been named a Fellow of the International Society for Magnetic Resonance in Medicine (ISMRM)  The ISMRM is an international, nonprofit, scientific association "whose purpose is to promote communication, research, development, and applications in the field of magnetic resonance (MR) in medicine and biology and other related topics and to develop and provide channels and facilities for continuing education in the field." Fellowships are bestowed to recognize "a significant and substantial contribution to research in a field within the Society’s purposes, who have contributed in a significant manner to the development of the Society...and/or who have made a significant contribution to education in MR."  Liu is known for pioneering higher-order tensor diffusion MRI,  which utilizes higher-order tensor statistics (variance, sknewness, kurtosis etc.) to measure the diffusion processes in biological tissues. He is also credited with developing susceptibility tensor imaging for mapping bio-magnetism.

CS Profs. Alistair Sinclair and Shafi Goldwasser have won inaugural Test of Time awards at the 2021 Symposium on Theory of Computing (STOC), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT).  Sinclair won the 20 Year award for his paper, “A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries," which solved a problem that had been open for decades. Goldwasser won the 30 Year award for "Completeness theorems for non-cryptographic fault-tolerant distributed computation," which showed how to compute a distributed function even if up to one-third of the participants may be failing, misbehaving, or malicious.  The awards were presented at the 2021 STOC conference in June.

CS alumna and Prof. Shafi Goldwasser (Ph.D. '84, advisor: Manuel Blum) has won the 2021 Foundations of Computer Science (FOCS) Test of Time Award.  This award "recognizes papers published in past Annual IEEE Symposia on Foundations of Computer Science (FOCS) for their substantial, lasting, broad, and currently relevant impact. Papers may be awarded for their impact on Theory of Computing, or on Computer Science in general, or on other disciplines of knowledge, or on practice."  Goldwasser is among five co-authors who won the award in the 30 year category for their groundbreaking complexity theory paper "Approximating Clique is Almost NP-Complete," which used the classification of approximation problems to show that some problems in NP remain hard even when only an approximate solution is needed.