סמינר מחלקתי של אלכס אבילביץ'- כוחות מתיחה בוירולוגיה: גורמים מכניים לשחרור גנום ולטרנספורמציה של תאי מארח במהלך זיהום

07 ביולי 2025, 14:00 - 15:00 
 
סמינר מחלקתי של אלכס אבילביץ'- כוחות מתיחה בוירולוגיה: גורמים מכניים לשחרור גנום ולטרנספורמציה של תאי מארח במהלך זיהום

Tensile Forces in Virology: Mechanical Drivers of Genome Release and Host Cell Transformation During Infection

Wednesday July 7th 2025 at 14:00 

Wolfson Building of Mechanical Engineering, Zoom

Abstract:

Viruses are nanoscale machines that exploit extreme mechanical forces to drive infection. In this talk, I will explore how tensile and compressive forces regulate the herpesvirus life cycle—from genome packaging under pressure to nuclear remodeling during replication. Inside the viral capsid, the DNA is so tightly packed that it generates internal pressures exceeding tens of atmospheres. This immense pressure acts as the driving force for rapid genome ejection into the host nucleus, with a force comparable to a biological bullet. Using a multidisciplinary platform combining X-ray and neutron scattering with bio-atomic force microscopy (BioAFM), we have quantified these forces and visualized how viral DNA physically transforms the host cell nucleus. Our findings uncover a new mechanical layer of viral replication and suggest strategies for antiviral design that exploit the physical vulnerabilities of the viral life cycle.

 

Bio:

Alex Evilevitch is a professor at the Faculty of Medicine, Lund University, and an internationally renowned researcher with a distinguished background in interdisciplinary research at the intersection of biophysics, virology, and physical chemistry. He earned his PhD in Physical Chemistry from Lund University in 2001 and pursued a STINT postdoctoral fellowship at UCLA between 2002 and 2003. His academic journey includes tenured faculty appointments at Lund University (Sweden), Carnegie Mellon University (USA), and the University of Illinois at Urbana-Champaign (USA).

 

Evilevitch's work has significantly advanced the understanding of viral genome packaging and infectivity, with a particular focus on capsid mechanics and the internal pressure and confinement forces acting on viral genomes. His research reveals how these physical parameters drive genome ejection into host cells and how infection leads to mechanical transformations within the host nucleus and chromatin architecture, influencing the outcome of viral replication. His translational research addresses key challenges in herpes virology and gene therapy, leading to the development of non-resistance-based antiviral therapies and improved viral vector production methods, for which he holds several U.S. patents.

He has received numerous international awards, including the Hebert Newby McCoy Award for the most important contribution in the field of chemistry at UCLA and the Hagberg Prize in Biochemistry from the Swedish Royal Academy of Sciences.

 

 

 

 

 

 

 

 

 

סמינר מחלקתי של ד"ר מאיה קליימן

17 בנובמבר 2025, 14:00 - 15:00 
 
סמינר מחלקתי של ד"ר מאיה קליימן

פרטים יפורסמו בהמשך

סמינר מחלקתי של עומרי שלטיאל- 3.11.25

03 בנובמבר 2025, 14:00 - 15:00 
 
סמינר מחלקתי של עומרי שלטיאל- 3.11.25

פרטים יפורסמו בהמשך 

סמינר מחלקתי של עזרא בן אבו- 27.10.25

27 באוקטובר 2025, 14:00 - 15:00 
 
סמינר מחלקתי של עזרא בן אבו- 27.10.25

פרטים יפורסמו בהמשך

EE ZOOM Seminar: Conditional Inverse Sampling for the Design of Antennas in Complex Environments

25 ביוני 2025, 15:00 
סמינר זום  
EE ZOOM Seminar: Conditional Inverse Sampling for the Design of Antennas in Complex Environments

https://Intuitive.zoom.us/j/96079672856?pwd=voqmtJqqGpz3BXC1UlYBnX05P475gu.1
 

Electrical Engineering Systems Seminar

 

Speaker: Moshe Yelisevitch

