קולוקוויום וסמינרים
כדי להצטרף לרשימת תפוצה של קולוקוויום מדעי המחשב, אנא בקר בדף מנויים של הרשימה.Computer Science events calendar in HTTP ICS format for of Google calendars, and for Outlook.
Academic Calendar at Technion site.
- CGGC Weekly Seminar
- Coding Theory Seminar
- Colloquia
- Hardware Security Seminar
- Pixel Club
- Theory of Data Science and Deep Learning
- Theory Seminar
קולוקוויום וסמינרים בקרוב
ceClub: Accelerator-level Parallelism
- דובר:
- Mark D. Hill (University of Wisconsin-Madison)
- תאריך:
- יום רביעי, 3.6.2020, 16:00
- מקום:
- Zoom Lecture: https://technion.zoom.us/j/92224131182
Computer system performance has improved due to creatively using more transistors (Moore’s Law) in parallel via bit-, instruction-, thread-, and data-level parallelism. With the slowing of technology scaling, a way to further improve computer system performance under energy constraints is to employ hardware accelerators. Each accelerator is a hardware component that executes a targeted computation class faster and usually with (much) less energy. Already today, many chips in mobile, edge and cloud computing concurrently employ multiple accelerators in what we call accelerator-level parallelism (ALP). This talk develops our hypothesis that ALP will spread to computer systems more broadly. ALP is a promising way to dramatically improve power-performance to enable broad, future use of deep AI, virtual reality, self-driving cars, etc. To this end, we review past parallelism levels and the ALP already present in mobile systems on a chip (SoCs). We then aid understanding of ALP with the Gables model and charge computer science researchers to develop better ALP “best practices” for: targeting accelerators, managing accelerator concurrency, choreographing inter-accelerator communication, and productively programming accelerators. This joint work with Vijay Janapa Reddi of Harvard. See also: https://www.sigarch.org/accelerator-level-parallelism/
Bio:
Mark D. Hill (http://www.cs.wisc.edu/~markhill) is John P. Morgridge Professor and Gene M. Amdahl Professor of Computer Sciences at the University of Wisconsin-Madison, where he also has a courtesy appointment in Electrical and Computer Engineering. His research interests include parallel-computer system design, memory system design, and computer simulation. He received the 2019 Eckert-Mauchly Award and is a fellow of IEEE and the ACM. He serves as Chair of the Computer Community Consortium (2018-19) and served as Wisconsin Computer Sciences Department Chair 2014-2017. Hill has a PhD in computer science from the University of California, Berkeley.Symbolic algorithms for synthesis of freeform spline-based geometry
- דובר:
- Boris van Sosin, הרצאה סמינריונית לדוקטורט
- תאריך:
- יום ראשון, 7.6.2020, 13:30
- מקום:
- Zoom Lecture: https://technion.zoom.us/j/98410090397
- מנחה:
- Prof. Gershon Elber
Automated tools and algorithms for synthesizing geometry have been ubiquitous in computer-aided design systems, since their very inception. Beyond the simple example of sketching tools for designers, algorithms for synthesizing geometry take many forms, such as design-by-constraints, optimization, and toolpath generation. In this thesis, we will present three problems in the field on geometry processing, and examine them both within the context of geometry synthesis, and in their broader applications. The first problem we discuss is polynomial and rational constraint-solving using a subdivision-based solver, and how it can be improved by constraint system decomposition. Subdivision-based algorithms for globally finding all the solutions to constraint systems tend to scale inefficiently with the number of variables. We propose a framework for of decomposing, and efficiently solving piecewise polynomial constraint systems, with zero-dimensional or univariate solution spaces. We demonstrate these capabilities, and the performance improvement of our framework on problems such as generating geometry via design-by-constraints, kinematics over 2D and 3D geometry, and general algebraic equation systems. The second problem we discuss is functional composition of spline functions. Functional composition of Bézier and B-spline geometry has many applications in geometric design, such as deformation, reparametrization, and multi-resolution design. However, the composition, G(H), of a tensor product B-spline function G with another B-spline function H is no longer a tensor product B-spline if H crosses a knot line in the domain of G in a non-isoparametric way. We propose two ways of constructing precise representations of G(H), either as trimmed geometry, or by applying an algorithm for converting trimmed geometry to a set of tensor-product patches. We present examples and discuss the properties of both methods. The third problem we address is accessibility analysis and toolpath generation for line-cutting. Line-cutting is a class of subtractive manufacturing techniques in which a line-shaped cutting tool, such a heated wire, or a thin wire-shaped saw, moves tangentially along the reference geometry, removing parts of the workpiece, until the model is produced. From a geometric point of view, line-cutting brings a unique set of challenges in guaranteeing that the process is collision-free. We propose a conservative algorithm for finding globally unobstructed tangential cutting directions in the provided geometry. We demonstrate how, given paths for the line contacts on the surface of a model, line-accessibility analysis can be used for constructing gouging-free cutting toolpaths for line-cutting, whenever possible. We conclude by discussing the results of our research, and suggest potential directions for future research, based on insights from our research and other recent development in the study of geometry.
יום עיון בסייבר ואבטחת מידע 2020
- תאריך:
- יום רביעי, 10.6.2020, 09:00
- מקום:
- הרצאה באמצעות זום
יום העיון בסייבר ואבטחת מידע 2020 באירגונם של פרופ' אלי ביהם, פרופ' שרה ביתן ומרכז המחקר לאבטחת סייבר ע"ש הירושי פוג'יאוורה, יתקיים במרחב הסייבר (באמצעות זום - קישור יישלח בסמוך לאירוע לאחר הרשמה), ביום רביעי, 10 ביוני 2020.
בתוכנית:
* Hashomer: A Proposal for a Privacy-Preserving Bluetooth Based Contact Tracing Scheme for Hamagen
* Neural Reverse Engineering of Stripped Binaries
* Adventures in Cryptographic Standardization
* Dragonblood: Analyzing the Dragonfly Handshake of WPA3 and EAP-pwd
* Rogue7: Rogue Engineering-Station attacks on S7 Simatic PLCs
* Malicious Modules on npm - a series of unfortunate events
ועוד.
ההרצאות יינתנו בעברית.
פרטים נוספים והרשמה (חופשית אך נדרשת).
מצפים לראותכם!
