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

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

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

  • CGGC Seminar: Topologically Guaranteed Bivariate Solutions Of Under-Constrained Multivariate Piecewise Polynomial Systems

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

    We present a subdivision based algorithm to compute the solution of an under-constrained piecewise polynomial system of n−2 equations with n unknowns, exploiting properties of B-spline basis functions. The solution of such systems is, typically, a two-manifold in R^n. To guarantee the topology of the approximated solution in each sub-domain, we provide subdivision termination criteria, based on the (known) topology of the univariate solution on the domain’s boundary, and the existence of a one-to-one projection of the unknown solution on a two dimensional plane, in R^n. We assume the equation solving problem is regular, while sub-domains containing points that violate the regularity assumption are detected, bounded, and returned as singular locations of small (subdivision tolerance) size. This work extends (and makes extensive use of) topological guarantee results for systems with zero and one dimensional solution sets. Test results in R^3 and R^4 are also demonstrated, using error-bounded piecewise linear approximations of the two-manifolds.

  • CSpecial Talk: Bitcoin “What and Why”

    דובר:
    דניאל ברונשטיין (אינטל ישראל)
    תאריך:
    יום ראשון, 2.11.2014, 16:30
    מקום:
    טאוב 2

    Bitcoin is the first currency in human history that is decentralized and does not need Trust of a third party (like Banks, Credit Cards, PayPal etc…). It enables people to send money and pay one another directly and instantly, as with cash or gold, over the Internet. It is based on military-grade cryptography, distributed peer-to-peer networks, and the revolutionary BlockChain technology. The talk provides a basic overview of Bitcoin structure, politics and business perspective. But most of all, this talk will enlighten with the wide possibility of future innovation and how Bitcoin will disrupt existing markets and possibly change our lives. This session is open to all, and no previous knowledge is required.
    Small Demo (free bitcoins) at the end (-:

    Agenda in bullets
    - What is Bitcoin
    - Wallets (mobile, cloud, cold storage)
    - Price and Market Capacitance
    - Worldwide adoption by big corporations and merchants
    - Regulatory environment
    - Billion Dollar Markets being disrupted by Bitcoin
    - Alternative crypto-currencies and Bitcoin 2.0
    - VC investment in Bitcoin startups
    - Bitcoin in Israel
    - Bitcoin in the Academy
    - Technical Agenda
    - Public and Private Keys
    - Mining - Blockchain - Security, 51% attack

    Bio:
    Daniel Brunstein holds an MSc in Computer Science from the Technion (Computer Graphics under Chaim Gotsman and Gill Barequet). Dani is currently working in Intel Israel as a Software Designer in the Microprocessor Design Automation group. Dani is a Bitcoin expert and enthusiast.

  • Pixel Club: Advances in Autonomous Operation in Uncertain or Unknown Environments: Distributed Robust Inference and Data Association, and Planning in Generalized Belief Space

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

    In this talk I will describe two recent research efforts addressing challenges in autonomous operation in unknown environments.

    First, I will present an approach for multi-robot distributed inference over variables of interest, such as robot trajectories, considering the initial relative pose between the robots and multi-robot data association are both unknown. Assuming robots share with each other informative observations, this inference problem is formulated within an Expectation-Maximization (EM) optimization, performed by each robot separately, alternating between inference over variables of interest and multi-robot data association. To facilitate this process, a common reference frame between the robots should first be established. We show the latter is coupled with determining multi-robot data association, and therefore concurrently infer both using a separate EM optimization. This optimization is performed by each robot starting from several promising initial solutions, converging to locally-optimal hypotheses regarding data association and reference frame transformations. Choosing the best hypothesis in an incremental problem setting is in particular challenging due to high sensitivity to perceptual aliasing and possibly insufficient amount of data. Selecting an incorrect hypothesis introduces outliers and can lead to catastrophic results. To address these challenges we develop a model-selection based approach to choose the most probable hypothesis, while resorting to Chinese Restaurant Process to represent statistical knowledge regarding hypothesis prior probabilities.

    In the second part of the talk, I will focus on the problem of planning under uncertainty, with application to mobile robotics. We propose a probabilistic framework in which the robot bases its decisions on the generalized belief, which is a probabilistic description of its own state and of external variables of interest (such as 3D points representing the perceived environment). The approach naturally leads to a dual-layer architecture: an inner estimation layer, which performs inference to predict the outcome of possible decisions, and an outer decisional layer which is in charge of deciding the best action to undertake. The formulation is valid for general cost functions and does not discretize the state or control space, enabling planning in continuous domain. The approach is successfully applied to the problem of uncertainty-constrained exploration, in which the robot has to perform tasks in an unknown environment, while maintaining localization uncertainty within given bounds.

    First part is joint work with Nathan Michael and Frank Dellaert; Second part is joint work with Luca Carlone and Frank Dellaert.

  • Robust Probabilistic Inference

    דובר:
    Yishay Mansour - Colloquium Lecture
    תאריך:
    יום שלישי, 4.11.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141104_14_30_Mansour.html
  • ceClub: [2 topics] Censorship in the Wild, Analyzing Internet Filtering in Syria & Paying for Likes? Understanding Facebook Like Fraud Using Honeypots

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

    (1) Censorship in the Wild, Analyzing Internet Filtering in Syria. Several government authorities worldwide enforce Internet censorship, however, due to the lack of publicly available information and the inherent risks of performing active measurements, it is often hard for the research community to investigate censorship practices in the wild. In this talk I will present the methodology and the results of a measurement analysis of 600GB worth of leaked logs from 7 Blue Coat SG-9000 proxies – deployed in Syria to filter Internet traffic at a country scale. To the best of our knowledge, our work provides the first analytical look into Internet filtering in Syria. This is joint work with Abdelberi Chaabane, Terence Chen, Mathieu Cunche, Emiliano De Cristofaro and Mohamed Ali Kaafar. (http://arxiv.org/abs/1402.3401)

    (2) Paying for Likes? Understanding Facebook Like Fraud Using Honeypots. Facebook pages offer an easy way to reach out to a very large audience as they can easily be promoted using Facebook's advertising platform. Recently, the number of likes of a Facebook page has become a measure of its popularity and profitability, and an underground market of services boosting page likes, aka like farms, has emerged. In this talk I will present a comparative measurement study of page likes garnered via Facebook ads and by a few like farms, based on a set of deployed honeypot pages. I will highlight a few interesting findings, including that some farms seem to be operated by bots and do not really try to hide the nature of their operations, while others follow a stealthier approach, mimicking regular users' behavior. This is joint work with Emiliano De Cristofaro, Guillaume Jourjoin, Mohamed Ali Kaafar and M. Zubair Shafiq. (http://arxiv.org/abs/1409.2097)

    Bio:
    Dr. Arik Friedman is a senior researcher in NICTA's Networks Research Group. He received a PhD from the Technion, Israel Institute of Technology, and MBA with specialization in Technology and Information Systems from Tel-Aviv University. His research interests include privacy-preserving data mining and computer security. He previously held the position of Program Manager at Microsoft R&D between 2007­-2011, where he worked on privacy and security products.

  • When Machines Dominate Humans: The Challenges of Mining and Consuming Machine-generated Web Mail

    דובר:
    Yoelle Maarek - Colloquium Lecture
    תאריך:
    יום שלישי, 11.11.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141111_14_30_Maarek.html
  • The Axiomatic Approach and the Internet

    דובר:
    Moshe Tennenholtz - Colloquium Lecture
    תאריך:
    יום שלישי, 18.11.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141118_14_30_Tennenholz.html
  • The Cryptographic Lens

    דובר:
    Shafi Goldwasser - Colloquium Lecture
    תאריך:
    יום שלישי, 9.12.2014, 14:30
    מקום:
    חדר 337-8 טאוב.
    קישור:
    http://www.cs.technion.ac.il/~colloq/20141209_14_30_Goldwasser.html