M.Sc. student under the supervision of Prof. Haim Yelisevitch

 

Wednesday, 25th June 2025, at 15:00

 

Conditional Inverse Sampling for the Design of Antennas in Complex Environments

Abstract

The design of compact, high-performance antennas remains a formidable challenge due to the intricate relationship between structural geometry, material, and electromagnetic behavior. Traditional design approaches rely on iterative tuning and brute-force search, often requiring extensive electromagnetic (EM) simulations that are computationally expensive and time-consuming. Furthermore, real-world constraints such as environmental interactions, fabrication limitations, and nonlinear geometry-performance dependencies make it difficult to generate antennas that are both optimal and physically realizable. To address these challenges, we propose a novel Conditional Neural Inverse Transform Sampler (C-NITS) framework for inverse antenna design. Unlike conventional optimization-based approaches, our method learns to map desired electromagnetic characteristics, including reflection coefficient and radiation pattern, to a distribution of feasible antenna geometries, directly generating solutions that satisfy both performance and manufacturability constraints. Our approach extends the Neural Inverse Transform Sampler (NITS) to a conditional formulation, enabling controllable sampling based on environmental parameters such as substrate properties and nearby obstructions. By leveraging a learned inverse model and a fast surrogate simulation network, our framework efficiently explores high-dimensional design spaces without exhaustive full-wave EM simulations. A key feature of our method is its ability to generate diverse, multiple antenna solutions, rather than converging to a single optimal design. This enables engineers to explore multiple feasible configurations that satisfy design objectives while considering fabrication and environmental constraints. Furthermore, we incorporate a structured selection mechanism that filters generated designs to ensure real-world feasibility criteria. Our experiments demonstrate that C-NITS significantly outperforms traditional optimization techniques and existing deep-learning-based inverse design models in terms of EM similarity - both in numerical accuracy (e.g., pixel-wise comparisons) and structural similarity - as well as in engineering-relevant performance metrics. By combining conditional generative modeling with physics-aware constraints, our framework advances the state of automated antenna design, making it more adaptable and scalable for real-world applications.

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום בצ'ט של שם מלא + מספר ת.ז.

 

 

 

EE ZOOM Seminar: Automated Computerized Analysis of Pulmonary Embolism Prognosis using Multimodal Deep Learning Diagnostic Tools

29 ביוני 2025, 15:00 
סמינר זום  
EE ZOOM Seminar: Automated Computerized Analysis of Pulmonary Embolism Prognosis using Multimodal Deep Learning Diagnostic Tools

https://tau-ac-il.zoom.us/j/82455834599?pwd=4MbO0LWdYoRespFabd9sGSTuGUNi6y.1

Meeting ID: 824 5583 4599

 Passcode: 291308

 

Electrical Engineering Systems ZOOM Seminar

 

Speaker: Noa Cahan

Ph.D. student under the supervision of Prof. Hayit Greenspan

 

Sunday, 29th June 2025, at 15:00

 

 

Automated Computerized Analysis of Pulmonary Embolism Prognosis using Multimodal Deep Learning Diagnostic Tools

Abstract

In this research, we focus on deep learning applications for the detection, delineation, and risk stratification of pulmonary embolism (PE) - a critical, life-threatening condition. Rapid and accurate risk stratification can decrease PE mortality rates. Computed Tomography Pulmonary Angiography (CTPA) is the gold standard diagnostic tool. Unlike previous research that predominantly relies on imaging-only approaches for PE clot detection, our work innovatively integrates various data modalities, enhancing the accuracy and efficiency of risk assessments. The data includes: (1) Imaging Data: Computed Tomography Pulmonary Angiography (CTPA), Chest X-Rays, and Electrocardiograms. (2) Tabular Clinical Data: demographics, comorbidities, vital signs, laboratory results, and clinical scores. The research addresses prevalent challenges including limited annotated data, biases in existing models, and ensuring robustness in the developed AI tools. A significant emphasis is placed on explainability in AI models, ensuring transparency and trust in medical decision-making processes. Further, motivated by recent advancements in generative AI, we intend to pioneer the use of few-shot learning and cross model transfer, applying diffusion models to transform 2D-X-rays into 3D-CTPA equivalents. The generated 3D-CTPA, can later be used for PE classification. Success in this endeavor could potentially eliminate the need for CTPA scans.

