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

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


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

Academic Calendar at Technion site.

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

  • Hardware Security Seminar: Intel SGX keys Management and Trusted Computing Base (TCB) Recovery

    Hardware Security Seminar: Intel SGX keys Management and Trusted Computing Base (TCB) Recovery

    דובר:
    איליה אלכסנדרוביץ (אינטל)
    תאריך:
    יום ראשון, 24.6.2018, 09:30
    מקום:
    טאוב 601

    Bugs, possibly leading to security flaws, are inevitable in the extremely complex modern processors. Some of such bugs may be later fixed in the field by patching processor firmware. In this presentation we will review mechanisms provided by the Intel Software Guard Extensions (SGX) architecture to recover from security vulnerabilities and to re-establish trust in the recovered platform.

    Bio:
    Ilya Alexandrovich is a Principal Engineer in the Intel Core Architecture Group. Since joining Intel eight years ago, he was working on the Intel Software Guard Extensions (SGX) architecture and micro-architecture. Prior to joining Intel he held various senior engineering position at Flash Networks, Lightsand and LanOptics. Ilya holds more than 25 registered patents in the computer security and telecommunications areas. Ilya holds a MSc degree in Physics of Solid State from the Tashkent State Technical University.

  • CGGC Seminar: An Explicit Structure-preserving Numerical Scheme for EPDiff

    דובר:
    אורסטיס ונטזוס (מתמטיקה, טכניון)
    תאריך:
    יום ראשון, 24.6.2018, 13:30
    מקום:
    חדר 337, בניין טאוב למדעי המחשב

    We present a new structure-preserving numerical scheme for solving the Euler–Poincaré Differential (EPDiff) equation on arbitrary triangle meshes. Unlike existing techniques, our method solves the difficult non-linear EPDiff equation by constructing energy preserving, yet fully explicit, update rules.

    Our approach uses standard differential operators on triangle meshes, allowing for a simple and efficient implementation.

  • New Lower Bounds for Communication Models under Bandwidth Restrictions

    דובר:
    סרי חורי, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שני, 25.6.2018, 13:30
    מקום:
    טאוב 601
    מנחה:
    Prof. Keren Censor-Hillel

    In this talk I will sketch two lower bound techniques for distributed models under bandwidth restrictions. The first is via reductions from the two party communication model, which is a well known technique for achieving lower bounds in distributed computing. I will show a new gadget for this framework that allows us to prove stronger lower bounds. As an example for this gadget, I will present a new lower bound for computing the exact or approximate diameter. The second technique is called the Fooling Views technique, and we use it together with extremal graph combinatorics to show a lower bound for solving triangle detection. This talk is based on joint works with Amir Abboud, Keren Censor-Hillel, Christoph Lenzen, and Ami Paz.

  • Properties of Minimal-Perimeter Polyominoes

    דובר:
    גיל בן-שחר, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שלישי, 26.6.2018, 10:30
    מקום:
    טאוב 601
    מנחה:
    Prof. G. Barequet

    A polyomino is an edge-connected set of cells on the square lattice. The problem of counting poyominoes dates back to the 1950s when it was studied in parallel in the fields of combinatorics and statistical physics. The study of polyominoes usually classifies polyominoes by their area, which is the number of cells the polyomino contains. Less explored is the perimeter of a polyomino, which is the set of empty cells adjacent to the polyomino. Several works studied the relation between the area of a polyomino and its perimeter. In this work we study the combinatoric and geometric properties of a special class of polyominoes, namely minimal-perimeter polyominoes, which, as the name suggests, are polyominoes with minimal perimeter for their area. In this talk we will present proofs for some geometric properties of minimal-perimeter polyominoes, which in turn, yield proofs of the combinatorial structure of minimal-perimeter polyominoes. In addition, these properties, allow us to devise efficient algorithms for counting the number of minimal-perimeter polyominoes.

  • יריד הפרוייקטים השנתי במדעי המחשב

    CS Yearly Project Fair

    תאריך:
    יום שלישי, 26.6.2018, 13:00
    מקום:
    כניסת הקומה וקומה 1 - בניין טאוב למדעי המחשב

    מעבדות הפקולטה למדעי המחשב מזמינות אתכם לבקר ביריד הפרוייקטים השנתי שיתקיים ביום שלישי, 26 ביוני 2018, החל מ-13:00 בקומת הכניסה ובקומה 1 של בניין טאוב למדעי המחשב.

    פרטים נוספים בכרזה המצורפת.

    כולם מוזמנים!

  • Real-time Learning using Core-Sets: Autonomous Drones for Rami Levy

    דובר:
    Dan Feldman - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 26.6.2018, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Computer Science Dept., Haifa University
    מארח:
    Yuval Filmus

    A coreset (or core-set) of a dataset is its semantic compression with respect to a set of classifiers, such that learning the (small) coreset provably yields an approximate classifier of the original (full) dataset. Composable coresets also allow handling streaming and distributed data, e.g. using a cloud or swarm of drones. In this talk I will forge a link between coresets for fundamentals problems in machine (active and deep) learning -- to problems in real-time robotics. Finally, we will see videos of our coreset-based real-time system of autonomous legal, safe and low-cost drones in the supermarket of Rami Levy at Nesher. This is a joint work with Murad Tukan, Elad Tolichensky and Ibrahim Jubran Bio: Dan is a faculty member and the head of the Robotics & Big Data (RBD) Labs in the University of Haifa, after returning from a 3 years post-doc at the Distributed Robotics Lab of MIT, and a previous post-doc the Center for the Mathematics of Information at Caltech. He is known as one of the leading world-wide coresets researchers, mainly for machine learning of Big Data and AI from sensors. In particular, combining computational geometry with applied multidisciplinary science and engineering. This is the main reason of the grants from both government (e.g. NSF-BSF, GIF, Prime Minister Office, Israel Innovation Authority), and industry (e.g. Samsung, Foxconn, Intel, Refael, Ping-An). The first core-sets were developed for open mathematical problems during his P.hD in the University of Tel-Aviv under the supervision of Prof. Micha Sharir and Prof. Amos Fiat. Now his RBD Labs consist of > 20 graduate students. See lab’s web-site for more details: https://sites.hevra.haifa.ac.il/rbd/

  • Cardinality Estimation In a Virtualized Network Device Using Online Machine Learning

    דובר:
    יובל נזרי, הרצאה סמינריונית למגיסטר
    תאריך:
    יום שלישי, 26.6.2018, 14:30
    מקום:
    טאוב 601
    מנחה:
    Prof. R. Cohen

    Cardinality estimation algorithms receive a stream of elements, with possible repetitions, and return the number of distinct elements in the stream. Such algorithms seek to minimize the required memory and CPU resource consumption at the price of inaccuracy in their output. In computer networks, cardinality estimation algorithms are mainly used for counting the number of distinct flows, and they are divided into two categories: sketching algorithms and sampling algorithms. Sketching algorithms usually require dedicated hardware, while sampling algorithms are known for their inaccuracy. In this talk we identify one of the major drawbacks of sampling-based cardinality estimation algorithms: their inability to adapt to changes in traffic distribution. To address this problem, we propose a new sampling-based adaptive cardinality estimation framework, which uses online machine learning. We evaluate our framework using real traffic traces, and show significant improvement in its accuracy compared to the best known sampling-based algorithms, despite using the same amount of CPU resources.

  • Metabolic Modeling for Bioengineering

    דובר:
    אדוארד ויטקין, הרצאה סמינריונית לדוקטורט
    תאריך:
    יום ראשון, 1.7.2018, 14:30
    מקום:
    טאוב 601
    מנחה:
    Dr. Zohar Yakhini

    Efficient and sustainable conversion of biomass into valuable products is a major challenge for bioengineering. The composition of the feedstock biomass and the ability of microorganisms to efficiently ferment it are two most critical factors influencing the process efficiency. Intelligent design that addresses both these factors can greatly benefit from organism metabolic models and from using them in simulations and in computer-assisted optimization of the fermentation processes. In this talk we will cover several aspects of such simulations. We will discuss the construction and improvement of single organism metabolic models as well as present high-scale simulations to optimize multi-organism fermentation processes. Even in the two-organism fermentation system, many tested scenarios, such as reaction knockout analysis, may require solutions of millions of optimization tasks. We will present BioLEGO, a framework to support these heavy calculations, which is deployed as a Microsoft Azure Cloud service, leveraging the associated parallel computing capacities.