Colloquia and SeminarsTo join the email distribution list of the cs colloquia, please visit the list subscription page.
- Bioinformatics Forum
- BizTEC Forum
- CGGC Weekly Seminar
- Haifux, Haifa Linux Club
- Pixel Club
- Theory Seminar
Upcoming Colloquia & Seminars
2015 Yahoo! Labs Israel Technion Grad Student Event
- Sunday, 29.3.2015, 14:30
- CS Taub Auditorium 2
You are kindly invited to the 2015 Yahoo! Labs Israel Technion Grad Student Event on Sunday March 29, 2015, Taub Building, Technion Campus as follows:
14:30-15:00 at CS Taub, Auditorium 2
Welcome by Prof. Irad Yavneh, CS Dean
Welcome by Dr. Yoelle Maarek, VP Research, Yahoo! Labs: “Why do you need a graduate degree in leading Web companies”
15:00-15:30 at CS Taub, Auditorium 2
Research Talk by Prof. Eugene Agichtein: “Answering the Searcher's Questions: Research on Social Content Organization, Retrieval, and Presentation”
Prof. Eugene Agichtein, is a Principal Research Scientist at Yahoo! Labs, on leave from Emory University, where he serves as an Associate Professor.
15:30-16:30: CS Taub, Room 337 (snacks and refreshments will be served)
Round tables with Yahoo! Labs Research Scientists and Research Engineers about:
- Ad Ranking Research
- Answering Research
- Mail Search and Mining Research
- Scalable Search Systems Research
- Career Mentoring
- Summer Internship Opportunities at Yahoo! Labs
The first 30 registered attendees will get a gift during the round table sessions.
CGGC Seminar: Provably Good Planar Mappings
- Roi Poranne (Weizmann Institute of Science)
- Monday, 30.3.2015, 13:30
- Room 337-8 Taub Bld.
The problem of planar mapping and deformation is central in computer graphics, where applications range from image warping and character animation, to non-rigid registration and shape analysis. I will present a framework for adapting general, smooth, function bases for constructing provably good planar mappings. The term "good" in this context means the map has no fold-overs (injective), is smooth, and has low isometric or conformal distortion. Our approach bridges the gap between mesh and meshless methods, allowing us to construct meshless maps with bounded distortion. Further extensions will be discussed.
Pixel Club: RGBD-Fusion: Real-Time High Precision Depth Recovery
- Roy Or-El (EE, Technion)
- Tuesday, 31.3.2015, 11:30
- Room 337-8 Taub Bld.
The popularity of low-cost RGB-D scanners is increasing on a daily basis. Nevertheless, existing scanners often cannot capture subtle details in the environment. We present a novel method to enhance the depth map by fusing the intensity and depth information to create more detailed range profiles. The lighting model we use can handle natural scene illumination. It is integrated in a shape from shading like technique to improve the visual fidelity of the reconstructed object. Unlike previous efforts in this domain, the detailed geometry is calculated directly, without the need to explicitly find and integrate surface normals. In addition, the proposed method operates four orders of magnitude faster than the state of the art. Qualitative and quantitative visual and statistical evidence support the improvement in the depth obtained by the suggested method.
* This work will appear in CVPR2015
Internet security: Past, Present and Future
- Michael Waidner - RESCHEDULED - COLLOQUIUM LECTURE -
- Tuesday, 31.3.2015, 13:00
- Room Class 5 Taub Bld.
ceClub: Introducing Intel Software Guard Extensions (Intel SGX)
- Ittai Anati (Intel)
- Wednesday, 1.4.2015, 11:30
- Room 337-8 Taub Bld.
Intel Software Guard Extensions (Intel SGX) is an extension to Intel Architecture designed to increase the security of software. In this approach, rather than attempting to identify and isolate all the malware on the platform, legitimate software can be sealed inside an enclave and protected from attack by malware, irrespective of the its privilege level. In the talk I will touch on the building blocks of security, describe the basics of Intel SGX, and show how the components, combined, provide a holistic secure solution.
Ittai Anati is a Senior Principal Engineer at Intel Corporation, focusing mainly on topics related to CPU and system security at Intel's Israel Design Center (IDC) in Haifa. Ittai has a B.Sc. in Electrical Engineering from the Technion, Israel Institute of Technology.
Efficient and Scalable Kernel IOMMU Management Designs
- Omer Peleg, M.Sc. Thesis Seminar
- Wednesday, 1.4.2015, 13:00
- Taub 601
- Prof. Dan Tsafrir
IOMMUs provided by modern hardware allow the OS to enforce memory protection controls on the DMA operations of its I/O devices. An IOMMU translation management design must scalably handle frequent concurrent updates of IOMMU translations made by multiple cores, as occur in high throughput I/O workloads. Today, however, OSes experience performance meltdowns under these workloads. In this talk we will explore scalable IOMMU management designs, which would address the two main bottlenecks we find in current OSes: (1) assignment of IO virtual addresses (IOVAs), and (2) management of the IOMMU's TLB. We will describe and evaluate three approaches for scalable IOVA assignment: (1) dynamic identity mappings, which eschew IOVA allocation altogether, (2) allocating IOVAs using the kernel's kmalloc, and (3) per-core caching of IOVAs allocated by a globally-locked IOVA allocator. To complement them, we will also present a scalable IOMMU TLB management scheme that is compatible with all these approaches.
The nom Profit-Maximizing Operating System
- Muli Ben-Yehuda, M.Sc. Thesis Seminar
- Wednesday, 1.4.2015, 14:30
- Taub 601
- Prof. D. Tsafrir
In the near future, cloud providers will sell their users virtual machines with CPU, memory, network, and storage resources whose prices constantly change according to market-driven supply and demand conditions. Running traditional operating systems in these virtual machines is a poor fit: traditional operating systems are not aware of changing resource prices and their sole aim is to maximize performance with no consideration for costs. Consequently, they yield low profits. We present nom, a profit-maximizing operating system designed for cloud computing platforms with dynamic resource prices. Applications running on nom aim to maximize their profits from their resources by optimizing for both performance and costs. The nom kernel provides them with direct access to the underlying hardware and full control over their private software stacks. Since nom applications know there is no single ``best'' software stack, they adapt their stacks' behavior on the fly according to the current price of available resources and their private valuations of them. We show that in addition to achieving up to 3.9x better throughput and up to 9.1x better latency, nom applications yield up to 11.1x higher profits when compared with the same applications running on Linux and OSv.
Algorithms for Parameterized Graph Problems with Applications to Biological Network Queries
- Meirav Zehavi, Ph.D. Thesis Seminar
- Wednesday, 1.4.2015, 15:30
- Taub 401
- Prof. Ron Y. Pinter and Prof. Hadas Shachnai
There is a growing, vital need for fast algorithms for problems that are unlikely to admit efficient solutions, based on classical computational complexity theory. Parameterized Complexity is an exciting paradigm for coping with computationally hard problems, which is amazingly doable mathematically on a routine basis. In a nutshell, this paradigm aims to reduce the running times of algorithms for NP-hard problems, by confining the combinatorial explosion to a parameter k. In the past two decades, several techniques, known as ``color coding-related techniques'', led to the design of breakthrough parameterized algorithms. These techniques are non-standard in the extent in which they connect such seemingly disparate branches of Computer Science and Mathematics as matroid theory, linear algebra, graph theory and combinatorial optimization. In this talk, I present general schemes for mixing and improving upon color coding-related techniques. In particular, I discuss specific algorithms for classical problems such as k-Path, k-Internal Out-Branching and 3-Set k-Packing, as well as problems motivated by real-world applications to biological network queries, which are of major importance to systems biology.
CS M.Sc. & Ph.D. Alumni Event - POSTPONED!
- Thursday, 2.4.2015, 14:30
- CS Taub
Due to numerous requests to postpone the event because of its proximity to Passover, we have decided to postpone it to a later date, soon to be determined.
An invitation with the new date will be sent via email ASAP, and the registration site will be re-opened.
We sincerely apologize for the inconvenience and hope to see you all in the event.
We are very excited to invite you to the MSc & PhD alumni event. The event will be held on Thursday, April 2nd at the CS faculty. A detailed invitation will be followed.
If you are familiar with other MSc & PhD alumni - we'd love to get their contact details to make sure everyone received the invitation.
Hope to see you,