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

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

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

Academic Calendar at Technion site.

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

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

    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

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

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

  • Pixel Club: Optimal Placement of Multiple Cameras in Cluttered, Dynamic Scenes

    מריה האנל (אונ' ביירות, גרמניה)
    יום שני, 5.9.2016, 11:30
    חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל

    Motion capture is the process of recording the movement of objects or people by sensors and transforming it into computer readable format. To achieve best results, the environment needs to be optimally covered by the sensors. I will propose my latest advances in optimally placing and orienting multiple cameras for motion capture systems in risky industrial settings. Sample objectives for the optimization are to reconstruct an object most accurately, to maximally cover important regions of a cluttered 3D scene, for instance. Formally, our algorithm is a block-coordinate ascent combined with a surrogate of the objective and an exclusion area method. The efficiency of the optimization method is increased by the following properties: (i) the objective is invariant under the permutation of cameras and
    (ii) placing the cameras consecutively reduces the computational costs of the objective.
    Previous consecutive methods for optimal camera placement tolerate non-optimal stationary solutions. Conversely, our method is globally convergent on a continuous domain for various objectives that are quantized, non-differentiable, symmetric, costly, or black-box functions. Moreover, it can be computed in parallel.

    She is a computer scientist, mathematician, and developer who is fascinated about the interplay of complex mathematical theory and practical applications. Her research falls under the scope of Optimization, Computer Vision, Computational Geometry, and Robotics. In Her doctoral work she developed a technique for the optimal placement of multiple cameras in three-dimensional space in the context of safe human-robot cooperation.

  • Special Guest Lecture: Efficient large scale parameter estimation with application to Full Waveform Inversion.

    ערן טרייסטר (אונ' קולומביה הבריטית, קנדה)
    יום שני, 5.9.2016, 12:30
    טאוב 401

    Parameter estimation is performed by fitting data measurements to a model using Bayesian statistics, assuming additional prior information. The estimation requires a numerical solution of a large scale optimization problem, whose objective traditionally includes data fidelity and regularization terms.

    In this talk we will concentrate on parameter estimation of physical models, obtained by solving optimization problems that are constrained by partial differential equations (PDEs). We will focus on the 3D Full Waveform Inversion, which arises in seismic exploration of oil and gas reservoirs, earth sub-surface mapping, ultrasound imaging and more. In the context of seismic exploration, FWI is highly computationally challenging: it includes large amounts of data that need to be fit using repeated expensive simulations of wave scatterings, where each of those simulations includes a numerical solution of the Helmholtz equation in several millions of variables. We will demonstrate how to computationally treat this inverse problem, and improve its solution by using travel time tomography in a joint inversion framework. We will present efficient algorithms for the solution of the Helmholtz and eikonal equations (the two associated PDEs). In addition, we will introduce jInv - our parallel open-source inversion package, which is written in Julia and is highly flexible and easy to manage for solving such inverse problems. In particular we will demonstrate how to use the PDE solvers in jInv for the parallel joint inversion using a Gauss Newton algorithm.

    Short Bio:
    Eran Treister is currently a post-doctoral fellow in the Dept of Earth and Ocean Sciences at the University of British Columbia, Vancouver, Canada, and is about to join the Computer Science Dept. at Ben Gurion University of the Negev in Beer Sheba, Israel. He received his Ph.D. degree in Computer Science from the Technion — Israel Institute of Technology, Israel, in 2014. His primary research interest is scientific computing, focusing on multigrid methods, inverse problems, and optimization.

  • Progress in Automatic GPU Compilation and Why you Want to Run MPI on Your GPU

    טורסטן הופלר (ETH)
    יום שלישי, 6.9.2016, 15:00
    חדר 1061, בניין מאייר, הפקולטה להנדסת חשמל

    Auto-parallelization of programs that have not been developed with parallelism in mind is one of the holy grails in computer science. It requires understanding the source code's data flow to automatically distribute the data, parallelize the computations, and infer synchronizations where necessary. We will discuss our new LLVM-based research compiler Polly-ACC that enables automatic compilation to accelerator devices such as GPUs. Unfortunately, its applicability is limited to codes for which the iteration space and all accesses can be described as affine functions.

    In the second part of the talk, we will discuss dCUDA, a way to express parallel codes in MPI-RMA, a well-known communication library, to map them automatically to GPU clusters. The dCUDA approach enables simple and portable programming across heterogeneous devices due to programmer-specified locality. Furthermore, dCUDA enables hardware-supported overlap of computation and communication and is applicable to next-generation technologies such as NVLINK. We will demonstrate encouraging initial results and show limitations of current devices in order to start a discussion.

    Torsten is an Assistant Professor of Computer Science at ETH Zürich, Switzerland. Before joining ETH, he led the performance modeling and simulation efforts of parallel petascale applications for the NSF-funded Blue Waters project at NCSA/UIUC. He is also a key member of the Message Passing Interface (MPI) Forum where he chairs the "Collective Operations and Topologies" working group. Torsten won best paper awards at the ACM/IEEE Supercomputing Conference SC10, SC13, SC14, EuroMPI'13,HPDC'15, HPDC'16, IPDPS'15, and other conferences. He published numerous peer-reviewed scientific conference and journal articles and authored chapters of the MPI-2.2 and MPI-3.0 standards. He received the Latsis prize of ETH Zurich as well as an ERC starting grant in 2015. His research interests revolve around the central topic of "Performance-centric System Design" and include scalable networks, parallel programming techniques, and performance modeling. Additional information about Torsten can be found on his homepage at htor.inf.ethz.ch.

  • Low-Complexity Collision Resistant Hashing

    נעמה הרמתי, הרצאה סמינריונית למגיסטר
    יום חמישי, 8.9.2016, 14:30
    טאוב 601
    Prof. E. Kushilevitz and Prof. Y.Ishai

    A collision resistant hash function is a function that compresses the input, yet it is computationally infeasible to find two inputs on which it has the same output. Collision resistant hash functions are widely used for making digital signatures efficient and have many other applications in cryptography. The talk will discuss the question of minimizing the complexity of collision resistant hash functions, where complexity is measured in terms of algebraic degree, circuit size, or locality. In particular, we will describe a construction that uses degree-3 polynomials over GF(2) to compress the input by a constant factor, where collision resistance is implied by the conjectured intractability of finding a low-weight codeword in a random linear code.

  • סמינר בכירי אינטל: מחברות קטנות לענקיות בינלאומיות

    Intel Technion Executive Seminar: From Small Firms to World Giants

    יום רביעי, 23.11.2016, 09:00
    EE Meyer Building 1003

    קטנות לענקיות בינלאומיות: כל מה שרציתם לדעת על איך להצליח בתעשיית ההייטק בזירה הטכנולוגית המורכבת של ימינו, ולא העזתם לשאול.

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

    סדר היום, התקצירים וההרשמה באתר.

    ההרצאות יינתנו על ידי מנהלים בכירים ומומחי תוכן מאינטל.

    Shlomit Weiss, Vice President Data Center Group, General Manager Network Platforms Group Silicon Engineering
    Oded Agam, Senior Director Strategic Technologies Group
    Orly Ben-Hemu Lahav, Manager 22nm and 10nm Lithography and Metrology Department in Intel’s FAB28

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