# Colloquia and Seminars

To join the email distribution list of the cs colloquia, please visit the list subscription page.

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

Academic Calendar at Technion site.

## Upcoming Colloquia & Seminars

• ### Cued Person Identification From Motion

Speaker:
Igor Kviatkovsky, Ph.D. Thesis Seminar
Date:
Wednesday, 21.3.2018, 11:30
Place:
Taub 601
Prof. E. Rivlin and Prof. I. Shimshoni

We introduce a new approach for identifying individuals based on their motion patterns in interactive scenarios. We formalize the identification process in the context of a sequential message exchange session between the subject and the system. The subject is modeled with a probabilistic generative model inspired by the Human Information Processing (HIP) paradigm. At each stage, the system presents a visual stimulus (a cue) to the subject and records their motion response. The cue is selected so as to maximize the mutual information of the expected response and the subject's identity. Once recorded, the response is used to update the a posteriori probability over possible subjects' identities. To the best of our knowledge, this is the first time person identification is addressed in an interactive setting. We tested our approach using a novel dataset consisting of 4,476 recordings of 22 test subjects responding to 15 cues. The dataset will be made available for public use. We also report results on a publicly available MSRC12 dataset. Our experiments show that the proposed identification approach is effective and reaches a predefined confidence level using fewer iterations than the random selection strategy.

• ### The Finals - 2018 Best Project Contest by Amdocs

Date:
Wednesday, 21.3.2018, 12:30
Place:
CS Taub Auditorium 2

You are invited to the final stage of the 2018 Best Project Contest. The finalist teams will present and talk about their projects.

The event will take place on Wednesday, March 21, 2018, between 12:30-15:00, in Auditorium 2, CS Taub Building.

You are all invited to cheer, support and to watch the most outstanding CS projects.

• ### Theory Seminar: The Firing Squad Problem Revisited

Speaker:
Shlomo Moran (CS, Technion)
Date:
Wednesday, 21.3.2018, 12:30
Place:
Taub 201

In the classical firing squad problem, an unknown number of nodes represented by identical finite states machines is arranged on a line and in each time unit each node may change its state according to its neighbors' states. Initially all nodes are passive, except one specific node located at an end of the line, which issues a fire command. This command needs to be propagated to all other nodes, so that eventually all nodes simultaneously enter some designated firing" state.

A natural extension of the firing squad problem allows each node to postpone its participation in the squad for an arbitrary time, possibly forever, and firing is allowed only after all nodes decided to participate. Typically, this variant is relevant in the context of decentralized distributed computing, where processes have to coordinate for initiating various tasks simultaneously.

The talk will present the above variant of the firing squad problem under the assumptions that the nodes are {\em infinite} state machines, and that the inter-node communication links can be changed arbitrarily in each time unit, i.e., are defined by a {\em dynamic graph}. In this setting, the following question is studied: what connectivity requirements enable a solution to the firing squad problem?

The main result is a characterization of the dynamic graphs for which the firing squad problem can be solved. When restricted to static directed graphs, this characterization implies that the problem can be solved if and only if the graph is strongly connected.

Time permitting, improvements of the solutions when additional information on the number of nodes or on the diameter of the network is given, and by the use of randomization, will also be discussed.

Joint work with Bernadette Charron-Bost

• ### eBay Research Event at CS

Date:
Thursday, 22.3.2018, 10:30
Place:
Room 337 Taub Bld.

eBay will hold a special event designated for graduate students on Thursday, March 22, 2018, between 10:30-12:00, in room 337, CS Taub Building.

The program includes opening by Ido Guy, eBay Israel Head of Research, a lecture by Dr. Kira Radinsky, eBay Israel Chief Scientist, and Q&A sesssion.

Full program and more details in the attached poster.

Attendance requires pre-registration.

You are all invited!

• ### Serializability Reasoning for Eventual Consistency

Speaker:
Dimitar Dimitrov - GUEST LECTURE
Date:
Tuesday, 27.3.2018, 14:30
Place:
Room 337 Taub Bld.
Affiliation:
ETH Zurich
Host:
Eran Yahav

