- talks - lists.cs.princeton.edu

FW: Kurt James Werner visiting electronic music circuit modeling lecture this Wednesday, Sept 25, 5pm
by Emily Lawrence 23 Sep '19

23 Sep '19

I'm excited to let people know about a talk being presented by a visitor on Wednesday, Sept 25, at 5pm, in the PLOrk studio (Effron Music Building). Kurt James Werner will be visiting and talking about his music and giving an introduction to the techniques he uses to model analog audio circuits digitally, Wave Digital Filters (WDF). All are welcome, it's FREE and open to the public. Hope to see you there! Jeff Snyder Director of Electronic Music Princeton University --- Details below: WHEN: Wednesday, Sept 25 5pm-7pm WHERE: PLOrk Studio on the Forum Level of the Effron Music Building (in the new Lewis Arts Complex) FREE and open to the public Title: Virtual Analog Modeling using Wave Digital Filters: a Tutorial Introduction Bio: Dr. Kurt James Werner conducts research related to virtual analog (especially Wave Digital Filters), the history of music technology, 1-bit music, computer modeling of circuit-bent instruments, & sound synthesis more broadly. As part of his Ph.D. in Computer-Based Music Theory and Acoustics from Stanford University's Center for Computer Research in Music and Acoustics (CCRMA), he wrote a doctoral dissertation “Virtual Analog Modeling of Audio Circuitry Using Wave Digital Filters.” This greatly expanded the class of circuits that can be modeled using the Wave Digital Filter approach, using the classic Roland TR-808 bass drum circuit as a case study. As a researcher, he has also worked on the history of analog drum machine circuits. As a composer, his music references elements of chiptunes, musique concrète, circuit bending, algorithmic/generative composition, & breakbeat. As a Lecturer in Audio, he was based out of the Sonic Arts Research Centre (SARC) of Queen's University Belfast for several years, and will soon (in 1 week!) start a new position as a Research Engineer at iZotope, Inc. in Cambridge, MA. Synopsis: In this tutorial, the basics of the "Wave Digital Filter" (WDF) approach to virtual analog modeling will be presented. The WDF concept was introduced as a generic digital filter design technique by Alfred Fettweis in the 1970s, and has been picked up slowly by the audio DSP community starting in the early 2000s. Today, WDFs are capable of modeling audio circuits with complex topologies (bridges, feedback, &c.) and multiple nonlinearities (diodes, transistors, &c.) and can be considered one of the main approaches to modeling audio circuits in software. A wide variety of audio circuits have been successfully modeled, including the Roland TR-808 bass drum, amplifier tone stacks, Ibanez Tube Screamer, OTA-based state variable filters, tone boosters, the Electro-Harmonix Big Muff Pi, the Korg MS-50 VCF, & Fender and Mesa Boogie preamplifiers. The main focus of the talk will be the basic mathematical concepts that underpin WDF modeling and tutorial examples, including a simple RC lowpass filter & the Hammond organ vibrato/chorus circuit. Some progress on modeling a mysterious analog filter from the Experimental Music Studios (EMS) of the University of Illinois at Urbana-Champaign (UIUC) will also be presented. -- Composer, musician, instrument designer scattershot.org <http://scattershot.org> * @snyderphonics

1 0

Reminder: Colloquium Speaker Muhammad Jehangir Amjad : TODAY at 1:30pm
by Emily C. Lawrence 18 Sep '19

18 Sep '19

