EE Seminar: On finding small subgraphs in bounded-degree graphs

Speaker: Yaniv Sabo

M.Sc. student under the supervision of Prof. Dana Ron

 

Wednesday, January 11th 2017 at 15:30

Room 011, Kitot Bldg., Faculty of Engineering

 

On finding small subgraphs in bounded-degree graphs

 

Abstract

 

We study the problem of finding a copy of a subgraph H in a graph G that is far from being free of having copies of H. We consider this problem in the bounded-degree graphs model. In this model, each of the n vertices has at most d neighbors, and an algorithm is allowed to make queries regarding the neighbors of vertices in the graph. The graph is said to be $\epsilon$-far from being H-free if more than $\epsilon$dn of its edges must be deleted to make the graph free from having copies of H.

 

We present an algorithm for finding a copy of H in graphs that are e-far from being H-free and have bounded (constant) treewidth. This algorithm makes a number of queries that is polynomial in 1/$\epsilon$, the size of H and the degree bound d. The complexity of the algorithm is independent of the number of vertices, n.

 

We also present an algorithm for the special case in which H is a path of length k. Our algorithm uses specific properties of graphs that are far from having k-paths. Finding k-paths was previously studied by Reznik (Master's thesis, Weizmann Institute of Science, 2011). Reznik gave an algorithm for the case in which G is cycle-free, where the query complexity of the algorithm is polynomial in k, d and 1/$\epsilon$. We propose a conjecture that, if proven to be true, implies that our algorithm works for any graph that is $\epsilon$-far from being k-path free with query complexity polynomial in k, d, and 1/$\epsilon$. As a sanity check, we establish the conjecture for cycle-free graphs.

11 בינואר 2017, 15:30 
חדר 011, בניין כיתות-חשמל  

EE Seminar: Coding for interactive communication over networks

(The talk will be given in English)

 

Speaker:     Dr. Klim Efremenko

CS, Tel Aviv University

 

Wednesday, January 4th, 2017
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

Coding for interactive communication over networks

Abstract

The modern era is an era of interactive communication between many parties, where many parties are actively sending messages based on the information they received. However, the errors may ruin the communication. In this talk, I will describe how one can convert multi-party protocol into error resilient as well I will show the limits of such schemes.

04 בינואר 2017, 15:00 
חדר 011, בניין כיתות-חשמל  

EE Seminar: How to prove the correctness of computations

(The talk will be given in English)

Speaker: Dr. Ron Rothblum

Weizmann Institute

Monday, January 2nd, 2017 15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

How to prove the correctness of computations

Abstract

Efficient proof verification is at the heart of the study of computation. Seminal results such as the IP=PSPACE Theorem [LFKN92,Shamir92] and the PCP theorem [AS92,ALMSS92] show that even highly complicated statements can be verified extremely efficiently. We study the complexity of proving statements using interactive protocols. Specifically, what statements can be proved by a polynomial-time prover to a super-efficient verifier. Our main results show that these proof-system are remarkably powerful: it is possible to prove the correctness of general computations such that (1) the prover runs in polynomial-time, (2) the verifier runs in linear-time (and in some conditions in sublinear-time) and (3) the interaction consists of only a constant number of communication rounds (and in some settings just a single round). These proof-systems are motivated by, and have applications for, delegating computations in a cloud computing environment, and guaranteeing that they were performed correctly.

02 בינואר 2017, 15:00 
חדר 011, בניין כיתות-חשמל  

ברכות ליניב גרטי

21 דצמבר 2016
בוגר הפקולטה להנדסה - הנדסת שחמל ואלקטרוניקב מונה למנכ"ל אינטל

ארגון בוגרי אוניברסיטת תל אביב מברך את בוגר הפקולטה לניהול ע"ש קולר אוניברסיטת תל אביב וחבר ארגון בוגרי הנדסה אוניברסיטת תל אביב, יניב גרטי, אשר מונה למנכ"ל חברת ההייטק והיצואנית הגדולה ביותר בארץ, אינטל ישראל, ויחל בתפקידו החדש ב-15 בינואר 2017.

ברכות!

ראו כתבה בכלכליסט

EE Seminar: Resource Efficient deep Learning

(The talk will be given in English)

 

Speaker:     Dr. Daniel Soudry
                    Department of Statistics, Columbia University

 

 

Wednesday, January 18th, 2017
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

Resource Efficient deep Learning

Abstract

Background: The recent success of deep neural networks (DNNs) relies on large computational resources (memory, energy, area and processing power). These resources pose a major bottleneck in our ability to train better models, and to use these models on low power devices (e.g., mobile phones). However, current generation DNNs seem tremendously wasteful, especially in comparison to the brain (which consumes only 12W). For example, typical DNNs use 32bit floating point operations, while the brain typically operates using binary spikes and with limited synaptic precision. Achieving such low precision in DNNs can significantly improve memory, speed and energy. However, until recently, 8 bits appeared to be the lowest possible limit.

 

Results: We show that it is possible to significantly quantize (even down to 1 bit) the activations and weights of DNNs trained by a variant of the backpropagation algorithm, while preserving good performance on various benchmarks (e.g., MNIST, ImageNet). Interestingly, the algorithm originated from first principles: we developed a closed form analytical approximation to the Bayes rule update of the posterior distribution of the binary DNN weights. At run-time, such a binarized DNN requires 32-fold less memory, is 7 times faster (using dedicated GPU kernels), and is at least 10-fold more energy efficient (using dedicated hardware). This can enable the use of trained DNNs in low power devices. Additional benefits are expected at train-time by further quantizing the gradients, potentially allowing larger and more sophisticated models to be trained.

18 בינואר 2017, 15:00 
חדר 011, בניין כיתות-חשמל  

EE Seminar: Handling huge fiber-sets in Diffusion-Weighted MRI Brain Analysis: The Fiber-Density-Coreset for redundancy reduction

Speaker: Guy Alexandroni,

M.Sc. student under the supervision of Prof. Hayit Greenspan.

 

Wednesday, January 11th, 2017 at 15:00

Room 011, Kitot Bldg., Faculty of Engineering

 

Handling huge fiber-sets in Diffusion-Weighted MRI Brain Analysis: The Fiber-Density-Coreset for redundancy reduction

 

Abstract

 

State of the art Diffusion Weighted Magnetic Resonance Imaging protocols (DW-MRI), followed by advanced tractography techniques, produce impressive reconstructions of white matter pathways in the brain. These pathways often contain millions of trajectories (fibers). While for several applications the high number of fibers is essential, other applications (visualization, registration, some types of across-subject comparison) can achieve satisfying results using much smaller sets and may be overburdened by the computational load of the large fiber sets.

In this work, we present a novel, highly efficient algorithm for extracting a meaningful subset of fibers, which we term the Fiber-Density-Coreset (FDC). The reduced set is optimized to represent the main structures of the brain. FDC is based on an efficient geometric approximation paradigm named coresets, an optimization scheme showing much success in tasks requiring large computation time and/or memory. The reduced sets were evaluated by several methods, including a novel structural comparison to the full sets called 3D indicator structure comparison. The comparison was applied to High Angular Resolution Diffusion Imaging (HARDI) scans of 15 healthy individuals obtained from the Human Connectome Project. FDC produced the most satisfying subsets, consistently in all subjects. It also displayed low memory usage and significantly lower running time than conventional fiber reduction schemes.

Additional tools, developed for handling huge fiber-sets such as fiber compression by sparse representation and automatic tract segmentation methods, will be briefly reviewed as well

11 בינואר 2017, 15:00 
חדר 011, בניין כיתות-חשמל  

EE Seminar: From scaling disparities to integrated parallelism: Space-division multiplexing in fiber-optic communications

 (The talk will be given in English)

 

Speaker:     Dr. Peter Winzer
                    Bell Labs

 

Monday, January 16th, 2016
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

From scaling disparities to integrated parallelism: Space-division multiplexing in fiber-optic communications

Abstract
The evolution of network traffic and communication technologies over the past 10+ years and their projections into the coming 10+ years reveal increasingly pronounced scaling disparities between technologies used to create and process data and technologies used to transport data. In core networks, we expect the need for 10+ Terabit/s transponders working over Petabit/s systems within the coming decade. However, with the help of digital coherent detection, advanced multi-dimensional modulation, shaping, and coding, these systems are now rapidly approaching recently established estimates for the Shannon capacity of the nonlinear fiber-optic channel. By 2020, leading-edge network operators will require capacities that are physically impossible to implement using conventional optical transmission technologies. Highly integrated spatially parallel optical transmission solutions (Space-Division Multiplexing, SDM) seem to be the only long-term viable path to overcome the looming optical networks capacity crunch. We discuss the implications of ultimately unavoidable spatial crosstalk in highly parallel SDM systems and examine how multiple-input-multiple-output (MIMO) digital signal processing, well established in wireless communications (albeit on a different set of boundary conditions), can be used to scale optical core networks. A look at information theoretic security enabled by SDM-based fiber-optic transmission systems rounds off our discussion.

 

Bio
Peter J. Winzer received his Ph.D. in electrical engineering from the Vienna University of Technology, Austria, in 1998. Supported by the European Space Agency (ESA), he investigated photon-starved space-borne Doppler lidar and laser communications using high-sensitivity digital modulation and detection. At Bell Labs since 2000, he has focused on various aspects of high-bandwidth fiber-optic communication systems, including Raman amplification, advanced optical modulation formats, multiplexing schemes, and receiver concepts, digital signal processing and coding, as well as on robust network architectures for dynamic data services. He contributed to several high-speed and high-capacity optical transmission records with interface rates from 10 Gb/s to 1 Tb/s, including the first 100G and the first 400G electronically multiplexed optical transmission systems and the first field trial of live 100G video traffic over an existing carrier network. Since 2008 he has been investigating and internationally promoting spatial multiplexing as a promising option to scale optical transport systems beyond the capacity limits of single-mode fiber. He currently heads the Optical Transmission Systems and Networks Research Department at Bell Labs in Holmdel, NJ. He has widely published and patented and is actively involved in technical and organizational tasks with the IEEE Photonics Society and the Optical Society of America (OSA), currently serving as Editor-in-Chief of the IEEE/OSA Journal of Lightwave Technology. He has been Program Chair of the 2009 European Conference on Optical Communications (ECOC) and Program Chair and General Chair of the 2015 and 2017 Optical Fiber Communication Conference (OFC). Dr. Winzer is a Bell Labs Fellow, a Fellow of the IEEE and the OSA, and a 2015 Thomson Reuters Highly Cited Researcher, the only one from industry in Engineering.
 

16 בינואר 2017, 15:00 
חדר 011, בניין כיתות-חשמל  

EE Seminar: Learning to act from observational data

(The talk will be given in English)

 

Speaker:     Dr. Uri Shalit
                   Courant Institute of Mathematical Sciences, New York University

 

Sunday, January 1st, 2017
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

Learning to act from observational data

Abstract

The proliferation of data collection in the health, commercial, and economic spheres, brings with it opportunities for extracting new knowledge with concrete policy implications. Examples include individualizing medical practices based on electronic healthcare records, and understanding the implications of job training programs on employment and income.

The scientific challenge lies in the fact that standard prediction models such as supervised machine learning are often not enough for decision making from this so-called “observational data”: Supervised learning does not take into account causality, nor does it account for the feedback loops that arise when predictions are turned into actions. On the other hand, existing causal-inference methods are not adapted to dealing with the rich and complex data now available, and often focus on populations, as opposed to individual-level effects.
The problem is most closely related to reinforcement learning and bandit problems in machine learning, but with the important property of having no control over experiments and no direct access to the actor’s model.

In my talk I will discuss how we apply recent ideas from machine learning to individual-level causal-inference and action. I will introduce a novel generalization bound for estimating individual-level treatment effect, and further show how we use representation learning and deep temporal generative models to create novel algorithms geared towards this problem. Finally, I will show experimental results using data from electronic medical records and data from a job training program.

 

Bio

Uri Shalit is a postdoctoral researcher in the Courant Institute of Mathematical Sciences, New York University, working at David Sontag's Clinical Machine Learning Lab. His research is focused on creating new methods for finding causal relationships in large-scale high-dimensional observational studies. One of the major motivations for his research is applications in healthcare and clinical medicine. Uri completed his PhD studies at the School of Computer Science & Engineering at The Hebrew University of Jerusalem, under the guidance of Prof. Gal Chechik and Prof. Daphna Weinshall. From 2011 to 2014 Uri was a recipient of Google's European Fellowship in Machine Learning. Previously he has received the Daniel Amit fellowship for significant contribution in theoretical or computational neuroscience, and the Alice and Jack Ormut Foundation PhD Fellowship.

01 בינואר 2017, 15:00 
חדר 011, בניין כיתות חשמל  

EE Seminar: 5th Generation Mobile Communications - An Overview of Research and Challenges in the Related RF-Circuitry

(The talk will be given in Hebrew)

 

Speaker:     Dr. Oren Eliezer
                       PHAZR

 

Wednesday, December 21st, 2016
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

 

5th Generation Mobile Communications - An Overview of Research and Challenges in the Related RF-Circuitry

 

Abstract

5th generation cellular communication systems are expected to be deployed in 2020, following the pace of one generation per decade that has been experienced ever since the first generation. While the 3GPP standardization group efforts are ongoing, some pre-standard systems are already being developed, demonstrating data-rates that can exceed 1Gpbs per user.

This seminar will present some of the RF-circuitry related challenges associated with the design and deployment of 5th generation cellular systems, and will highlight several different fields of ongoing research, which may offer career/business/research opportunities. The work of several leading researchers in the field will be discussed and some industry examples will be shown.

In particular, the challenges associated with efficient use of spectrum and power-efficient transmission will be discussed.

 

Bio
Dr. Oren Eliezer has 28 years of experience in the design and productization of wireless communication systems and ICs.

He received his BSEE and MSEE degrees from the Tel-Aviv University in 1988 and in 1997, focusing on communication systems and signal processing, and his PhD in microelectronics from the University of Texas at Dallas in 2008.

After serving for 6 years as an engineer in the IDF, he co-founded Butterfly Communications, which was acquired by Texas Instruments (TI) in 1999.

He was relocated by TI to Dallas in 2002, where he was elected senior member of the technical staff, and took part in the development of TI’s digital-radio-processor (DRP) technology.

Since 2009 he has been involved in academic research and teaching at the University of Texas at Dallas and the University of North Texas, as well as in entrepreneurship with several startup companies in the Dallas area.

He is currently with PHAZR, a pioneer in millimeter-wave wireless systems for 5th generation cellular communications.

He has authored and coauthored over 55 journal and conference papers and over 45 patents, and has given over 50 tutorials related to communication system and IC design and productization.

He is a senior member of the IEEE, regularly reviews papers for various IEEE publications and serves on the organizing committees of 4 different IEEE conferences.

21 בדצמבר 2016, 15:00 
חדר 011, בניין כיתות חשמל  

PDF טופס השתתפות בסמינרים מחלקתיים - המחלקה למדע והנדסה של חומרים
pdf טופס השתתפות שהייה מודרכת במעבדת מחקר -  המחלקה למדע והנדסה של חומרים
pdf טופס חניכה אישית
pdf טופס השתתפות לשהייה מודרכת במעבדת מחקר
pdf טופס השתתפות בסיורים קבוצתיים מאורגנים

עמודים

אוניברסיטת תל אביב עושה כל מאמץ לכבד זכויות יוצרים. אם בבעלותך זכויות יוצרים בתכנים שנמצאים פה ו/או השימוש שנעשה בתכנים אלה לדעתך מפר זכויות
שנעשה בתכנים אלה לדעתך מפר זכויות נא לפנות בהקדם לכתובת שכאן >>