High-availability requirements in modern software triggered the widespread adoption of eventually consistent data stores. Unfortunately, reasoning about the correctness of programs running under eventual consistency is a challenging task, largely due to the possibility of very weak system behaviors. In this talk, I will present new automated techniques that help developers precisely identify problematic weak behaviors. Our starting point will be to adopt conflict serializability as a correctness criterion. We then give a new generalized version that can reason about abstract data types under eventual consistency. This enables precise reasoning about data store clients that use commutative replicated data types. The generalization is founded in an abstract notion of operation dependency, which permits us to reason about dependencies between high-level operations. We show how to compute dependencies in practice by using two algebraic properties, namely, commutativity and absorption. This results in an effective dynamic serializability analysis based on cycle detection. In addition, we briefly discuss a static serializability analysis approach, but for a slightly stronger consistency property - causal consistency. Short Bio: ========== Dimitar Dimitrov is a PhD student at ETH Zurich working on analysis methods for concurrent and distributed programs. His research interests span program analysis, theory of concurrency, distributed computing, and logic.

• ### Quality and Algebraic Representation of Tests

Speaker:
Dor Ma'ayan, M.Sc. Thesis Seminar
Date:
Wednesday, 28.3.2018, 12:30
Place:
Taub 401
Prof. J. Gil

The quality of unit tests gains substantial importance in modern software systems. We explore the way in which Junit tests are written in real world Java systems. We analyse 112 Java repositories and measure the quality of unit tests by finding patterns which indicate good practices of coding. Our results show that the quality of real world unit tests is low, and that in many cases, unit tests don’t follow the well-known recommendations for writing unit tests. These results demonstrate the need for more tools and techniques for refactoring of tests. We also introduce the notion of Linear Execution Algebra (LEA). LEA is a mathematical structure with multiplication and addition operations, which obey most of the arithmetical rules present in fields. LEAs are applicable for modelling unit tests, such as present in JUnit. They are also useful for modelling constructors, and even simple methods. The theoretical modelling is useful for the classification of tests, presenting the semantics of JUnit, and for rational refactoring of tests.

• ### 1+1=3: Combining Object Storage with Other Data Services

Speaker:
Michael Factor - COLLOQUIUM LECTURE
Date:
Tuesday, 24.4.2018, 14:30
Place:
Room 337 Taub Bld.
Affiliation:
IBM Research - Haifa
Host:
Yuval Filmus

AI, Cognitive, Analytics, IoT all run on data. This data is needed by data scientists, line of business, developers, CDOs and others. Without data, in fact, one can do very little that is interesting or of value. Object storage, the default storage for the PBs and EBs of unstructured data in clouds, has brought huge efficiencies to storing and managing data. In this presentation, we will provide an overview of object storage, using IBM's Cloud Object Storage (formerly Cleversafe) as an example. In particular, we will describe the differences between object storage and more traditional big data storage solution. Motivated by a real application scenario, we will then discuss some innovative, high performance, integrations between object storage and other services such as Apache Spark or Apache Kafka, showing how the sum total is greater than the parts and enabling getting value from data.

