New Faces at CUCS Every Other One and Compute Nearest Neighbor, a Search Their Similarity for Each Pair

Total Page:16

File Type:pdf, Size:1020Kb

New Faces at CUCS Every Other One and Compute Nearest Neighbor, a Search Their Similarity for Each Pair NEWSLETTER OF THE DEPARTMENT OF COMPUTER SCIENCE AT COLUMBIA UNIVERSITY VOL.12 NO.1 SPRING 2016 straightforward for small data Rather than searching an entire sets: compare every object to data set for the single most New Faces at CUCS every other one and compute nearest neighbor, a search their similarity for each pair. would go much faster if objects But as the number of objects were pre-grouped according to increases into the billions, com- some shared attribute, making it puting time grows quadratically, easy to zero in on just the small he impact of huge data making the task prohibitively subset of objects most likely to sets is hard to understate, contain the most similar neigh- responsible for advancing expensive, at least in terms of T traditional expectations. bor. The new challenge then almost every scientific and becomes: what attribute shall we technological field, from ma- Alexandr Andoni, a theoretical use to make such a pre-grouping chine learning and personalized computer scientist focused on maximally efficient. The speed-up medicine, to speech recognition developing algorithmic founda- thus gained reverberates across and translation. tions for massive data, sees the a wide range of computational The flip side of the data revolu- need to reframe the issue: “The methods since nearest neigh- tion is that massive data has question today is not ‘what can bors search is ubiquitous and ALEXANDR ANDONI rendered many standard algo- we solve in polynomial time?’ serves as a primitive in higher- level algorithms, particularly in ASSOCIATE PROFESSOR rithms computationally expen- but ‘what is possible in time machine learning. OF COMPUTER SCIENCE sive, necessitating a wholesale proportional to data size, or even Advancing the algo- rethinking of even the most less?’ With all this data, what More generally, in the same basic computational methods. is the best we can do given the spirit of relying on (approximate) rithmic foundations To take one example: Nearest resources? Fortunately, vast im- attributes to speed operations, of massive data neighbors search, the classic provements are possible in both Andoni has developed a theory method since the 70s for find- theory and practice once we of sketching that represents ing similarity among objects, is settle for approximate answers.” complex objects by smaller, CS@CU SPRING 2016 1 Cover Story (continued) simpler “sketches” that capture where the ability to provide com- issues related to security and novel by Philip K. Dick—inserts a fiers to find security risks? I’m level of interactivity is not yet Part of the problem is that the For Wu, the natural progres- the main structure and essen- putationally efficient solutions privacy. It’s a wide-open field. privacy protection layer that inter- fortunate to be working within possible for massive data sets. database and the visualization sion is to extend the declara- tial properties of the original depends on the development of cepts the data apps receive and Columbia’s Data Science Insti- communities have traditionally tive approach to interactive Two years ago, for his thesis he “Computing power has grown, objects yet use less (sublinear) new algorithms.” displays it in a console so users tute alongside machine learners been separate, with the data- visualizations. With colleagues looked hard at the security risks data sets have grown, what space and time to compute. For can see and, if they want, limit who can build such classifiers.” base side focusing on efficient at Berkeley and University of Andoni also looks for inspiration inherent in perceptual comput- hasn’t kept pace is the ability many tasks, such as estimating how much data is passed on For guarding against buggy code, query processing and accuracy, Washington, Wu is designing from students. “You feel the new ing, where devices equipped to visualize and interact with similarity of a pair of objects, a to the app. The platform, which Jana imagines adapting program and the visualization commu- a declarative visualization lan- energy. Students are excited, and with cameras, microphones, and all this data in a way that’s sketch may work just as well integrates with the popular analysis, an existing technology nity focusing on usability and guage to provide a set of logical that excitement and enthusiasm sensors are able to perceive the easy and intuitive for people to as a fully realized object. While computer vision library OpenCV, for automatically finding software interactions. Says Wu, “If you operations and mappings that is invigorating. It leads you to world around them so they can understand,” says Eugene Wu, relaxing strict formulations is is designed to make it easy for bugs, so it specifically searches look at visualizations from a would free programmers from think about even things you’ve operate and interact more intel- who recently received his PhD happening generally throughout companies to implement and out those bugs that concern database perspective, a lot of it implementation details so they already checked off, to believe ligently: lights that dim when a from MIT’s Computer Science the community in most part by requires no changes to apps. The security and privacy. looks like database operations. can logically state what they there might be new ways of do- person leaves the room, games and Artificial Intelligence Labo- necessity, Andoni is carrying DARKLY paper, called revolution- In both cases, you’re comput- want while letting the database ing things. You want to try again.” that react to a player’s throwing Technology alone, however, isn’t ratory (CSAIL), where he was a the idea further and is in the ary, won the 2014 PET Award for ing sums, you’re computing figure out the best way to do it. motion, doors that unlock when the answer. Companies are un- member of the database group. forefront of those inventing new Outstanding Research in Privacy common aggregates. We can recognizing the owner. likely to fix privacy problems un- A declarative language for primitives and new data struc- Enhancing Technologies. remove many of the perceived less pressured by the public, and Speed is one important com- visualization would have ad- tures that explicitly incorporate It all comes at a cost, of course, ponent for visualizing data, but differences between databases Making it easy to build in safety Jana sees his role encompassing ditional positive benefits. “Once the concept of sketches. especially in terms of privacy there are others, such as the and visualization systems.” Wu and privacy mechanisms is the policy arena, where he will you have a high-level language and security. ease with which interactive wants to bridge the two sides In early work applying a sketch critical. Manufacturers have work to propose and enact work- capable of expressing analyses, visualizations can be created and to operate more closely togeth- primitive (Locality Sensitive little incentive to construct able regulations and legislation to all of these analysis tools such as “Features don’t come for free; the ability to help understand er so both consider first the Hashing) to nearest neighbor privacy protections; in any protect data and security. the explanatory analysis from my they require incredible amounts what the results actually say. For expectations and requirements search, Andoni in 2006 with case, determining what data is thesis is in a sense baked into of data. And that brings risks. At least for perceptual comput- his PhD thesis, Wu tackled the of the human in the loop. Piotr Indyk was able, for the sensitive is not easy. A single whatever you build; it comes for The same data that tells the ing, Jana says there an opening latter problem by developing a most basic Euclidean distances, data point by itself—a random For instance, what does data- free. There will be less need for thermostat no one is home to do something about privacy visualization tool that automati- to improve over a seminal 1998 security photo of a passerby, base accuracy mean when a individuals to write their own ad might also be telling a would- risks. “The field is still relatively cally generates explanations for algorithm widely used for clas- for instance—might seem human analyst can’t differentiate hoc analysis programs.” be burglar,” says Jana. new, and we have the chance anomalies in a user’s visualiza- sification. The Communications harmless, but combined with 3.4 from 3.45 in a scatterplot? SUMAN JANA to build in security from the tion. This is important because As interactions become portable of the ACM later (2008, vol. 51) What data is being collecting another data point or aggregated A slight relaxation of accuracy ASSISTANT PROFESSOR beginning and make life better so while visualizations are very and sharable, they can be copied hailed the new primitive as a isn’t always known, even by over time—similar photos over requirements—unnoticeable OF COMPUTER SCIENCE people can trust these devices good at showing what’s happen- and pasted from one interac- breakthrough technology that the device manufacturers who, several weeks—reveals patterns to users—would conserve and use them.” ing in the data, they are not good tive visualization to another for allowed researchers to revisit Protecting security and pursuing features, default to and personal behaviors. The resources while speeding up at explaining why. A visualiza- someone else to modify. And it decades-old problems and solve collecting as much data as they challenge to preventing security query operations. In understand- privacy in an age of tion might show that company becomes easier to build tools, them faster. Few expected more can. This data is handed off to leaks is first finding them amidst ing the boundary between what perceptual computing expenses shot up 400% in a which fits with Wu’s focus in progress to be possible.
Recommended publications
  • Architectures for Adaptive Low-Power Embedded Multimedia Systems
    Architectures for Adaptive Low-Power Embedded Multimedia Systems zur Erlangung des akademischen Grades eines Doktors der Ingenieurwissenschaften der Fakultät für Informatik Karlsruhe Institute of Technology (KIT) (The cooperation of the Universität Fridericiana zu Karlsruhe (TH) and the national research center of the Helmholtz-Gemeinschaft) genehmigte Dissertation von Muhammad Shafique Tag der mündlichen Prüfung: 31.01.2011 Referent: Prof. Dr.-Ing. Jörg Henkel, Karlsruhe Institute of Technology (KIT), Fakultät für Informatik, Lehrstuhl für Eingebettete Systeme (CES) Korreferent: Prof. Dr. Samarjit Chakraborty, Technische Universität München (TUM), Fakultät für Elektrotechnik und Informationtechnik, Lehrstuhl für Realzeit- Computersysteme (RCS) Muhammad Shafique Adlerstr. 3a 76133 Karlsruhe Hiermit erkläre ich an Eides statt, dass ich die von mir vorgelegte Arbeit selbständig verfasst habe, dass ich die verwendeten Quellen, Internet-Quellen und Hilfsmittel vollständig angegeben habe und dass ich die Stellen der Arbeit – einschließlich Tabellen, Karten und Abbildungen – die anderen Werken oder dem Internet im Wortlaut oder dem Sinn nach entnommen sind, auf jeden Fall unter Angabe der Quelle als Entlehnung kenntlich gemacht habe. ____________________________________ Muhammad Shafique Acknowledgements I would like to present my cordial gratitude to my advisor Prof. Dr. Jörg Henkel for his erudite and invaluable supervision with sustained inspirations and incessant motivation. He guided me to explore the challenging research problems while giving me the complete flexibility, which provided the rationale to unleash my ingenuity and creativity along with an in-depth exploration of various research issues. His encouragement and meticulous feedback wrapped in constructive criticism helped me to keep the impetus and to remain streamlined on the road of research that resulted in the triumphant completion of this work.
    [Show full text]
  • PROFESSIONAL ACTIVITIES – Nam Ling
    PROFESSIONAL ACTIVITIES – Nam Ling (1) MAJOR PROFESSIONAL LEADERSHIP POSITIONS: 1. General Co-Chair, 12th International Conference on Ubi-Media Computing (Umedia), Bali, Indonesia, August 6-9, 2019. 2. General Co-Chair, 4th International Symposium on Security and Privacy in Social Networks and Big Data (SocialSec), Santa Clara, California, U.S.A, December 10-11, 2018. 3. General Co-Chair, 11th International Conference on Ubi-Media Computing (Umedia), Nanjing, China, August 22 – 25, 2018. 4. Honorary Co-Chair, 10th International Conference on Ubi-Media Computing and Workshops (Umedia), Pattaya, Thailand, August 1 - 4, 2017. 5. General Co-Chair, 9th International Conference on Ubi-Media Computing (Umedia), Moscow, Russia, August 15 - 17, 2016. 6. General Chair, 2015 IEEE Workshop on Signal Processing Systems (SiPS), Hangzhou, China, October 14 - 16, 2015. 7. General Co-Chair, 8th International Conference on Ubi-Media Computing (Umedia), Colombo, Sri Lanka, August 24 – 25, 2015. 8. General Co-Chair, 7th International Conference on Ubi-Media Computing (Umedia), Ulaanbaatar, Mongolia, July 12 – 14, 2014. 9. General Co-Chair, 2nd International Workshop on Video Coding and Video Processing (VCVP), Shenzhen, China, January 21 – 23, 2014. 10. Technical Program Co-Chair, 2013 IEEE Visual Communications and Image Processing Conference (VCIP), Kuching, Sarawak, Malaysia, November 17 - 20, 2013. 11. General Chair, 2013 IEEE International Conference on Multimedia and Expo (ICME), San Jose, California, USA, July 15 – 19, 2013. (ICME is the flagship conference on multimedia research for the IEEE and is sponsored by four of the largest IEEE societies – Computer, Communications, Signal Processing, and Circuits and Systems.) 12. Technical Program Co-Chair, 2010 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), Singapore, December 14 – 17, 2010.
    [Show full text]
  • Lillian C. Pentecost Lillian [email protected] (732) 533-9504
    Lillian C. Pentecost lillian [email protected] (732) 533-9504 EDUCATION Harvard University Cambridge, MA Ph.D. in Computer Science Projected May 2022 Advisors: David Brooks and Gu-Yeon Wei Harvard University Cambridge, MA S.M. (masters in passing) in Computer Science May 2019 Coursework includes: Advanced Machine Learning, Advanced Computer Architecture, Data Visualization, Seminar in Teaching the History of Science and Technology, Algorithms at the End of the Wire, Critical Pedagogy Seminar Colgate University Hamilton, NY Bachelor of Arts May 2016 Double Major: Computer Science and Physics with High Honors GPAs: Cumulative: 3.95/4.00, Physics: 4.03/4.00, Computer Science: 4.05/4.00 RESEARCH EXPERIENCE Harvard University Cambridge, MA Ph.D. Candidate August 2016 - Present Investigating and enabling the design and optimization of memory systems, including inte- gration of emerging and embedded non-volatile memory technologies and specialized hard- ware for machine learning applications, with an emphasis on understanding resilience and evaluating system and application-level implications of technology design choices. NVIDIA Research Westford, MA Ph.D. Research Intern Summer 2020 Conducted design space exploration of memory architecture and floorplanning choices with intensive analysis of efficient workload mappings for highly-distributed on-chip memory by building upon existing, open-source evaluation frameworks. (Virtual internship conducted from Boston, MA, collaborating with NVIDIA Architecture Research Group.) Microsoft Research Redmond, WA Ph.D. Research Intern Summer 2018 Profiled and analyzed deep neural network performance on a variety of hardware platforms with an emphasis on transformer-based models for translation, in addition to surveying and evaluating the state of available profiling tools across several popular ML frameworks, as part of a collaborative project between Microsoft Research and the Silicon, AI, and Performance group under Azure.
    [Show full text]
  • Newsletter-202009.Pdf
    1 September 2020, Vol. 50, No. 9 Online archive: http://www.sigda.org/publications/newsletter 1. SIGDA News From: Xiang Chen <[email protected]> 2. SIGDA Local Chapter News From: Yanzhi Wang <[email protected]> 3. "What is" Column Contributing author: Cong (Callie) Hao <[email protected]> From: Xun Jiao <[email protected]> 4. Paper Submission Deadlines From: Xin Zhao <[email protected]> 5. Upcoming Conferences and Symposia From: Xin Zhao <[email protected]> 6. SIGDA Partner Journal From: Matthew Morrison <[email protected]> From: Deming Chen <[email protected]> 7. Call for Nomination -- ACM TCPS EiC From: Krithi Ramamritham <[email protected]> 8. Technical Activities From: Ying Wang <[email protected]> 9. Notice to Authors Comments from the Editors Dear ACM/SIGDA members, We are excited to present to you the September e-newsletter. We encourage you to invite your students and colleagues to be a part of the SIGDA newsletter. The newsletter covers a wide range of information from the upcoming conferences and hot research topics to technical news and activities from our community. From this month, we add a new column titled "SIGDA Partner Journal" where we will introduce the dynamics of SIGDA related journals. For this month, we are introducing the new editorial board of ACM TODAES and announcing a new partnership between SIGDA and ACM TRETS. Get involved and contact us if you want to contribute an article or announcement. The newsletter is evolving, let us know what you think. Happy reading! Debjit Sinha, Keni Qiu, Editors-in-Chief, SIGDA E-News To renew your ACM SIGDA membership, please visit http://www.acm.org/renew or call between the hours of 8:30am to 4:30pm EST at +1-212-626-0500 (Global), or 1-800-342-6626 (US and Canada).
    [Show full text]
  • Thomas E. Anderson
    Thomas E. Anderson November 2015 Personal Born in Orlando, Florida, August 28, 1961. Work Address: Home Address: 646 Allen Center 1201 18th Ave. E. Department of Computer Science and Engineering Seattle, WA 98112 University of Washington (206) 568{0230 Seattle, WA 98112 (206) 543-9348 [email protected] Research Operating systems, cloud computing, computer networks, computer security, local and Interests wide area distributed systems, high performance computer and router architectures, and education software, with a focus on the construction of robust, secure, and efficient computer systems. Education Ph.D. in Computer Science, 1991, University of Washington. Dissertation Title: Operating System Support for High Performance Multiprocessing, supervised by Profs. E.D. Lazowska and H.M. Levy. M.S. in Computer Science, 1989, University of Washington. A.B. cum laude in Philosophy, 1983, Harvard University. Professional Department of Computer Science and Engineering, University of Washington. Experience Warren Francis and Wilma Kolm Bradley Chair of Computer Science and Engineering, 2009 { present. Visiting Professor, Eidgenossische Technische Hoschschule Zurich (ETHZ), 2009. Department of Computer Science and Engineering, University of Washington. Professor, 2001 { 2009. Department of Computer Science and Engineering, University of Washington. Associate Professor, 1997 { 2001. Founder and Interim CEO/CTO, Asta Networks, 2000 - 2001 (on leave from UW). Computer Science Division, University of California, Berkeley. Associate Professor, 1996 { 1997. Computer Science Division, University of California, Berkeley. Assistant Professor, 1991 { 1996. Digital Equipment Corporation Systems Research Center. Research Intern, Fall, 1990. Thomas E. Anderson - 2 - November 2015 Awards USENIX Lifetime Achievement Award, 2014. USENIX Software Tools User Group Award (for PlanetLab), 2014. IEEE Koji Kobayashi Computers and Communications Award, 2012.
    [Show full text]
  • AI Chips: What They Are and Why They Matter
    APRIL 2020 AI Chips: What They Are and Why They Matter An AI Chips Reference AUTHORS Saif M. Khan Alexander Mann Table of Contents Introduction and Summary 3 The Laws of Chip Innovation 7 Transistor Shrinkage: Moore’s Law 7 Efficiency and Speed Improvements 8 Increasing Transistor Density Unlocks Improved Designs for Efficiency and Speed 9 Transistor Design is Reaching Fundamental Size Limits 10 The Slowing of Moore’s Law and the Decline of General-Purpose Chips 10 The Economies of Scale of General-Purpose Chips 10 Costs are Increasing Faster than the Semiconductor Market 11 The Semiconductor Industry’s Growth Rate is Unlikely to Increase 14 Chip Improvements as Moore’s Law Slows 15 Transistor Improvements Continue, but are Slowing 16 Improved Transistor Density Enables Specialization 18 The AI Chip Zoo 19 AI Chip Types 20 AI Chip Benchmarks 22 The Value of State-of-the-Art AI Chips 23 The Efficiency of State-of-the-Art AI Chips Translates into Cost-Effectiveness 23 Compute-Intensive AI Algorithms are Bottlenecked by Chip Costs and Speed 26 U.S. and Chinese AI Chips and Implications for National Competitiveness 27 Appendix A: Basics of Semiconductors and Chips 31 Appendix B: How AI Chips Work 33 Parallel Computing 33 Low-Precision Computing 34 Memory Optimization 35 Domain-Specific Languages 36 Appendix C: AI Chip Benchmarking Studies 37 Appendix D: Chip Economics Model 39 Chip Transistor Density, Design Costs, and Energy Costs 40 Foundry, Assembly, Test and Packaging Costs 41 Acknowledgments 44 Center for Security and Emerging Technology | 2 Introduction and Summary Artificial intelligence will play an important role in national and international security in the years to come.
    [Show full text]
  • EMBARGOED for RELEASE MARCH 9, 2011 at 9 A.M. ET, 6 A.M
    acm Association for Computing Machinery Advancing Computing as a Science & Profession EMBARGOED FOR RELEASE MARCH 9, 2011 AT 9 a.m. ET, 6 a.m. PT Contact: Virginia Gold 212-626-0505 [email protected] ACM TURING AWARD GOES TO INNOVATOR IN MACHINE LEARNING Valiant Opened New Frontiers that Transformed Learning Theory, Computational Complexity, and Parallel and Distributed Computing NEW YORK, March 9, 2011 – ACM, the Association for Computing Machinery, today named Leslie G. Valiant of Harvard University the winner of the 2010 ACM A.M. Turing Award http://www.acm.org/news/featured/turing-award-2010 for his fundamental contributions to the development of computational learning theory and to the broader theory of computer science. Valiant brought together machine learning and computational complexity, leading to advances in artificial intelligence as well as computing practices such as natural language processing, handwriting recognition, and computer vision. He also launched several subfields of theoretical computer science, and developed models for parallel computing. The Turing Award, widely considered the “Nobel Prize in Computing", is named for the British mathematician Alan M. Turing. The award carries a $250,000 prize, with financial support provided by Intel Corporation and Google Inc. “Leslie Valiant’s accomplishments over the last 30 years have provided the theoretical basis for progress in artificial intelligence and led to extraordinary achievements in machine learning. His work has produced modeling that offers computationally inspired
    [Show full text]
  • Equad News Fall 2019 Volume 31, Number 1 School of Engineering and Applied Science Princeton, NJ 08544-5263
    EQuad News Fall 2019 Volume 31, Number 1 School of Engineering and Applied Science Princeton, NJ 08544-5263 www.princeton.edu/engineering [email protected] 4 EQuad News DEAN’S Fall 2019 NOTE Volume 31, Number 1 Interim Dean H. Vincent Poor *77 Vice Dean Shaping Cities for People and the Planet Antoine Kahn *78 Associate Dean, As Professor Elie Bou-Zeid eloquently explains on page 14 of this magazine, the Undergraduate Affairs way we build and reshape urban areas over the coming decades will determine a lot Peter Bogucki Associate Dean, about the long-term health of society and this planet. Development Jane Maggard No small task, but Princeton excels at this kind of grand challenge. The future of Associate Dean, Diversity and Inclusion cities is a complex mix of societal, technological, environmental, economic, and Julie Yun ethical questions, and Princeton is well equipped to knit creative, effective solutions. Director of Engineering Communications More generally, the Metropolis Project that Elie introduces is just one example of Steven Schultz the high-impact work and focus on societal benefit at the School of Engineering and Senior Editor Applied Science. We have tremendous momentum and growth in data science, John Sullivan Digital Media Editor bioengineering, and robotics and cyber- Aaron Nathans physical systems, as well as in advancing Writer the overall diversity and inclusion of Molly Sharlach Communications Specialist the school. Scott Lyon Science Communication Associate All this work brings together two distinctive Amelia Herb strengths of Princeton engineers: a culture Contributors Liz Fuller-Wright of fluidly integrating diverse viewpoints Adam Hadhazy and disciplines, and the ability to distill Bennett McIntosh Melissa Moss problems to their core constraints, then Molly Seltzer develop solutions with widespread impacts.
    [Show full text]
  • Tushar Krishna
    Tushar Krishna 266 Ferst Drive • School of Electrical and Computer Engineering • Atlanta, GA 30332, USA PHONE (+1) 206 601 6213 • E-MAIL [email protected] • WEB http://tusharkrishna.ece.gatech.edu ……………………...…………………….…………………….…………………….…………………….…………………….………………………………...………… RESEARCH INTERESTS Computer Architecture: multicore, parallel, heterogeneous, spatial, AI/ML accelerators Interconnection Networks: Networks-on-Chip, HPC switches, data-centers, FPGA networks ……………………...…………………….…………………….…………………….…………………….…………………….………………………………...………… EDUCATION Feb 2014 Massachusetts Institute of Technology Ph.D. in Electrical Engineering and Computer Science • Advisor: Li-Shiuan Peh • Committee: Srinivas Devadas and Joel Emer • Thesis: “Enabling Dedicated Single-Cycle Connections Over A Shared Network-on-Chip” Sep 2009 Princeton University M.S.E. in Electrical Engineering • Advisor: Li-Shiuan Peh • Thesis: “Networks-on-Chip with Hybrid Interconnects” Aug 2007 Indian Institute of Technology (IIT), Delhi B.Tech. (Honors) in Electrical Engineering ……………………...…………………….…………………….…………………….…………………….…………………….………………………………...………… PROFESSIONAL APPOINTMENTS Sept’19 -- Georgia Institute of Technology, Atlanta, GA, USA present ON Semiconductor Professor (Endowed Junior Professorship) School of Electrical and Computer Engineering Aug ’15 – Georgia Institute of Technology, Atlanta, GA, USA present Assistant Professor School of Electrical and Computer Engineering. School of Computer Science (Adjunct). Jan ’15 – Jul ‘15 Massachusetts Institute of Technology, SMART Center,
    [Show full text]
  • Uri C. Weiser
    Resume: Uri Weiser -1- RESUME January 18, 2010 URI C. WEISER Office: Technion Homes 1: Home 2: Mayer EE Building, office: 1232, Technion 13 Hatchelet 20 Meltchet Technion City, Haifa 32000, Israel Atlit, 30300, Israel Tel-Aviv, 65234, Israel Tel: +972-4-829-4763 04-984-0350 03-566-0660 Cell: +972-54-788-0287 US cell 408-425-9021 Fax: 04-984-0950 Fax: 03-566-9367 [email protected] [email protected] [email protected] [email protected] [email protected] EDUCATION & TITLES ACM Fellow 2005 Distinguish Fellow of the Electrical Engineering Department, Technion 2004 IEEE Fellow 2002 Intel Fellow 1996 Ph.D. Computer Science, University of Utah 1981 M.Sc. Electrical Engineering, Technion 1975 B.Sc. Electrical Engineering, Technion 1970 INDUSTRIAL EXPERIENCE 2010 - present We-Fi (startup – Wi-Fi) Senior Advisors: Strategy and solutions 2008 - present Lucid (startup - graphics) Board of Advisors: Power analysis and advantages, new approach to CMP 2007 - present NovaTrans (startup - devices) Senior Scientific and Technological Advisor 2007 - 2008 Commex-Technologies (startup – x86 chipsets) New X86 Platform approach – I/O Data content aware chipset CTO - Chief Technology Officer 1988 - 2006 Intel Corporation 2001 - 2006 Intel Israel, Corporate Technology Group (CTG) Director, Streaming Media Architecture Laboratory 1999 - 2000 Intel Austin (Texas, US), MicroProcessor Group (MPG) Co-Manager of Texas Development Center 1993 - 1998 Intel Israel, MicroProcessor Group (MPG) Director of Computer Architecture and Planning Department,
    [Show full text]
  • January 2019 Volume 66 · Issue 01
    ISSN 0002-9920 (print) ISSN 1088-9477 (online) Notices ofof the American MathematicalMathematical Society January 2019 Volume 66, Number 1 The cover art is from the JMM Sampler, page 84. AT THE AMS BOOTH, JMM 2019 ISSN 0002-9920 (print) ISSN 1088-9477 (online) Notices of the American Mathematical Society January 2019 Volume 66, Number 1 © Pomona College © Pomona Talk to Erica about the AMS membership magazine, pick up a free Notices travel mug*, and enjoy a piece of cake. facebook.com/amermathsoc @amermathsoc A WORD FROM... Erica Flapan, Notices Editor in Chief I would like to introduce myself as the new Editor in Chief of the Notices and share my plans with readers. The Notices is an interesting and engaging magazine that is read by mathematicians all over the world. As members of the AMS, we should all be proud to have the Notices as our magazine of record. Personally, I have enjoyed reading the Notices for over 30 years, and I appreciate the opportunity that the AMS has given me to shape the magazine for the next three years. I hope that under my leadership even more people will look forward to reading it each month as much as I do. Above all, I would like the focus of the Notices to be on expository articles about pure and applied mathematics broadly defined. I would like the authors, topics, and writing styles of these articles to be diverse in every sense except for their desire to explain the mathematics that they love in a clear and engaging way.
    [Show full text]
  • 17Th Knuth Prize: Call for Nominations
    17th Knuth Prize: Call for Nominations The Donald E. Knuth Prize for outstanding contributions to the foundations of computer science is awarded for major research accomplishments and contri- butions to the foundations of computer science over an extended period of time. The Prize is awarded annually by the ACM Special Interest Group on Algo- rithms and Computing Theory (SIGACT) and the IEEE Technical Committee on the Mathematical Foundations of Computing (TCMF). Nomination Procedure Anyone in the Theoretical Computer Science com- munity may nominate a candidate. To do so, please send nominations to : [email protected] with a subject line of Knuth Prize nomi- nation by February 15, 2017. The nomination should state the nominee's name, summarize his or her contributions in one or two pages, provide a CV for the nominee or a pointer to the nominees webpage, and give telephone, postal, and email contact information for the nominator. Any supporting letters from other members of the community (up to a limit of 5) should be included in the package that the nominator sends to the Committee chair. Supporting letters should contain substantial information not in the nomination. Others may en- dorse the nomination simply by adding their names to the nomination letter. If you have nominated a candidate in past years, you can re-nominate the candi- date by sending a message to that effect to the above address. (You may revise the nominating materials if you desire). Criteria for Selection The winner will be selected by a Prize Committee consisting of six people appointed by the SIGACT and TCMF Chairs.
    [Show full text]