To our knowledge, no prior studies have automated PE severity assessment or used diffusion models for X-ray to CT conversion. Our solutions aim to expedite diagnosis, enhance treatment times, and refine risk assessments. The tasks defined could improve the ability to direct preventative and health surveillance resources and advance healthcare as a whole. The specific papers we will present in this talk include:

  1. Multimodal fusion models for pulmonary embolism mortality prediction.
  2. X-ray2CTPA: Leveraging Diffusion Models to Enhance Pulmonary Embolism Classification.
  3. Cross-Modal CXR-CTPA Knowledge Distillation using latent diffusion priors towards CXR Pulmonary Embolism Diagnosis.

 

 

EE ZOOM Seminar: Task Nuisance Filtration for Unsupervised Domain Adaptation

22 ביוני 2025, 15:00 
ZOOM Seminar  
EE ZOOM Seminar: Task Nuisance Filtration for Unsupervised Domain Adaptation

https://tau-ac-il.zoom.us/j/82634921282?pwd=7Im8wd0FCJ7D0pIAMVoNglffXBaUrY.1
Meeting ID: 826 3492 1282
Passcode: 115437

 

Electrical Engineering Systems ZOOM Seminar

 

Speaker: David Uliel

M.Sc. student under the supervision of Prof. Raja Giryes

 

Sunday, 22nd June 2025, at 15:00

 

Task Nuisance Filtration for Unsupervised Domain Adaptation

Abstract

In unsupervised domain adaptation (UDA) labeled data is available for one domain (Source

Domain) which is generated according to some distribution, and unlabeled data is available for a second domain (Target Domain) which is generated from a possibly different distribution but has the same task.

The goal is to learn a model that performs well on the target domain although labels are available only for the source data. Many recent works attempt to align the source and the target domains by matching their marginal distributions in a learned feature space. In this paper, we address the domain difference as a nuisance, and enables better adaptability of the domains, by encouraging minimality of the target domain representation, disentanglement of the features, and a smoother feature space that cluster better the target data. To this end, we use the information bottleneck theory and a classical technique from the blind source separation framework, namely, ICA (independent components analysis). We show that these concepts can

improve performance of leading domain adaptation methods on various domain adaptation benchmarks.

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום בצ'ט של שם מלא + מספר ת.ז.

 

 

EE ZOOM Seminar: Collaborative Preference Learning

18 ביוני 2025, 16:00 
סמינר זום  
EE ZOOM Seminar: Collaborative Preference Learning

https://tau-ac-il.zoom.us/j/86876252910?pwd=uhoOq5zjVquXvqFph3b3GcVlC5Pbq0.1
Meeting ID: 868 7625 2910
Passcode: 884113

Electrical Engineering Systems Seminar

 

Speaker: Tal Kravarusic

M.Sc. student under the supervision of Dr. Wasim Huleihel

 

Wednesday, 18th June 2025, at 16:00

Collaborative Preference Learning

Abstract

Preference learning from pairwise comparisons plays a central role in machine learning, with broad applications in recommendation systems, ranking tasks, and decision-making processes. In this paper, we study the problem of online preference learning in a challenging multi-user setting, where each user provides at most a single comparison for any pair of items. This setup significantly limits the available data, making standard averaging techniques inapplicable. To address this, we propose a collaborative learning framework that leverages the structural similarity among users. Each user is modeled by a latent pairwise preference matrix, from which Borda scores, quantifying the likability of each item, can be derived. These scores serve as a robust surrogate for full rankings, especially under noise or partial observations. We assume users belong to a small number of hidden types or rankings, which enables clustering and knowledge sharing across users. Under standard assumptions, such as non-ambiguity, incoherence between types, and strong stochastic transitivity, we introduce algorithms to recover Borda scores and identify top-ranked items. Our algorithms combine type-based clustering, empirical estimation, and noisy matrix completion to produce accurate inferences with provable guarantees. We provide two main recovery results: one under incoherence assumptions and one without, relying instead on ranking-level structure. Additionally, we propose a binary-search-style algorithm for efficiently identifying the top L items without recovering full rankings. In all cases, we derive bounds on the sample complexity required for successful inference. Our work contributes practical algorithms and theoretical insights for preference learning under highly constrained data, advancing the applicability of collaborative learning in real-world systems.

 

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום בצ'ט של שם מלא + מספר ת.ז.

 