Short Bio:
=========
Michael E. Factor: B. S., Valedictorian (1984) in Computer Science from Union College, Schenectady, NY. M. S. (1988), M. Phil. (1989) and Ph. D. (1990) in Computer Science from Yale University. Since graduating from Yale University, Dr. Factor worked at the IBM Israel Haifa Research Lab (HRL, Currently, Dr. Factor's focus is on storage subsystems. He is one of the architects of advanced copy functions for IBM's Enterprise Storage Server (aka Shark) and is taking a leading role in storage related research in his lab including topics such as distributed storage systems, SAN-NAS convergence and advanced storage networking technologies, storage management, object based storage devices, and advanced file system organization techniques. In the past, Dr. Factor was the manager of Distributed and Clustered Systems in HRL. Dr. Factor's areas of interest include storage subsystems, Java implementations, cluster computing, scaleable servers, distributed systems and file systems. In addition to Shark, projects that Dr. Factor has been involved with include, the cluster VM for Java, the XML File System, the IBM iSeries Integrated File System and the Web server for the 1996 Atlanta Olympics.

• ### CS Open Day For Graduate Studies

Date:
Wednesday, 25.4.2018, 12:15
Place:
Room 337 Taub Bld.

The 2018 open day invites outstanding undergraduates from all universities to come to the Technion and learn about the Computer Science and Department, to meet faculty and graduate students and to hear a fascinating talk by Moshe Levinger, Senior Manager in IBM Haifa: "Do Advanced Degrees Indeed Advance?"

The event will be held on Wednesday, April 25 2018, between 12:15-15:00, in CS Taub Building, room 337 (3rd floor).

The program will include review on curriculum and admission requirements, as well as scientific lectures. In addition, personal meeting between candidates and vice deans of both faculties will be optional.

Attendance at the open day requires pre-registration.

More details and program.

• ### EUROCRYPT 2018

Date:
Sunday, 29.4.2018, 18:00
Place:
Tel-Aviv

EUROCRYPT 2018 is the 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Covering all aspects of cryptology, including theoretical foundations, deployment of cryptographic schemes, cryptanalysis of widely used standards, cryptographic protocols, quantum cryptography, and cryptographic currencies.

This year's edition will take place in Tel Aviv, Israel on April 29-May 3 2018. EUROCRYPT 2018 is one of the flagship conferences of the the International Association for Cryptologic Research (IACR), and is organized by the Technion Hiroshi Fujiwara Cyber Security Research Center.

More details will be announced soon.

• ### CSpecial Talk: Crush Your Coding Interview

Speaker:
David Gross (Facebook Israel)
Date:
Monday, 30.4.2018, 17:00
Place:
Room 337 Taub Bld.

We are happy to invite your to the fourth of series of meetings on career and job seeking which will be held at CS, on Monay, April 30, at 17:00, in room 337, CS Taub Building.

Mr. David Gross, Program Engineer in Facebook Israel will give a talk on how to prepare and succeed in a technical interview: "Crush Your Coding Interview".

See you there!

• ### Genetics media

Speaker:
Yaniv Erlich - COLLOQUIUM LECTURE - RESCHEDULED FROM 10/4/18
Date:
Tuesday, 1.5.2018, 14:30
Place:
Room 337 Taub Bld.
Affiliation:
Computer Science, Columbia University and Chief Science Officer, MyHeritage
Host:
Yuval Filmus

In the last decade, the human population has produced zettabytes (10^21) of digital data. This creates immense opportunities and challenges for biology research. In this talk, I will present two research directions on the intersection between genetics and data, which we dub "genetic media". First, I will speak about crowd sourcing massive genetic data using social media. We collected over 80 million profiles from the largest social-media website driven by genealogy and constructed a single family tree of 13 million people. Using this data, we analyzed the genetic architecture of longevity. I will also speak about our on-going efforts to crowd source genomes and social media phenotypes to this massive pedigree. In the second part of my talk, I will present using synthetic DNA as a medium for long-term data storage. Previous studies in leading journal have presented this concept but failed to show reliable data retrieval. Here, we report a storage strategy, called DNA Fountain, that is highly robust and approaches the Shannon limit. The success of our strategy relies on careful adaptation of coding theory to the domain-specific constraints of DNA molecules. To demonstrate its power, we stored a full computer operating system, movie, and other files in DNA oligos and perfectly retrieved the information. We explored the limit of our architecture in terms of bytes per molecules and obtained a perfect retrieval from a density of 215Petabyte/gram of DNA, orders of magnitudes higher than previous techniques. Short Bio: ========== Dr. Yaniv Erlich is the Chief Science Officer of MyHeritage.com and an Associate Professor of Computer Science and Computational Biology at Columbia University (leave of absence). Prior to these positions, he was a Fellow at the Whitehead Institute, MIT, where he ran his own lab. Dr. Erlich received his bachelor's degree from Tel-Aviv University, Israel (2006) and a PhD from the Watson School of Biological Sciences at Cold Spring Harbor Laboratory (2010). Dr. Erlich's research interests are computational human genetics. Dr. Erlich is the recipient of DARPA's Young Faculty Award (2017), the Burroughs Wellcome Career Award (2013), Harold M. Weintraub award (2010), the IEEE/ACM-CS HPC award (2008), and he was selected as one of 2010 Tomorrow's PIs team of Genome Technology. ==================================== Refreshments will be served from 14:15 Lecture starts at 14:30

• ### Matching Visual Data

Speaker:
Shai Avidan - COLLOQUIUM LECTURE
Date:
Tuesday, 5.6.2018, 14:30
Place:
Room 337 Taub Bld.
Affiliation:
Faculty of Engineering, Tel-Aviv University
Host:
Yuval Filmus
• ### Privacy, and Why You Should Care

Speaker:
Katrina Ligett - COLLOQUIUM LECTURE
Date:
Tuesday, 12.6.2018, 14:30
Place:
Room 337 Taub Bld.
Affiliation:
Hebrew University
Host:
Yuval Filmus