Colloquium Speaker Muhammad Jehangir Amjad from Google Wednesday, September 18 - 1:30pm Computer Science - Room 105 Host: Jennifer Rexford [ https://www.cs.princeton.edu/events/25874 | https://www.cs.princeton.edu/events/25874 ] Challenges in Cloud Networking Google's products, e.g. Search, YouTube, Gmail, etc. are used by billions of people the world over. Google Cloud hosts some of the most popular services in the world. Building systems that scale to support all these applications is among the greatest challenges at the company. Underlying all these systems is the network which must enable low-latency, high throughput, high capacity, high availability and secure access to compute and storage. While Google has been enormously successful in achieving these goals, cloud networking faces exciting new challenges today. With the demise of Moore's Law and explosive data growth, the implications for the performance, reliability, predictability and cost efficiency on networking, from hardware to communication protocols, will be profound. This talk will focus on highlighting some of the challenges in networking alluded to above. Additionally, we will discuss the current and future challenges in network telemetry systems and Google's approach to overcoming these challenges via statistical inference which allows us to estimate that which cannot be measured. Bio: Muhammad Jehangir Amjad is a Software Engineer in the Network Infrastructure team at Google working on inference and statistical learning on data produced by network telemetry systems. He joined Google from MIT where he has an appointment as a Lecturer of Machine Learning in CSAIL. Jehangir received his PhD from the Operations Research Center (ORC) and Laboratory of Information and Decision Systems (LIDS) at MIT, under the supervision of Prof Devavrat Shah. He received his BSE in Electrical Engineering from Princeton University.

1 0

Reminder: Colloquium Speaker Roxana Geambasu TODAY at 12:30pm
by Emily C. Lawrence 17 Sep '19

17 Sep '19

Colloquium Speaker Roxana Geambasu from Columbia University Tuesday, September 17 - 12:30pm Computer Science - Room 105 Host: Amit Levy [ https://www.cs.princeton.edu/events/25871 | https://www.cs.princeton.edu/events/25871 ] Security and Privacy Guarantees in Machine Learning with Differential Privacy Machine learning (ML) is becoming a critical foundation for how we construct the code driving our applications, cars, and life-changing financial decisions. Yet, it is often brittle and unstable, making decisions that are hard to understand and can be exploited. As one example, tiny changes to an input can cause dramatic changes in predictions; this results in decisions that surprise, appear unfair, or enable attack vectors such as adversarial examples. As another example, models trained on users' data have been shown to encode not only general trends from large datasets but also very specific, personal information from these datasets, such as social security numbers and credit card numbers from emails; this threatens to expose users' secrets through ML predictions or parameters. Over the years, researchers have proposed various approaches to address these rather distinct security, privacy, and transparency challenges. Most of the work has been best effort, which is insufficient if ML is to become a rigorous basis for how we construct our code. This talk positions differential privacy (DP) -- a theory developed by the privacy community -- as a versatile foundation for building into ML much-needed guarantees of not only privacy but also of security, stability, and transparency. As supporting evidence, I first present PixelDP , a scalable certified defense against adversarial examples that leverages DP theory to guarantee a level of robustness against this attack. I then present Sage, a DP ML platform that bounds the leakage of personal secrets through ML models while addressing some of the most pressing challenges of DP, such as the "running out of privacy budget" problem. Both PixelDP and Sage are designed from a pragmatic systems perspective and illustrate that DP theory is powerful but requires adaptation to achieve practical guarantees for ML workloads. Bio: Roxana Geambasu is an Associate Professor of Computer Science at Columbia University and a member of Columbia's Data Sciences Institute. She joined Columbia in Fall 2011 after finishing her Ph.D. at the University of Washington. For her work in cloud and mobile data privacy, she received: an Alfred P. Sloan Faculty Fellowship, an NSF CAREER award, a Microsoft Research Faculty Fellowship, several Google Faculty awards, a "Brilliant 10" Popular Science nomination, the Honorable Mention for the 2013 inaugural Dennis M. Ritchie Doctoral Dissertation Award, a William Chan Dissertation Award, two best paper awards at top systems conferences, and the first Google Ph.D. Fellowship in Cloud Computing.

1 0

Colloquium Speaker Muhammad Jehangir Amjad : Wednesday, Sept. 18
by Emily C. Lawrence 11 Sep '19

11 Sep '19

Colloquium Speaker Muhammad Jehangir Amjad from Google Wednesday, September 18 - 1:30pm Computer Science - Room 105 Host: Jennifer Rexford [ https://www.cs.princeton.edu/events/25874 | https://www.cs.princeton.edu/events/25874 ] Challenges in Cloud Networking Google's products, e.g. Search, YouTube, Gmail, etc. are used by billions of people the world over. Google Cloud hosts some of the most popular services in the world. Building systems that scale to support all these applications is among the greatest challenges at the company. Underlying all these systems is the network which must enable low-latency, high throughput, high capacity, high availability and secure access to compute and storage. While Google has been enormously successful in achieving these goals, cloud networking faces exciting new challenges today. With the demise of Moore's Law and explosive data growth, the implications for the performance, reliability, predictability and cost efficiency on networking, from hardware to communication protocols, will be profound. This talk will focus on highlighting some of the challenges in networking alluded to above. Additionally, we will discuss the current and future challenges in network telemetry systems and Google's approach to overcoming these challenges via statistical inference which allows us to estimate that which cannot be measured. Bio: Muhammad Jehangir Amjad is a Software Engineer in the Network Infrastructure team at Google working on inference and statistical learning on data produced by network telemetry systems. He joined Google from MIT where he has an appointment as a Lecturer of Machine Learning in CSAIL. Jehangir received his PhD from the Operations Research Center (ORC) and Laboratory of Information and Decision Systems (LIDS) at MIT, under the supervision of Prof Devavrat Shah. He received his BSE in Electrical Engineering from Princeton University.

1 0

Paul Ellenbogen will present his Pre-FPO, "Long range familial searches of genetic databases: New techniques and policy implications" on Tuesday, September 17, 2019 in CS 402 at 2:30pm
by Nicki Mahler 10 Sep '19

10 Sep '19

Paul Ellenbogen will present his Pre-FPO, "Long range familial searches of genetic databases: New techniques and policy implications" on Tuesday, September 17, 2019 in CS 402 at 2:30pm. The members of his committee are as follows: Arvind Narayanan (adviser), Ed Felten, Jonathan Mayer, Mona Singh, and Olga Troyanskaya. Everyone is invited to attend his talk. The talk title and abstract follow below. "Long range familial searches of genetic databases: New techniques and policy implications" Abstract: Consumer genetics databases hold dense genotypes of millions of people, and the number is growing quickly. In 2018, law enforcement agencies began using such databases to identify anonymous DNA via long-range familial searches. I show that this technique is far more powerful if combined with a genealogical database of the type collected by online ancestry services. I present a “genealogical triangulation” algorithm and study its effectiveness on simulated datasets. I show that for over 50% of targets, their anonymous DNA can be identified (matched to the correct individual or same-sex sibling) when the genetic database includes just 1% of the population. I also show the effectiveness of “snowball identification'” in which a successful identification adds to the genetic genealogical database, increasing the identification accuracy for future instances. I next turn to the policy implications of recent advances in familial searches, including the novel technique that I developed. I compare commercial databases to existing law enforcement databases. The existence of commercial databases and new familial searching requires new regulations. I argue for warrant requirements for law enforcement use of familial search against commercial databases. I also argue that websites that allow for user uploads must cryptographically verify the authenticity of those uploads to prevent re identification attacks.

1 0

Colloquium Speaker Roxana Geambasu: Tuesday, Sept. 17
by Emily C. Lawrence 10 Sep '19

10 Sep '19

Colloquium Speaker Roxana Geambasu from Columbia University Tuesday, September 17 - 12:30pm Computer Science - Room 105 Host: Amit Levy [ https://www.cs.princeton.edu/events/25871 | https://www.cs.princeton.edu/events/25871 ] Security and Privacy Guarantees in Machine Learning with Differential Privacy Machine learning (ML) is becoming a critical foundation for how we construct the code driving our applications, cars, and life-changing financial decisions. Yet, it is often brittle and unstable, making decisions that are hard to understand and can be exploited. As one example, tiny changes to an input can cause dramatic changes in predictions; this results in decisions that surprise, appear unfair, or enable attack vectors such as adversarial examples. As another example, models trained on users' data have been shown to encode not only general trends from large datasets but also very specific, personal information from these datasets, such as social security numbers and credit card numbers from emails; this threatens to expose users' secrets through ML predictions or parameters. Over the years, researchers have proposed various approaches to address these rather distinct security, privacy, and transparency challenges. Most of the work has been best effort, which is insufficient if ML is to become a rigorous basis for how we construct our code. This talk positions differential privacy (DP) -- a theory developed by the privacy community -- as a versatile foundation for building into ML much-needed guarantees of not only privacy but also of security, stability, and transparency. As supporting evidence, I first present PixelDP , a scalable certified defense against adversarial examples that leverages DP theory to guarantee a level of robustness against this attack. I then present Sage, a DP ML platform that bounds the leakage of personal secrets through ML models while addressing some of the most pressing challenges of DP, such as the "running out of privacy budget" problem. Both PixelDP and Sage are designed from a pragmatic systems perspective and illustrate that DP theory is powerful but requires adaptation to achieve practical guarantees for ML workloads. Bio: Roxana Geambasu is an Associate Professor of Computer Science at Columbia University and a member of Columbia's Data Sciences Institute. She joined Columbia in Fall 2011 after finishing her Ph.D. at the University of Washington. For her work in cloud and mobile data privacy, she received: an Alfred P. Sloan Faculty Fellowship, an NSF CAREER award, a Microsoft Research Faculty Fellowship, several Google Faculty awards, a "Brilliant 10" Popular Science nomination, the Honorable Mention for the 2013 inaugural Dennis M. Ritchie Doctoral Dissertation Award, a William Chan Dissertation Award, two best paper awards at top systems conferences, and the first Google Ph.D. Fellowship in Cloud Computing.

1 0

Prof. Andrew Houck, EE, Tuesday, Sept 10 at Quadrangle Club
by Emily C. Lawrence 03 Sep '19

03 Sep '19

A Princeton Propeller Event at Quadrangle Club Please join us for cocktails & hors d’oeuvres… 6:00pm, Tuesday, September 10th, 2019 33 Prospect Ave., Quadrangle Club Speaker: Prof. Andrew Houck, Electrical Engineering “Decoding the Realm(s) of Quantum Computing: Tilting at Tackling the Computationally Infeasible” Quantum Computing is poised to revolutionize myriad fields: cryptography, chemistry, medicine, optimization and machine learning. In contrast to familiar transistors, with a state 0 or 1, the quantum analog of a transistor or bit of information, aka a qubit, can be in a “superposition” of 0 and 1 simultaneously (e.g., 0 + 1, 0 - 1); and multiple qubits can be entangled, i.e., their states depend on each other. These two principles, superposition and entanglement, could enable powerful new algorithms to solve problems far beyond the capacity of today’s digital computing. Like the aviation term, “holding patterns,” maneuvers designed to delay something already in flight, while keeping it within a specified distance --- Quantum Computing may in the next decade bring such exciting new achievements as: factoring large numbers; allowing for RSA decryption; calculating binding energies of complex molecules; and solving large-scale brute-force problems. Andrew Houck, BSE Princeton 2000, PhD Harvard 2005, will introduce us to this strange new world and describe how it’s likely to transform ours. REGISTRATION REQUIRED via [ http://propellers.princetonaaa.org/ | http://propellers.princetonaaa.org/ ]

1 0

Marcela Melara will present her FPO, "Intra-Process Least Privilege and Isolation for Emerging Applications" on Thursday, 9/12/2019 at 1:30pm, in CS 402
by Nicki Mahler 29 Aug '19

29 Aug '19

Marcela Melara will present her FPO, " Intra-Process Least Privilege and Isolation for Emerging Applications" on Thursday, 9/12/2019 at 1:30pm in CS 402. The members of her committee are: Michael Freedman (adviser), Readers: Amit Levy and Mic Bowman (Intel Labs); Examiners: Wyatt Lloyd and Prateek Mittal (ELE) A copy of her thesis is available upon request. Everyone is invited to attend her talk. The abstract follows below: Third-party libraries reduce software development costs and e↵ort. Designed for flexible reuse, libraries implement a small set of features, allowing developers to build applications by combining libraries that provide the desired functionality. However, third-party code also poses a great risk: because the source code is rarely inspected or even accessible by the application developer, bugs or vulnerabilities that can leak sensitive data may go unnoticed. Yet, existing data protection tools are insucient because they do not enforce least privilege, restricting each library’s access to only those data it needs for its functionality. Prior academic proposals have addressed this issue with two main approaches: (1) running application components in separate processes for strong isolation, or (2) tracking individual data objects throughout the application to prevent unprivileged components from disclosing sensitive information. However, these approaches see limited real-world adoption because they introduce significant development overhead and integration complexity. This dissertation proposes intra-process least privilege, a design principle that facilitates enforcing least privilege for application developers by restricting access at the granularity of individual library functions, and strongly isolating data within a single process address space. We first present Pyronia, a privilege separation system for language runtimes that targets IoT device applications. To protect sensitive OS resources, Pyronia combines three access control techniques: system call interposition, stack inspection, and page table replication. Developers then specify data access rules only for directly imported third- party functions in a central policy. We next present Grin, a memory access control system for Intel SGX cloud applications. Intel SGX enables developers to run sensitive code inside an enclave, a hardware-protected memory region within an applications address space. However, in practice, developers often include untrusted third-party libraries in the enclave, giving them unfettered access to all inenclave data. Grin leverages Memory Protection Keys (MPK) to partition an enclave and assign per-compartment access rules. Developers declare sensitive data objects and access privileges for in-enclave functions. Grin then automatically confines these data objects in MPK compartments. Pyronia and Grin demonstrate the e↵ectiveness of our intra-process least privilege approach in today’s privacy-critical applications while easing integration e↵orts for developers

1 0

Borislav Hristov will present his FPO, "Deciphering Disease Genomes in a Network Context" on Thursday, 8/29/2019 at 11am in CS 402
by Nicki Mahler 21 Aug '19

21 Aug '19

Borislav Hristov will present his FPO, "Deciphering Disease Genomes in a Network Context" on Thursday, 8/29/2019 at 11am in CS 402. The members of his committee are as follows: Mona Singh (Adviser); Examiners: Ben Raphael and Bernard Chazelle; Readers: Olga Troyanskaya and Barbara Engelhardt. A copy of his thesis, is available upon request. Everyone is invited to attend his talk. The abstract follows below: Despite the incredible influx of sequencing data pinpointing the gene variants responsible for the development of heterogeneous diseases remains a particularly hard task because the same phenotypic outcome (disease) can result from a myriad of combinations of different alterations across the genome. A promising avenue is to consider genome alterations within the context of pathways because different alterations within any of several genes comprising the same pathway can have similar consequences with respect to disease development. Large-scale biological networks provide a helpful proxy for biological pathway knowledge as genes that participate in the same pathway tend to interact with each other and form modules within the larger network. In this dissertation, I introduce two novel methods that further our ability to computationally highlight potential disease-causing genes by examining disease genomes in the context of biological networks. First, in Chapter 2, I present a novel network-based approach which tackles cancer mutational heterogeneity by utilizing per-individual mutational profiles. I provide an intuitive formulation relying on balancing the size of a connected subgraph within the larger network with covering many patients. I describe a machine learning-like schema for selecting the value of the single required parameter and both an integer linear programming framework and a fast heuristic for optimizing the objective function. I demonstrate the outstanding performance of my method in identifying cancer-relevant genes, especially those mutated at very low rates. Next, in Chapter 3, I propose a general computational framework that uses prior knowledge of disease-associated genes to guide a network-based search for novel ones based upon newly acquired information. I use a graph di↵usion kernel to spread the signal from the set of already known disease genes and then use it to bias a random walk originating from the newly implicated genes to move closer to the known ones. I demonstrate that integrating the two types of information is better than using either one of them alone. I show, in the context of cancer, that my method readily outperforms other network-based methods. Finally, I apply my approach to several complex diseases, thereby demonstrating its versatility in a broad range of settings.

1 0

IEEE SSCS Distinguished Lecture Colloquium at Princeton - August 22, 2019 - E-Quad B205 - Prof. Zhihua Wang, Tsinghua University
by Emily Lawrence 20 Aug '19

20 Aug '19

Sent on behalf of Prof. Kaushik Sengupta **Refreshments at 1:00 pm and a chance to talk with speaker ** IEEE Princeton/Central Jersey Section - Distinguished Lecture Colloquium, August 2019 Speaker: Prof. Zhihua Wang, Tsinghua University Talk Title: Binaural Hearing Aid System and the Intelligent Acoustic Signal Processing Date: Thursday, August 22, 2019 Time: 1:30 - 2:30 p.m. Location: Princeton University, Department of Electrical Engineering, Engineering Quadrangle, Room B205 Abstract: Nowadays, the hearing aid technology is facing a new horizon based on advanced digital signal processing, wireless communication and artificial intelligence. In this lecture, new methodology with a systematic solution covering both the auditory periphery and the cognitive system is given. The up to date and rapidly evolves technologies for the binaural hearing aid system are well addressed. The multi-channel wide dynamic range compression, active noise reduction, self-adaptable directivity, acoustic scene analysis, and the wireless linking with other audio or communication systems are presented. The key technologies including the ultra-low power chip design, the advanced digital signal processing (DSP), and the wireless system integration and connectivity are discussed. The micromechanics and high performance electro-acoustics, the miniaturized antenna, the user interface, and the fitting system development are also the important aspects for the hearing aid technologies are shown in this lecture. A smart binaural hearing aid technology, which simultaneously processes the acoustic signals from the four microphones in both ears are indicated which utilizing the computing power from the smart phone to finish the advanced binaural DSP algorithms. Bio: Zhihua Wang (M'99-SM'04-F'17) received the B.S., M.S., and Ph.D. degrees in Electronic Engineering in 1983, 1985 and 1990, respectively, from Tsinghua University, Beijing, China, where he has served as full professor and Deputy Director of the Institute of Microelectronics since 1997 and 2000. He was a visiting scholar at CMU (1992-1993) and KU Leuven (1993-1994), and was a visiting professor at HKUST (2014.9-2015.3). His current research mainly focuses on CMOS RFIC and biomedical applications, involving RFID, PLL, low-power wireless transceivers, and smart clinic equipment combined with leading edge RFIC and digital image processing techniques. He has co-authored 12 books/chapters, over 183 (480) papers in international journals (conferences), over 244 (29) papers in Chinese journals (conferences) and holds 123 Chinese and 8 US patents. Prof. Wang has served as the chairman of IEEE SSCS Beijing Chapter (1999-2009), an AdCom Member of the IEEE SSCS (2016-2019), a technology program committee member of the IEEE ISSCC (2005-2011), a steering committee member of the IEEE A-SSCC (2005-), the technical program chair for A-SSCC 2013, a guest editor for IEEE JSSC Special Issues (2006.12, 2009.12 and 2014.11), an associate editor of IEEE Trans on CAS-I, CAS-II and IEEE Trans on BioCAS, and other administrative/expert committee positions in China's national science and technology projects. Contact Info: Nagi Naganathan, <mailto:nagisub@gmail.com> nagisub(a)gmail.com or Kaushik Sengupta, <mailto:kaushiks@princeton.edu> kaushiks(a)princeton.edu

1 0