Margaret R. Martonosi
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The 60Th Issue of IEEE Women in Engineering Newsletter with Current
IEEE WOMEN IN ENGINEERING NEWSLETTER JANUARY 2013 The mission of WIE is to facilitate the recruitment and retention of women in technical disciplines globally. IEEE WIE envisions a vibrant community of IEEE women and men collectively using their diverse talents to innovate for the benefit of humanity. The making of these stories do not Welcome to the 60th Issue of just happen; They are made to WIE Featured Person of the IEEE Women in Engineering happen by people who do not just Month Highlights Newsletter with current five- do their jobs but they care and year editorial staff. To mark the they lead, providing guidance and 60th issue of the IEEE Women in encouragement to affinity groups Engineering Newsletter, we bring and individuals, worldwide. These you kind greetings as we celebrate stories also happen because of the having a consistent and dedicated hard work, achievements, and newsletter staff for the last five dedication exemplified by our years. individual members as well, who excel and make a difference in their respective fields . Over the past five years, we have told many great stories of success, The collective achievements of “us achievements, and fascinating experiences and opportunities – all all” are what make “WIE Around the World” a true phenomenon. In The WIE Featured Person of the about our WIE members, about all Month is Katina Michael, editor-in- of you and each of you. light of this, we will bring you greetings over the next few chief of IEEE Technology and Society months from the regional Magazine. After working at OTIS The WIE newsletter staff cannot coordinators from Regions 1 Elevator Company and Andersen begin to express the excitement though 10 who have helped to Consulting, Katina was offered and that goes along with telling the make the 60th Issue of the IEEE exciting graduate engineering stories of the many of WIE, from all Women in Engineering Newsletter position at Nortel in 1996; and her around the world, sharing a the landmark success that is career has been fast track from there. -
Bridging the Data Charging Gap in the Cellular Edge
Bridging the Data Charging Gap in the Cellular Edge Yuanjie Li, Kyu-Han Kim, Christina Vlachou, Junqing Xie Hewlett Packard Labs {yuanjiel,kyu-han.kim,christina.vlachou,jun-qing.xie}@hpe.com ABSTRACT licensed spectrum and support carrier-grade QoS for low latency. The 4G/5G cellular edge promises low-latency experiences any- We have seen some early operational edge services via 4G/5G (x2.2). where, anytime. However, data charging gaps can arise between The cellular network data is not free. To enjoy the low-latency the cellular operators and edge application vendors, and cause services, the edge app vendors should pay the cellular operators by over-/under-billing. We find that such gap can come from data loss, traffic usage (similar to our mobile data plans). Even for the“un- selfish charging, or both. It can be amplified in the edge, duetoits limited” data plans, the edge app’s network speed will be throttled low-latency requirements. We devise TLC, a Trusted, Loss-tolerant (e.g., 128Kbps) if its usage exceeds pre-defined quota. This model Charging scheme for the cellular edge. In its core, TLC enables loss- inherits from 4G/5G [6, 7], and is standardized in the edge [8]. selfishness cancellation to bridge the gap, and constructs publicly However, the cellular operator and edge app vendor may not verifiable, cryptographic proof-of-charging for mutual trust. Weim- always agree on how much data should be paid. A data charging plement TLC with commodity edge nodes, OpenEPC and small cells. gap can arise, i.e., the data volume charged by the cellular opera- Our experiments in various edge scenarios validate TLC’s viability tor differs from what the edge sends/receives. -
[Front Matter]
Future Technologies Conference (FTC) 2017 29-30 November 2017| Vancouver, Canada About the Conference IEEE Technically Sponsored Future Technologies Conference (FTC) 2017 is a second research conference in the series. This conference is a part of SAI conferences being held since 2013. The conference series has featured keynote talks, special sessions, poster presentation, tutorials, workshops, and contributed papers each year. The goal of the conference is to be a world's pre-eminent forum for reporting technological breakthroughs in the areas of Computing, Electronics, AI, Robotics, Security and Communications. FTC 2017 is held at Pan Pacific Hotel Vancouver. The Pan Pacific luxury Vancouver hotel in British Columbia, Canada is situated on the downtown waterfront of this vibrant metropolis, with some of the city’s top business venues and tourist attractions including Flyover Canada and Gastown, the Vancouver Convention Centre, Cruise Ship Terminal as well as popular shopping and entertainment districts just minutes away. Pan Pacific Hotel Vancouver has great meeting rooms with new designs. We chose it for the conference because it’s got plenty of space, serves great food and is 100% accessible. Venue Name: Pan Pacific Hotel Vancouver Address: Suite 300-999 Canada Place, Vancouver, British Columbia V6C 3B5, Canada Tel: +1 604-662-8111 3 | P a g e Future Technologies Conference (FTC) 2017 29-30 November 2017| Vancouver, Canada Preface FTC 2017 is a recognized event and provides a valuable platform for individuals to present their research findings, display their work in progress and discuss conceptual advances in areas of computer science and engineering, Electrical Engineering and IT related disciplines. -
For Immediate Release
FOR IMMEDIATE RELEASE ACM - Association for Computing Machinery IEEE Computer Society Contacts: Virginia Gold Margo McCall 212-626-0505 714-816-2182 [email protected] [email protected] ACM, IEEE COMPUTER SOCIETY HONOR INNOVATOR OF HIGH-PERFORMANCE COMPUTER SYSTEMS DESIGNS University of Wisconsin’s Sohi Developed Advances Widely Adopted by Microprocessor Manufacturers to Increase the Power of Computing NEW YORK, MAY 4, 2011 -- ACM (the Association for Computing Machinery) and the IEEE Computer Society (IEEE-CS) will jointly present the Eckert-Mauchly Award to Gurindar S. (Guri) Sohi of the University of Wisconsin-Madison for pioneering widely used micro-architectural techniques in the design of high-performance microprocessors. These innovations increase the instruction-level parallelism, a measure of how many operations in a computer program can be performed simultaneously. They can be found in almost every commercial microprocessor used today in personal computers and high-end servers. The Eckert Mauchly Award http://awards.acm.org/eckert_mauchly www.computer.org/portal/web/awards/eckert is known as the computer architecture community’s most prestigious award. Sohi will receive the 2011 Eckert-Mauchly Award at the International Symposium on Computer Architecture (ISCA), held as part of the Federated Computing Research Conference (FCRC) http://www.acm.org/fcrc, June 7, 2011, in San Jose, CA. Early in his career, Sohi articulated a model for a dynamically scheduled processor supporting precise exceptions. This model has served as the basis for many commercial superscalar microprocessors that have been designed and built since the early 1990s. His group also proposed the idea of memory dependence prediction to further improve instruction-level parallelism, a technology that has been considered a key innovation in some recent microprocessors. -
Department of Computer Science
i cl i ck ! MAGAZINE click MAGAZINE 2014, VOLUME II FIVE DECADES AS A DEPARTMENT. THOUSANDS OF REMARKABLE GRADUATES. 50COUNTLESS INNOVATIONS. Department of Computer Science click! Magazine is produced twice yearly for the friends of got your CS swag? CS @ ILLINOIS to showcase the innovations of our faculty and Commemorative 50-10 Anniversary students, the accomplishments of our alumni, and to inspire our t-shirts are available! partners and peers in the field of computer science. Department Head: Editorial Board: Rob A. Rutenbar Tom Moone Colin Robertson Associate Department Heads: Rob A. Rutenbar shop now! my.cs.illinois.edu/buy Gerald DeJong Michelle Wellens Jeff Erickson David Forsyth Writers: David Cunningham CS Alumni Advisory Board: Elizabeth Innes Alex R. Bratton (BS CE ’93) Mike Koon Ira R. Cohen (BS CS ’81) Rick Kubetz Vilas S. Dhar (BS CS ’04, BS LAS BioE ’04) Leanne Lucas William M. Dunn (BS CS ‘86, MS ‘87) Tom Moone Mary Jane Irwin (MS CS ’75, PhD ’77) Michelle Rice Jennifer A. Mozen (MS CS ’97) Colin Robertson Daniel L. Peterson (BS CS ’05) Laura Schmitt Peter L. Tannenwald (BS LAS Math & CS ’85) Michelle Wellens Jill C. Zmaczinsky (BS CS ’00) Design: Contact us: SURFACE 51 [email protected] 217-333-3426 Machines take me by surprise with great frequency. Alan Turing 2 CS @ ILLINOIS Department of Computer Science College of Engineering, College of Liberal Arts & Sciences University of Illinois at Urbana-Champaign shop now! my.cs.illinois.edu/buy click i MAGAZINE 2014, VOLUME II 2 Letter from the Head 4 ALUMNI NEWS 4 Alumni -
On Invariant Synthesis for Parametric Systems
On Invariant Synthesis for Parametric Systems Dennis Peuter and Viorica Sofronie-Stokkermans Universit¨at Koblenz-Landau, Koblenz, Germany {dpeuter,sofronie}@uni-koblenz.de May 30, 2019 Abstract We study possibilities for automated invariant generation in parametric systems. We use (a refinement of) an algorithm for symbol elimination in theory extensions to devise a method for iteratively strengthening certain classes of safety properties to obtain invariants of the system. We identify conditions under which the method is correct and complete, and situations in which the method is guaranteed to terminate. We illustrate the ideas on various examples. 1 Introduction In the verification of parametric systems it is important to show that a certain property holds for all states reachable from the initial state. One way to solve such problems is to identify an inductive invariant which entails the property to be proved. Finding suitable inductive invariants is non-trivial – the problem is undecidable in general; solutions have been proposed for specific cases, as discussed in what follows. In [Kap06], Kapur proposes methods for invariant generation in theories such as Presburger arithmetic, real closed fields, and for polynomial equations and inequations with solutions in an algebraically closed field. The main idea is to use templates for the invariant (polynomials with undetermined coefficients), and solve constraints for all paths and initial values to determine the coefficients. A similar idea was used by Beyer et al. [BHMR07] for constraints in linear real or rational arithmetic; it is shown that if an invariant is expressible with a given template, then it will be computed. Symbol elimination has been used for interpolation and invariant generation in many papers. -
SIGOPS Annual Report 2012
SIGOPS Annual Report 2012 Fiscal Year July 2012-June 2013 Submitted by Jeanna Matthews, SIGOPS Chair Overview SIGOPS is a vibrant community of people with interests in “operatinG systems” in the broadest sense, includinG topics such as distributed computing, storaGe systems, security, concurrency, middleware, mobility, virtualization, networkinG, cloud computinG, datacenter software, and Internet services. We sponsor a number of top conferences, provide travel Grants to students, present yearly awards, disseminate information to members electronically, and collaborate with other SIGs on important programs for computing professionals. Officers It was the second year for officers: Jeanna Matthews (Clarkson University) as Chair, GeorGe Candea (EPFL) as Vice Chair, Dilma da Silva (Qualcomm) as Treasurer and Muli Ben-Yehuda (Technion) as Information Director. As has been typical, elected officers agreed to continue for a second and final two- year term beginning July 2013. Shan Lu (University of Wisconsin) will replace Muli Ben-Yehuda as Information Director as of AuGust 2013. Awards We have an excitinG new award to announce – the SIGOPS Dennis M. Ritchie Doctoral Dissertation Award. SIGOPS has lonG been lackinG a doctoral dissertation award, such as those offered by SIGCOMM, Eurosys, SIGPLAN, and SIGMOD. This new award fills this Gap and also honors the contributions to computer science that Dennis Ritchie made durinG his life. With this award, ACM SIGOPS will encouraGe the creativity that Ritchie embodied and provide a reminder of Ritchie's leGacy and what a difference a person can make in the field of software systems research. The award is funded by AT&T Research and Alcatel-Lucent Bell Labs, companies that both have a strong connection to AT&T Bell Laboratories where Dennis Ritchie did his seminal work. -
Phillip B. Gibbons Curriculum Vitae
Phillip B. Gibbons Curriculum Vitae [email protected] http://cs.cmu.edu/~gibbons/ July 2020 Research Interests Research areas include big data, parallel computing, databases, cloud computing, sensor networks, distributed systems, and computer architecture. My publications span theory and systems, across a broad range of computer science and engineering (e.g., conference papers in APoCS, ATC, ESA, EuroSys, HPCA, ICML, IPDPS, ISCA, MICRO, NeurIPS, NSDI, OSDI, PACT, SoCC, SODA, SOSP, SPAA and VLDB since 2015). Education • University of California at Berkeley, Berkeley, California, 1984{1989. Ph.D. in Computer Science. Dissertation advisor: Richard M. Karp. • Dartmouth College, Hanover, New Hampshire, 1979{1983. B.A. in Mathematics. Graduated summa cum laude and Phi Beta Kappa. Professional Experience • Carnegie Mellon University, Pittsburgh, Pennsylvania. Professor, Computer Science Department, 2015{present. Professor, Electrical and Computer Engineering Department, 2015{present. Principal Investigator (PI or co-PI) for the following research projects: { Prescriptive Memory: Razing the semantic wall between applications and computer systems with heterogeneous compute and memories. { Asymmetric Memory: Write-efficient algorithms and systems, for settings (such as emerging non- volatile memories) where writes are significantly more costly than reads. { Big Learning Systems: Mapping out and exploring the space of large-scale machine learning from a systems' perspective. Recent focus on geo-distributed learning over non-IID data. Adjunct Professor, Computer Science Department, 2003{2015. Adjunct Associate Professor, Computer Science Department, 2000{2003. Visiting Professor, Computer Science Department, 2000. • Intel Labs Pittsburgh, Pittsburgh, Pennsylvania. Principal Research Scientist, 2001{2015. Principal Investigator for the Intel Science and Technology Center for Cloud Computing { A $11.5M research partnership with Carnegie Mellon, Georgia Tech, Princeton, UC Berkeley, and U. -
SIGOPS Annual Report 2011
SIGOPS Annual Report 2011 Fiscal Year July 2010-June 2011 Submitted by Doug Terry, SIGOPS Chair Overview SIGOPS is a vibrant community of people with interests in “operating systems” in the broadest sense, including topics such as distributed computing, storage systems, security, concurrency, middleware, mobility, virtualization, networking, cloud computing, datacenter software, and Internet services. We sponsor a number of top conferences, provide travel grants to students, present yearly awards, disseminate information to members electronically, and collaborate with other SIGs on important programs for computing professionals. Notable activities from the past year include: Elections were held for new officers, and Jeanna Matthews was elected as the new SIGOPS Chair, George Candea as Vice Chair, and Dilma da Silva as Treasurer. They will serve two-year terms from July 1, 2011 through June 30, 2013. The past officers (Doug Terry as Chair, Frank Bellosa as Vice Chair and Jeanna Matthews as Treasurer) completed their 4 years of service on June 30. Planning for the next ACM Symposium on Operating Systems (SOSP), which is scheduled for October 2011 in Cascais, Portugal, has been largely completed by Ted Wobber, the General Chair, and Peter Druschel, the Program Chair. The Second ACM Symposium on Cloud Computing (SOCC), which is co-sponsored between SIGOPS and SIGMOD, is being co-located with SOSP in Portugal. The first SIGOPS Asia-Pacific Workshop on Systems (APSys) was held on August 30, 2010 in New Delhi, India, immediately before the SIGCOMM 2010 conference. And the second instance of this workshop is being held in Shanghai, China, in July 2011. ACM released the first version of the Cloud Computing Tech Pack, which was produced by Doug Terry, the SIGOPS Chair. -
About Technews About SIG Newsletters
PRINT AND ONLINE ADVERTISING OPPORTUNITIES About TechNews About SIG Newsletters TechNews is an email digest of computing and technology ACM’s 37 Special Interest Groups (SIGs) represent news gathered from leading sources; distributed Monday, the major disciplines of the dynamic computing fi eld. Wednesday, and Friday to a circulation of over 105,000 ACM’s SIGs are invested in advancing the skills of their subscribers. Its concise summaries are perfect for busy members, keeping them abreast of emerging trends and professionals who need and want to keep up with the driving innovation across a broad spectrum of computing latest industry developments. disciplines. TechNews is regularly cited as one of ACM’s most valued As a member benefit, many ACM SIGs provide its members benefits and is one of the best ways to communicate with with a print or online newsletter covering news and events ACM members. within the realm of their fields. Circulation SIGACCESS: ACM SIGACCESS Newsletter* SIGACT: SIGACT News Listserv 105,000 SIGAda: Ada Letters SIGAI: AI Matters* Online Advertising Opportunities SIGAPP: Applied Computing Review* Right-hand sidebar position SIGBED: SIGBED Review* Size Dimensions Rates SIGBio: ACM SIGBio Record* Top Banner 468 x 60 IMU $6500/Month* SIGCAS: Computers & Society Newsletter* Skyscraper 160 x 600 IMU $6000/Month* SIGCOMM: Computer Communication Review* Square Ad 160 x 160 IMU $2500/Month* SIGCSE: SIGCSE Bulletin* SIGDOC: Communication Design Quarterly* * 12 Transmissions SIGecom: ACM SIGecom Exchanges* Maximum File Size: -
Shanlu › About › Cv › CV Shanlu.Pdf Shan Lu
Shan Lu University of Chicago, Dept. of Computer Science Phone: +1-773-702-3184 5730 S. Ellis Ave., Rm 343 E-mail: [email protected] Chicago, IL 60637 USA Homepage: http://people.cs.uchicago.edu/~shanlu RESEARCH INTERESTS Tool support for improving the correctness and efficiency of large scale software systems EMPLOYMENT 2019 – present Professor, Dept. of Computer Science, University of Chicago 2014 – 2019 Associate Professor, Dept. of Computer Sciences, University of Chicago 2009 – 2014 Assistant Professor, Dept. of Computer Sciences, University of Wisconsin – Madison EDUCATION 2008 University of Illinois at Urbana-Champaign, Urbana, IL Ph.D. in Computer Science Thesis: Understanding, Detecting, and Exposing Concurrency Bugs (Advisor: Prof. Yuanyuan Zhou) 2003 University of Science & Technology of China, Hefei, China B.S. in Computer Science HONORS AND AWARDS 2019 ACM Distinguished Member Among 62 members world-wide recognized for outstanding contributions to the computing field 2015 Google Faculty Research Award 2014 Alfred P. Sloan Research Fellow Among 126 “early-career scholars (who) represent the most promising scientific researchers working today” 2013 Distinguished Alumni Educator Award Among 3 awardees selected by Department of Computer Science, University of Illinois 2010 NSF Career Award 2021 Honorable Mention Award @ CHI for paper [C71] (CHI 2021) 2019 Best Paper Award @ SOSP for paper [C62] (SOSP 2019) 2019 ACM SIGSOFT Distinguished Paper Award @ ICSE for paper [C58] (ICSE 2019) 2017 Google Scholar Classic Paper Award for -
Curriculum Vitae
Aaron Gember-Jacobson http://aaron.gember-jacobson.com Contact Information Department of Computer Science, Colgate University [email protected] 13 Oak Drive, Hamilton, NY 13346 (315) 228-6298 Education Ph.D. in Computer Science May 2016 University of Wisconsin–Madison, Madison, WI Master of Science in Computer Science May 2011 University of Wisconsin–Madison, Madison, WI Bachelor of Science in Computer Science May 2009 Marquette University, Milwaukee, WI Professional Experience Assistant Professor, Colgate University July 2016 – Present Lecturer, University of Wisconsin–Madison Spring 2015, Spring 2014 Research Assistant/Fellow, University of Wisconsin–Madison January 2010 – May 2016 Student Intern, AT&T Research May 2011 – July 2011 Teaching (y indicates course includes a weekly 2 hour laboratory in addition to lecture) Colgate University — undergraduate liberal arts institution with a 5 course teaching load • Intro to Computing I (COSC 101)y: Spring 2020, Spring 2018 • Operating Systems (COSC 301)y: Spring 2019, Fall 2018, Fall 2017, Spring 2017, Fall 2016 (2 sections) • Computer Networks (COSC 465): Spring 2020y, Spring 2019y, Spring 2017 • The Unreliable Internet (FSEM 136): Fall 2018 University of Wisconsin-Madison — courses taught as a lecturer during PhD program • Introduction to Networks (CS 640): Spring 2015, Spring 2014 Grants G2. NeTS: Medium: Collaborative Research: Automatic Network Repair. National Science Foundation (NSF), 2018-2022, $170K (plus $1,030K awarded to the University of Wisconsin-Madison). Role: Principal Investigator G1. AitF: Collaborative Research: Foundations of Intent-based Networking. National Science Foundation (NSF), 2016-2019, $60K (plus $356K awarded to the University of Wisconsin-Madison). Role: Principal Investigator page 1 of 7 Publications (∗ indicates undergraduate student author) Refereed Conference Publications 1 C15.