קולוקוויום וסמינרים

כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.


Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.

Academic Calendar at Technion site.

קולוקוויום וסמינרים בקרוב

  • Pixel Club: Cinema 3D: Large Scale Automultiscopic Display

    דובר:
    נטלי אפרת (מכון ויצמן למדע)
    תאריך:
    יום שלישי, 28.6.2016, 11:30
    מקום:
    חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל

    While 3D movies are gaining popularity, viewers in a 3D cinema still need to wear cumbersome glasses in order to enjoy them. Automultiscopic displays provide a better alternative to the display of 3D content, as they present multiple angular images of the same scene without the need for special eyewear. However, automultiscopic displays cannot be directly implemented in a wide cinema setting due to variants of two main problems: (i) The range of angles at which the screen is observed in a large cinema is usually very wide, and there is an unavoidable tradeoff between the range of angular images supported by the display and its spatial or angular resolutions. (ii) Parallax is usually observed only when a viewer is positioned at a limited range of distances from the screen. This work proposes a new display concept, which supports automultiscopic content in a wide cinema setting. It builds on the typical structure of cinemas, such as the fixed seat positions and the fact that different rows are located on a slope at different heights. Rather than attempting to display many angular images spanning the full range of viewing angles in a wide cinema, our design only displays the narrow angular range observed within the limited width of a single seat. The same narrow range content is then replicated to all rows and seats in the cinema. To achieve this, it uses an optical construction based on two sets of parallax barriers, or lenslets, placed in front of a standard screen. This paper derives the geometry of such a display, analyzes its limitations, and demonstrates a proof-of-concept prototype.

    Bio:
    Netalee Efrat is a PhD student at The Weizmann Institute, specializing in computer vision. Her main interests are image processing and computational photography. She finished MSc from Ben-Gurion University in bio-medical engineering, under the direct track for excellent students, specializing in signal processing.

  • The Infinite Odometry

    דובר:
    אלכסנדר קריימר, הרצאה סמינריונית למגיסטר
    תאריך:
    יום רביעי, 29.6.2016, 12:00
    מקום:
    טאוב 601
    מנחה:
    Prof. E. Rivlin, Prof. I. Shimshoni

    In this work we revisit the problem of visual odometry. Visual odometry is the process of estimating the motion of the camera by examining the changes that the motion induces on the images made by it. The approach we propose exploits a scene structure typical for that seen by a moving car and is suitable for use in either the stereo or the monocular setting. We recover the rotation and the translation separately, thus dealing with two separate, smaller problems. The rotation is estimated by means of the infinite homography. The rotation estimation algorithm operates on distant image points using the 3-D to partition them into the distant and the near-by ones. We start with an initial estimate and then refine it using an iterative procedure. After the rotation is compensated for, the translation is found by means of the 1-point algorithm in the stereo setting and epipole computation for pure translational motion in the monocular setting.

  • Mutual enrichment in aggregated ranked lists with applications to gene expression regulation

    דובר:
    דליה אלפרוביץ', הרצאה סמינריונית למגיסטר
    תאריך:
    יום חמישי, 30.6.2016, 10:00
    מקום:
    טאוב 601
    מנחה:
    Dr. Zohar Yakhini, Assoc. Prof. Yael Mandel-Gutfreund

    It is often the case in biological measurement data that results are given as a ranked list of quantities, for example differential expression (DE) of genes as inferred from microarrays or RNA-seq. Recent years brought considerable progress in statistical tools for enrichment analysis in ranked lists. Several tools are now available that allow users to break the fixed set paradigm in assessing statistical enrichment of sets of genes. Continuing with the example, these tools identify factors that may be associated with measured differential expression. Further improving these tools, we would like to address relationships between factors. For example, genes targeted by multiple miRNAs may play a central role in measured DE signal but the effect of each single miRNA is too subtle to be detected. We propose statistical and algorithmic approaches for selecting, from an input collection of factors, a sub-collection that can be aggregated into one ranked list that is heuristically most associated with an input ranked list (pivot). A naive approach to this task is exponential in the number of factors under consideration. We examine performance on simulated data and apply our approach to cancer datasets. We find small sub-collections of miRNA that are statistically associated with gene DE in several types of cancer, suggesting miRNA cooperativity in driving disease related processes. Many of our findings are consistent with known roles of miRNAs in cancer, while others suggest previously unknown roles for certain miRNAs.

  • Flexible Resource Allocation for Network Problems

    דובר:
    אריאלה וולושין, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום חמישי, 30.6.2016, 13:00
    מקום:
    טאוב 601
    מנחה:
    Prof. Shmuel Zaks and Prof. Hadas Shachnai

    Resource allocation problems arise in a wide range of applications. In many of these classic problems, we are given a set of requests competing for resources, where each request utilizes predefined amounts of the resources. We seek a feasible allocation of the resources, subject to availability constraints, so as to maximize (or, minimize) certain objective function. However, in recent applications, such as flex-grid all-optical networks, cloud computing, and cellular networks, resource requests may be partially satisfied, and the amounts of allocated resources come into play in the objective function. These scenarios motivate the study of flexible variants of classic resource allocation problems. In this talk, I will present our results for such flexible resource allocation problems, where each request can be allocated an amount of the resource within a specified range, with some profit accrued from each allocated resource unit. The goal is to feasibly assign the available resources, such that the total profit is maximized. This includes, among others, flexible variants of the well known Bandwidth Allocation and Storage Allocation problems, as well as Flexible Scheduling on Related Machines with Assignment Restrictions.

  • Coding Theory: Consecutive Switch Codes

    דובר:
    שרית בוזגלו (אונ' קליפורניה(
    תאריך:
    יום ראשון, 3.7.2016, 14:30
    מקום:
    טאוב 601

    Switch codes are a coding scheme which enables one to encode the input packets into the banks such that the packet requests by the output ports can be answered efficiently. Mathematically speaking, a switch code is required to satisfy the following property. Assume that there are n​ input ports, k​ output ports, and m​ banks. In each generation the n​ packets from the input ports are encoded into m​ packets which are stored in the banks. Then, every request from the output ports for k​ packets, which may come from previous generations, has to be answered by reading at most one packet from each bank.

    In this work we present a construction of binary switch codes that improves upon the best binary switch codes for the case n=k​. We also study a new type of switch codes that can simultaneously deliver large symbol requests and good coding rate. These attractive features are achieved by relaxing the request model to a natural sub-class we call consecutive requests. In an ℓ​-consecutive request of k​ packets, the k​ packets are required to belong to ℓ​-consecutive generations. For this new request model we define a new type of codes called consecutive switch codes. These codes are studied in both the computational and combinatorial models, corresponding to whether the data can be encoded or not. We present several code constructions and prove the optimality of our construction of combinatorial 2-consecutive switch codes.

    Joint work with Eitan Yaakobi, Yuval Cassuto, and Paul H. Siegel.

  • בית-ספר קיץ החמישי בנושא סייבר אבטחת מחשוב ומידע

    The 5th TCE Summer School on Cyber and Computer Security

    תאריך:
    יום ראשון, 4.9.2016, 09:00
    מקום:
    אולם 1003, בניין מאייר, הפקולטה להנדסת חשמל

    בימים א'-ה', 4-8 בספטמבר 2016 יערוך המרכז להנדסת מחשבים בטכניון את כנס הקיץ השנתי החמישי שלו בנושא סייבר ואבטחת מחשוב ומידע. ראשי הכנס, פרופ' אלי ביהםופרופ' אור דונקלמן, וכן הדוברים בכנס, הם ממובילי התחומים בארץ ובעולם.

    מרבית ההרצאות תינתנה באנגלית. ההשתתפות בכנס חופשית אך מחייבת רישום מוקדם – שימו לב שההרשמה הינה לכל יום בנפרד.

    מארגני הכנס:
    אלי ביהם (מדעי המחשב, טכניון)
    אור דונקלמן (מדעי המחשב, אוניברסיטת חיפה)

    דוברים ראשיים:
    George Danezis, University College London
    Sharon Goldberg, Boston University
    David Naccache, École Normale Supérieure
    Kenny Paterson, Royal Holloway, University of London

    מידע נוסף הרשמה.

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