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

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


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

Academic Calendar at Technion site.

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

  • TCE Special Guest Lecture: Re-Engineering Computing with Neuro-Inspired Learning: Devices, Circuits, and Systems

    TCE Special Guest Lecture: Re-Engineering Computing with Neuro-Inspired Learning: Devices, Circuits, and Systems

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

    Advances in machine learning, notably deep learning, have led to computers matching or surpassing human performance in several cognitive tasks including vision, speech and natural language processing. However, implementation of such neural algorithms in conventional "von-Neumann" architectures are several orders of magnitude more area and power expensive than the biological brain. Exploring the new paradigm of computing necessitates a multi-disciplinary approach: exploration of new learning algorithms inspired from neuroscientific principles, developing network architectures best suited for such algorithms, new hardware techniques to achieve orders of improvement in energy consumption, and nanoscale devices that can closely mimic the neuronal and synaptic operations of the brain leading to a better match between the hardware substrate and the model of computation. In this presentation, we will discuss our work on spintronic device structures consisting of single-domain/domain-wall motion based devices for mimicking neuronal and synaptic units. Implementation of different neural operations with varying degrees of bio-fidelity (from "non-spiking" to "spiking" networks) and implementation of on-chip learning mechanisms (Spike-Timing Dependent Plasticity) will be discussed. Additionally, we also propose probabilistic neural and synaptic computing platforms that can leverage the underlying stochastic device physics of spin-devices due to thermal noise. System-level simulations indicate ~100x improvement in energy consumption for such spintronic implementations over a corresponding CMOS implementation across different computing workloads.

    Bio:
    Kaushik Roy received B.Tech. degree in electronics and electrical communications engineering from the Indian Institute of Technology, Kharagpur, India, and Ph.D. degree from the electrical and computer engineering department of the University of Illinois at Urbana-Champaign. He is currently the Edward G. Tiedemann Jr. Distinguished Professor of ECE at Purdue University. Dr. Roy has published more than 700 papers in refereed journals and conferences, holds 18 patents, supervised 75 PhD dissertations, and is co-author of two books on Low Power CMOS VLSI Design (John Wiley & McGraw Hill).

    Dr. Roy received the National Science Foundation Career Development Award in 1995, IBM faculty partnership award, ATT/Lucent Foundation award, 2005 SRC Technical Excellence Award, SRC Inventors Award, Purdue College of Engineering Research Excellence Award, Humboldt Research Award in 2010, 2010 IEEE Circuits and Systems Society Technical Achievement Award (Charles Doeser Award), Distinguished Alumnus Award from Indian Institute of Technology (IIT), Kharagpur, Fulbright-Nehru Distinguished Chair, DoD Vannevar Bush Faculty Fellow (2014-2019), Semiconductor Research Corporation Aristotle award in 2015, and several best paper awards. Dr. Roy was a Purdue University Faculty Scholar (1998-2003). He was a Research Visionary Board Member of Motorola Labs (2002) and held the M. Gandhi Distinguished Visiting faculty at Indian Institute of Technology (Bombay) and Global Foundries visiting Chair at National University of Singapore. He is a fellow of IEEE.

  • Pixel Club: 3D on the Fly

    דובר:
    הדס קוגן (אלביט)
    תאריך:
    יום חמישי, 25.5.2017, 11:30
    מקום:
    חדר 337, בניין טאוב למדעי המחשב

    Elbit Aerospace utilizes 3D mapping in a variety of different projects. We present two of these projects; in the first project, a 3D model of a large area is generated from aerial imaging. Here, the rapidly changing viewpoint of an aircraft mounted camera enables multi view geometry techniques to obtain a 3D point cloud. A mesh is reconstructed, and images from the same camera are used to create a photorealistic model. The composed model is 2.5D, that is, it includes one height for every lateral position. In our settings, 2.5 modeling is preferred over full 3D modeling, but it also introduces visual artifacts, for instance around bridges and trees. In addition, planar surfaces such as walls and roofs should be rectified in order to achieve a visual appealing model. We introduce a novel approach for improving the visual appearance and accuracy of the model. Our approach, for which we coined the term 2.75D modeling, combines 2.5 modeling for most of the area, and full 3D modeling only where necessary.

    In the second project, a 3D model is generated during the flight and is used to compensate for degraded visual environment, e.g., during landing. In this case, a 3D model is obtained by combining a 3D point cloud scanned by a LiDAR, together with images from a camera to obtain a photorealistic model. The LiDAR provides a sparse point cloud that is accumulated while the craft maneuvers, using the craft’s position and orientation measured by a GPS\INS system. Accurate accumulation is crucial for good and reliable modeling. In cases where the position and orientation are not accurate enough, point cloud registration is essential. We present a novel approach for point cloud registration of sparse LiDAR signals.

    Bio:
    Hadas Kogan leads the 3D vision team at Elbit Systems Aerospace division. She holds a B.Sc and an M.Sc from the Department of Electrical Engineering at the Technion, Israel Institute of Technology. Hadas has more than 10 years experience in conducting and supervising research and development at Elbit, HP-Labs and Rafael, in the fields of 3D modeling, computer vision, and machine learning.

  • CGGC Seminar: Moebius Geometry Processing

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

    The mainstream approaches in digital geometry processing utilize triangular (simplicial) meshes, discretize differential quantities using finite-element function spaces, and describe transformations with piecewise affine maps. I will describe how Moebius geometry provides an original alternative to discrete differential geometry, by using circles as its basic elements, and describing quantities like conformality and regularity through the invariant cross-ratio. This theory allows for various applications, such as polygonal (non-triangular) mesh deformation, interpolation, and symmetric realization of unconventional mesh patterns.

  • Coding Theory: Codes for Graph Erasures

    דובר:
    לב יוחננוב (מדעי המחשב, טכניון)
    תאריך:
    יום ראשון, 28.5.2017, 14:30
    מקום:
    טאוב 601

    Motivated by systems where the information is represented by a graph, such as neural networks, associative memories, and distributed systems, we present in this work a new class of codes, called codes over graphs. Under this paradigm, the information is stored on the edges of an undirected graph, and a code over graphs is a set of graphs. A node failure is the event where all edges in the neighborhood of the failed node have been erased. We say that a code over graphs can tolerate ρ node failures if it can correct the erased edges of any ρ failed nodes in the graph. While the construction of such codes can be easily accomplished by MDS codes, their field size has to be at least O(n^2), when n is the number of nodes in the graph. In this work we present several constructions of codes over graphs with smaller field size. In particular, we present optimal codes over graphs correcting two node failures over the binary field, when the number of nodes in the graph is a prime number. We also present a construction of codes over graphs correcting ρ node failures for all ρ over a field of size at least (n+1)/2−1, and show how to improve this construction for optimal codes when ρ=2,3.

  • CGGC Seminar: Obstacle-Ginzburg-Landau Functionals

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

    This work proposes an algorithm for computing dense packings of congruent circles inside general 2D containers. Unlike the previous approaches which accept as containers, only simple, symmetric shapes such as circles, rectangles and triangles, our method works for any container with a general, freeform (spline) boundary.

    In contrast to most previous approaches which cast the problem into a non-convex optimization problem, our method attempts to maximize the number of packed circles via a perturbation approach and consists of two main phases.

    We will discuss a variation of the Ginzburg-Landau functional, a common tool in applications such as image segmentation (Ambrosio-Tortorelli) and phase-field methods in fluid simulation, involving a so-called "double-obstacle" barrier term (first studied by Elliott and Blowey).

    We will describe fast (GPU-optimized) variational solvers for gradient flows of these functionals (Allen-Cahn and Cahn-Hilliard equivalents), and also look into certain higher-dimensional generalisations.

  • סדנת המרכז להנדסת מחשבים ע"ש סטפן ושרון זיידן 2017

    TCE Workshop: 2017 Stephen and Sharon Seiden Frontiers in Engineering and Science

    תאריך:
    יום שני, 5.6.2017, 09:30
    מקום:
    המרכז להנדסת מחשבים,טכניון

    הנכם מוזמנים לסדנת המרכז להנדסת מחשבים ע"ש סטפן ושרון זיידן 2017 של המרכז להנדסת מחשבים בנושא:
    "Beyond CMOS: From Devices to Systems" אשר תתקיים בימים שני-שלישי, 5-6 ביוני, 2017 בטכניון.
    ההרשמה תיפתח ב-15 במרס, 2017, ופרטים נוספים בדף האנגלי ובאתר הסדנה.

  • CGGC Seminar: Design of 3D printed mathematical art

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

    When visualising topological objects via 3D printing, we need a three-dimensional geometric representation of the object. There are approximately three broad strategies for doing this: "Manual" - using whatever design software is available to build the object by hand; "Parametric/Implicit" - generating the desired geometry using a parametrisation or implicit description of the object; and "Iterative" - numerically solving an optimisation problem.

    The manual strategy is unlikely to produce good results unless the subject is very simple. In general, if there is a reasonably canonical geometric structure on the topological object, then we hope to be able to produce a parametrisation of it. However, in many cases this seems to be impossible and some form of iterative method is the best we can do. Within the parametric setting, there are still better and worse ways to proceed. For example, a geometric representation should demonstrate as many of the symmetries of the object as possible. There are similar issues in making three-dimensional representations of higher dimensional objects. I will discuss these matters with many examples, including visualisation of four-dimensional polytopes (using orthogonal versus stereographic projection) and Seifert surfaces (comparing my work with Saul Schleimer with Jack van Wijk's iterative techniques).

    I will also describe some computational problems that have come up in my 3D printed work, including the design of 3D printed mobiles (joint work with Marco Mahler), "Triple gear" and a visualisation of the Klein Quartic (joint work with Saul Schleimer), and hinged surfaces with negative curvature (joint work with Geoffrey Irving).

  • How to Find Cryptographic Needles In Exponentially Large Haystacks

    דובר:
    Adi Shamir - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 6.6.2017, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Weizmann Institute
    מארח:
    Yuval Filmus

    One of the most common algorithmic tasks is to find a single interesting event (a needle) in an exponentially large collection (haystack) of N=3D2^n possible events, or to demonstrate that no such event is likely to exist. In particular, we are interested in the problem of finding needles which are defined as events that happen with an unusually high probability of p>>1/N in a haystack which is an almost uniform distribution on N possible events. Such a search algorithm has many applications in cryptography and cryptanalysis, and its best known time/memory tradeoff requires O(1/Mp^2) time given O(M) memory when the search algorithm can only sample values from this distribution.
    In this talk I will describe much faster needle searching algorithms when the distribution is defined by applying some deterministic function f to random inputs. Such a distribution can be modelled by a random directed graph with N vertices in which almost all the vertices have O(1) predecessors while the vertex we are looking for has an unusually large number of O(pN) predecessors. When we are given only a constant amount of memory, we propose a new search methodology which we call NestedRho. As p increases, such random graphs undergo several subtle phase transitions, and thus the log-log dependence of the time complexity T on p becomes a piecewise linear curve which bends four times. Our new algorithm is faster than the O(1/p^2) time complexity of the best previous algorithm in the full range of 1/N < p < 1, and in particular it improves it for some values of p by a significant factor of sqrt {N}. When we are given more memory, we show how to combine the NestedRho technique with the parallel collision search technique in order to further reduce its time complexity. Finally, we show how to apply our new search technique to more complicated distributions with multiple peaks when we want to find all the peaks whose probabilities are higher than p.
    The talk will be self contained, requiring no prior knowledge of cryptography. It is joint work with Itai Dinur, Orr Dunkelman, and Nathan Keller.
    Short Bio (from Wikipedia):
    Shamir received a BSc degree in mathematics from Tel Aviv University in 1973 and obtained his MSc and PhD degrees in Computer Science from the Weizmann Institute in 1975 and 1977 respectively. After a year postdoc at University of Warwick, he did research at MIT from 1977-1980 before returning to be a member of the faculty of Mathematics and Computer Science at the Weizmann Institute. Starting from 2006, he is also an invited professor at Ecole Normale Superieure in Paris.
    He is a co-inventor of the RSA algorithm (along with Ron Rivest and Len Adleman), a co-inventor of the Feige-Fiat-Shamir identification scheme (along with Uriel Feige and Amos Fiat), one of the inventors of differential cryptanalysis (along with Eli Biham), and has made many contributions to the fields of cryptography and computer science. Shamir's other numerous inventions and contributions to cryptography include the Shamir secret sharing scheme, the breaking of the Merkle-Hellman knapsack cryptosystem, visual cryptography, and the TWIRL and TWINKLE factoring devices. Shamir has also made contributions to computer science outside of cryptography, such as finding the first linear time algorithm for 2-satisfiability and showing the equivalence of the complexity classes PSPACE and IP.
    Shamir has received a number of awards, including the 2002 ACM Turing Award, the Paris Kanellakis Theory and Practice Award, the Erdoes Prize, the 1986 IEEE W.R.G. Baker Award, the UAP Scientific Prize, the Vatican's PIUS XI Gold Medal, the 2000 IEEE Koji Kobayashi Computers and Communications Award, the 2008 Israel Prize, and the 2017 Japan Prize.

  • CGGC Seminar: Precise Algebraic-based Swept Volumes for Arbitrary Free-form Shaped Tools towards Multi-axis CNC Machining Verification

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

    We will discuss a variation of the Ginzburg-Landau functional, a common tool in applications such as image segmentation (Ambrosio-Tortorelli) and phase-field methods in fluid simulation, involving a so-called "double-obstacle" barrier term (first studied by Elliott and Blowey).

    We will describe fast (GPU-optimized) variational solvers for gradient flows of these functionals (Allen-Cahn and Cahn-Hilliard equivalents), and also look into certain higher-dimensional generalisations.

  • גרפיקה ממוחשבת בראיית הזמן: עבר, הווה ועתיד

    CSpecial Guest: Computer Graphics in the View of Time: Past, Present and Future

    דובר:
    אייל בר לב (אלביט, חטיבת כלי טייס)
    תאריך:
    יום רביעי, 14.6.2017, 12:30
    מקום:
    טאוב 7

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

  • יום עיון בקריפטולוגיה 2017

    CRYPTODAY 2017

    תאריך:
    יום חמישי, 15.6.2017, 09:00
    מקום:
    אודיטוריום 1 בניין טאוב למדעי המחשב

    יום העיון בקריפטולוגיה 2017 יתקיים ביום חמישי, 15 ביוני 2017, בין השעות 17.15-9.00, באודיטוריום 1, בניין טאוב למדעי המחשב, הטכניון.

    רוב ההרצאות יינתנו בעברית ובהן הרצאתו של דר' מארק סטיבנס על עבודתו החדשה אשר חשפה התנגשות של SHA-1. הרצאות נוספות יעסקו במטבעות וירטואליות, blockchains ועוד.

    פרטים נוספים ותוכנית, כולל תקצירי הרצאות, הרשמה (ללא תשלום אך נדרשת) והוראות הגעה.

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

  • Effective deductive verification of safety of distributed protocols in unbounded systems

    דובר:
    Mooly Sagiv - COLLOQUIUM LECTURE
    תאריך:
    יום שלישי, 20.6.2017, 14:30
    מקום:
    חדר 337 טאוב.
    השתייכות:
    Tel-Aviv University, School of Computer Science
    מארח:
    Yuval Filmus

    T B A

  • הכנס השנתי הבינלאומי השביעי להנדסת מחשבים בטכניון בנושא צפינת איחסון ומערכות מידע

    The 7th Annual International TCE Conference on Coding for Storage and Information Systems

    תאריך:
    יום רביעי, 21.6.2017, 08:30
    מקום:
    בניין טאוב למדעי המחשב

    הכנס השנתי הבינלאומי השביעי להנדסת מחשבים בטכניון בנושא צפינת איחסון ומערכות מידע יתקיים בימים רביעי-חמישי, 21-22 ביוני, 2017 בבניין טאוב למדעי המחשב, הטכניון.

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

    Alexander Barg,  University of Maryland, USA ·
    André Brinkmann, Johannes Gutenberg – Universität Mainz, Germany ·
    Lara Dolecek, UCLA, USA ·
    Ryan Gabrys, University of Illinois at ·
     Urbana-Champaign, USA ·
     Warren Gross, McGill University, Canada ·
     Danny Harnik, IBM, Israel ·
     Michael Kazhdan, Johns Hopkins University, USA ·
     Idit Keidar, Technion, Israel ·
     HanMao Kiah, NTU, Singapore ·
     P Vijay Kumar, Indian Institute of Science, Bangalore, India ·
     Olgica Milenkovic, University of Illinois at Urbana-Champaign, USA ·
    Paul H. Siegel, UC San Diego, USA ·
    Eran Sharon, SanDisk/WD, Israel ·
     Emina Soljanin, Rutgers University, USA ·
     Ido Tal, Technion, Israel ·
     Alexander Vardy, UC San Diego, USA ·
     Zohar Yakhini, IDC, Israel ·


    הרשמה ופרטים נוספים על תוכנית הכנס ומידע על המרכז להנדסת מחשבים בטכניון TCE