צור קשר

לא מצאתם תשובה לשאלות שלכם באתר? למה שלא תשאלו אותנו?

To prevent automated spam submissions leave this field empty.

מהנדס/ת אפליקציה לתחום ה- PLM

דרישות התפקיד:

*במסגרת מדיניות האוניברסיטה לעידוד גיוון תעסוקתי, ניתנת עדיפות למועמדים העונים על דרישות התפקיד ומשתייכים לאוכלוסיות אלו: חברה ערבית, חרדים, יוצאי העדה האתיופית ומועמדים עם מוגבלות. רק פניות מתאימות תענינה. في إطار سياسة الجامعة لتشجيع التنوّع التوظيفيّ، تُعطى أولويّة للمرشّحين الذين يستوفون متطلّبات الوظيفة وينتمون إلى إحدى المجموعات التالية: المجتمع العربيّ، الحريديم، أبناء الطائفة الأثيوبيّة والمرشّحين أصحاب الإعاقات.

סטודנט/ית הבטחת איכות

סטודנט להנדסה תוכנה / מערכות מידע / איכות / תעשיה וניהול/ כלכלה

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

*נא לצרף גיליון ציונים*

הזמנה ליריד התעסוקה של המחלקה להנדסה ביו-רפואית

09 בינואר 2020, 14:00 - 17:00 
הפקולטה להנדסה אוניברסיטת תל-אביב  
חינם
יריד

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

 

יום חמישי, 9.1.2020 בין השעות 14:00-17:00
ברחבת הלובי של הבניין הרב תחומי (סמוך לשער 14), אוניברסיטת תל-אביב

לינק להזמנה

 

יום זרקור עם נציגי הגיוס של חברת אינטל

06 בינואר 2020, 11:00 
הפקולטה להנדסה אוניברסיטת תל-אביב  
יום זרקור אינטל

צוות הגיוס של חברת אינטל מגיע לפגוש את הסטודנטיות והסטודנטים של הפקולטה להנדסה אוניברסיטת תל-אביב, לדבר על העתיד ולייעץ על אפשרויות תעסוקה.

 

יום שני 6.1.2020,

שעה 11:00

לובי בניין וולפסון להנדסה מכנית.

 

מומלץ להגיע עם קו"ח

EE Seminar: Leveraging Programmable Switches for In-network Computing

30 בדצמבר 2019, 15:00 
Room 011, Kitot Building  

(The talk will be given in English)

 

Speaker:     Dr. Ran Ben Basat
                     Harvard University

 

Monday, December 30th, 2019
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

 

Leveraging Programmable Switches for In-network Computing

Abstract

The network line rate is constantly on the rise to support the exploding amounts of data. This means that we have less time to process individual packets, despite a growing demand for better network telemetry. Moreover, CPU speeds are not rising at the same rate as we near the end of Moore’s law, making it harder to rely on software computations. Programmable hardware switches are an emerging technology that enables flexible packet processing while optimizing for throughput and latency.

In this talk, I will introduce algorithms that leverage programmable switches for accelerating database operations and for improving network telemetry. Switches are orders of magnitude more efficient than traditional hardware accelerators, exist in the datapath, and are ideal for computation offloading. For telemetry, we will discuss how switches can probabilistically encode information across multiple packets to provide fine-grained network visibility with minimal overheads.

 

Short Bio
Ran is a postdoctoral fellow at Harvard University working on network monitoring and algorithms. He is partially sponsored by the Zuckerman and the Hiroshi Fujiwara Cyber Security Research Center postdoctoral fellowships. 

EE Seminar: Higher Criticism for discriminating frequency-tables and testing authorship

14 בינואר 2020, 15:00 
Room 011, Kitot Building  

(The talk will be given in English)

 

Speaker:     Dr. Alon Kipnis
                    Department of Statistics, Stanford University

 

TUESDAY, January 14th, 2020
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

 

Higher Criticism for discriminating frequency-tables and testing authorship

Abstract

The Higher Criticism (HC) test is a useful tool for detecting the presence of a signal spread across a vast number of features, especially in the sparse setting when only few features are useful while the rest contain only noise. We adapt the HC test to the two-sample setting of detecting changes between two frequency tables. We apply this adaptation to authorship attribution challenges, where the goal is to identify the author of a document using other documents whose authorship is known. The method is simple yet performs well without handcrafting and tuning. Furthermore, as an inherent side effect, the HC calculation identifies a subset of discriminating words, which allow additional interpretation of the results. Our examples include authorship in the Federalist Papers, machine-generated texts, and the identity of the creator of the Bitcoin.

We take two approaches to analyze the success of our method. First, we show that, in practice, the discriminating words identified by the test have low variance across documents belonging to a corpus of homogeneous authorship. We conclude that in testing a new document against the corpus of an author, HC is mostly affected by words characteristic of that author and is relatively unaffected by topic structure. Finally, we analyze the power of the test in discriminating two multinomial distributions under sparse and weak perturbations model. We show that our test has maximal power in a wide range of the model parameters, even though these parameters are unknown to the user.

Short Bio
Alon Kipnis is a postdoctoral scholar in the department of statistics at Stanford University. He received his B.Sc. degree in mathematics (summa cum laude) and his B.Sc. degree in electrical engineering (summa cum laude), both in 2010, and his M.Sc. degree in mathematics in 2012, all from Ben-Gurion University of the Negev. He received his Ph.D. degree in electrical engineering from Stanford University, where he is now a postdoctoral scholar in the Department of Statistics. His research combines data compression and dimensionality reduction techniques with classical methods in signal processing and machine learning.

.

EE Seminar: Cryptography for RAM Machines

13 בינואר 2020, 15:00 
Room 011, Kitot Building  

(The talk will be given in English)

 

Speaker:     Dr. Mor Weiss
                    IDC Herzliya

 

Monday, January 13th, 2020
15:00 - 16:00

Room 011, Kitot Bldg., Faculty of Engineering

 

Cryptography for RAM Machines

 

Abstract

Cryptography enables protecting communication and computation between multiple distrusting parties. Though it is known since the 1980’s that any function that can be computed, can be computed securely (i.e., while preserving the privacy of the inputs and the correctness of the output), actual implementations of these cryptographic protocols can incur prohibitive overheads. This is because the computation models used in these classic protocols are inconsistent with modern computation models, in which RAM programs are executed on huge datasets.

This talk will focus on designing new cryptographic solutions that operate in realistic computing models, presenting two new constructions. First, I will describe an Oblivious RAM, i.e., a RAM machine in which the access pattern into memory hides the memory contents, with enhanced security guarantees compared to the state of the art. Second, I will present a Fully Homomorphic Encryption scheme, namely encryption that provides the ability to compute on data while it is encrypted, which operates natively on RAM machines.

Short Bio
Mor Weiss is a post-doctoral researcher at IDC Herzliya. Prior to that she was a post-doctoral researcher atNortheastern University in Boston. She holds a PhD in Computer Science from theTechnion, as well as a BSc in Computer Science and a BSc in Mathematics fromthe Technion. Her main research field is cryptography.

עמודים

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