EE ZOOM Seminar: Low-Resource Reconstruction of Template-Memorized Images — Attack against Diffusion Models

18 ביוני 2025, 15:00 
ZOOM Seminar  
EE ZOOM Seminar: Low-Resource Reconstruction of Template-Memorized Images — Attack against Diffusion Models

https://tau-ac-il.zoom.us/j/85063969240?pwd=t2xMC9bTXyQ2mtCTfTkywVCGJ8SvFc.1
Meeting ID: 850 6396 9240
Passcode: 529492

Electrical Engineering Systems Seminar

 

Speaker: Sol Yarkoni

M.Sc. student under the supervision of Prof. Roi Livni

 

Wednesday, 18th June 2025, at 15:00

 

Low-Resource Reconstruction of Template-Memorized Images — Attack against Diffusion Models
Abstract

Diffusion models trained on large-scale datasets such as LAION have become foundational to modern generative AI. However, their reliance on uncurated web data introduces serious privacy risks, particularly through the unintended extraction of training images. This seminar presents the findings of the research paper “Low Resource Reconstruction Attacks Through Benign Prompts”, recently submitted to NeurIPS and an ICML workshop.

The talk introduces a low-resource image reconstruction attack capable of extracting template-memorized content from diffusion models using only black-box access and natural English prompts such as “Abstract Art T-Shirt.” The attack successfully reconstructs training images, including some containing real, identifiable individuals.

To contextualize the attack, the talk will also review the phenomenon of template memorization and examine how data scraped from e-commerce websites contributes to the image–text coupling hypothesized to underlie this behavior.

Sol Yarkoni is an M.Sc. student, experienced data scientist in computer vision, and generative artist.

 

השתתפות בסמינר תיתן קרדיט שמיעה = עפ"י רישום בצ'ט של שם מלא + מספר ת.ז.

 

 

 

 

EE ZOOM Seminar: The Algorithmic Bias of 1st Order Methods

30 ביוני 2025, 15:00 
 
EE ZOOM Seminar: The Algorithmic Bias of 1st Order Methods

https://tau-ac-il.zoom.us/j/82194207072?pwd=7rKWjTpzhk5r5xCA65pgGGO9rieapJ.1
Meeting ID: 821 9420 7072
Passcode: 040024

 

Electrical Engineering Systems ZOOM Seminar

 

Speaker: Idan Amir

Ph.D. student under the supervision of Prof. Roi Livni

 

Monday, 30th May 2025, at 15:00

 

The Algorithmic Bias of 1st Order Methods

Abstract

We explore the interplay between optimization and generalization in stochastic convex optimization and overparameterized settings. Our result establishes a separation between Stochastic Gradient Descent (SGD) and full-batch Gradient Descent (GD), showing that SGD generalizes efficiently with O(1/ϵ^2) iterations, while GD requires Ω(1/ϵ^4), even with regularization. Further, the work examines full-batch optimization methods, revealing dimension-dependent inefficiencies that limit their generalization performance compared to stochastic methods. Finally, it demonstrates that early-stopped GD can achieve optimal generalization in Generalized Linear Models (GLMs) with O(1/ϵ^2) complexity by leveraging implicit regularization and problem-specific geometry. Together, these works advance the understanding of efficient learning in high-dimensional and overparameterized regimes.

עמודים

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