New Music Artist Videos
1,870 Videos. Showing Newest from #1
RobustIRC — IRC without Netsplits

Add to EJ Playlist  Google Tech Talk February 9, 2015 (more info below) Presented by Michael Stapelberg ABSTRACT In this tech talk, I will present RobustIRC, an IRC server built as a distributed system on top of Raft (a simpler alternative to Paxos), written in Go. Due to its distributed nature and a transport protocol that can take a failing TCP connection, netsplits are a thing of the past in RobustIRC. That all said, as the name implies, RobustIRC is usable with plain old IRC clients such as irssi, WeeChat, … I’ll also cover RobustIRC’s scalability properties and what the limitations are. Target audience is anyone who has ever used IRC (or is interested in distributed systems), probably especially SREs due to their inexplicable preference for IRC over other chat protocols ;).

Daniel Lidar: "Quantum Information Processing: Are We There Yet?"

Add to EJ Playlist  Daniel Lidar visited the Quantum AI Lab at Google LA to give a talk: "Quantum Information Processing: Are We There Yet?" This talk took place on January 22, 2015. Abstract: Quantum information processing holds great promise, yet large-scale, general purpose quantum computers capable of solving hard problems are not yet available despite 20+ years of immense effort. In this talk I will describe some of this promise and effort, as well as the obstacles and ideas for overcoming them using error correction techniques. I will focus on a special purpose quantum information processor called a quantum annealer, designed to speed up the solution to tough optimization problems. In October 2011 USC and Lockheed-Martin jointly founded a quantum computing center housing a commercial quantum annealer built by the Canadian company D-Wave Systems. A similar device is operated by NASA and Google. These processors use superconducting flux qubits to minimize the energy of classical spin-glass models with as many spins as qubits, an NP-hard problem with numerous applications. There has been much controversy surrounding the D-Wave processors, questioning whether they offer any advantage over classical computing. I will survey the recent work we have done to benchmark the processors against highly optimized classical algorithms, to test for quantum effects, and to perform error correction. Bio: Daniel Lidar has worked in quantum computing for nearly 20 years. He is a professor of electrical engineering, chemistry, and physics at USC, and hold a Ph.D. in physics from the Hebrew University of Jerusalem. His work revolves around various aspects of quantum information science, including quantum algorithms, quantum control, the theory of open quantum systems, and theoretical as well as experimental adiabatic quantum computation. He is a Fellow of the AAAS, APS, and IEEE. Lidar is the Director of the USC Center for Quantum Information Science and Technology, and is the Scientific Director of the USC-Lockheed Martin Center for Quantum Computing. Two of his former graduate students are now research scientists at Google’s quantum artificial intelligence lab.

Stochastic Optimization for x86 Binaries

Add to EJ Playlist  Google Tech Talks January 12, 2015 (more info below) ABSTRACT The optimization of short sequences of loop-free fixed-point x86_64 code sequences is an important problem in high-performanc e computing. Unfortunately, the competing constraints of transformation correctness and performance improvement often force even special purpose compilers to produce sub-optimal code. We show that by encoding these constraints as terms in a cost function, and using a Markov Chain Monte Carlo sampler to rapidly explore the space of all possible programs, we are able to generate aggressively optimized versions of a given target program. Beginning from binaries compiled by gcc -O0, we are able to produce provably correct code sequences that either match or outperform the code produced by gcc -O3, and in some cases expert hand-written assembly. Because most high-performanc e applications contain floating-point computations, we extend our technique to this domain and show a novel approach to trading full floating-point precision for further increases in performance. We demonstrate the ability to generate reduced precision implementations of Intel's handwritten C numerics library that are up to six times faster than the original code, and achieve end-to-end speedups of over 30% on a direct numeric simulation and a ray tracer. Because optimizations that contain floating-point computations are not amenable to formal verification using the state of the art, we present a technique for characterizing maximum error and providing strong evidence for correctness. Publication list: http://cs.stanf eschkufz/ Github: https://github. com/eschkufz/st oke-release About the speaker Eric Schkufza is a postdoctoral scholar at Stanford University working with professor Alex Aiken. He graduated from Stanford University with a PhD in computer science in June 2014. He is interested in applying stochastic search techniques to the design of optimizing compilers.

Matthias Troyer: "High Performance Quantum Computing"

Add to EJ Playlist  Matthias Troyer visited Google LA to speak about "High Performance Quantum Computing." This talk took place on December 2, 2014. Abstract: As the outlines of a roadmap to building powerful quantum devices becomes more concrete an important emerging question is that of important real-world applications of quantum computers. While there exist many quantum algorithms which asymptotically outperform classical algorithms, asymptotic superiority can be misleading. In order for a quantum computer to be competitive, it needs to not only be asymptotically competitive but be able to solve problems within a limited time (for example one year) that no post-exa-scale classical supercomputer can solve within the same time. This search for a quantum killer-app turns out to be a formidable challenge. Using quantum chemistry simulations as a typical example, it turns out that significant advances in quantum algorithms are needed to achieve this goal. I will review how substantial improvements and optimized massively parallel implementation strategies of quantum algorithms have brought the problem of quantum chemistry from the realm of science fiction closer to being realistic. Similar algorithmic improvements will be needed in other areas in order to identify more “killer apps” for quantum computing. I will end with a short detour to quantum annealers and present a summary of our recent results on simulated classical and quantum annealing. Bio: Matthias Troyer is professor of computational physics at ETH Zurich where he teaches advanced C++ programming, high performance computing, and simulations methods for quantum systems. He is a pioneer of cluster computing in Europe, having been responsible for the installation of the first Beowulf cluster in Europe with more than 500 CPUs in 1999, and the most energy efficient general purpose computer on the top-500 list in 2008. He is a Fellow of the American Physical Society and his activities range from quantum simulations and quantum computing to the development of novel simulation algorithms, high performance computing, and computational provenance. He is, the author of the Boost MPI C++ library for message passing on parallel computers, and the leader of the open-source ALPS library for the simulation of quantum many body systems.

Evolving JavaScript with TypeScript

Add to EJ Playlist  Google Tech Talk November 13, 2014 Presented by Anders Hejlsberg (more info below) ABSTRACT In this talk Anders will give an overview of TypeScript, a statically typed superset of JavaScript that compiles to plain JavaScript. TypeScript adds optional static types, classes, interfaces, and modules to JavaScript, enabling IDE productivity features such as statement completion, refactoring, and code navigation, and making it easier for teams to communicate requirements and build applications safely. The TypeScript language features an innovative structural type system that incorporates gradual typing and type inference. The TypeScript project is open-source and hosted on GitHub. Speaker Info: Anders Hejlsberg is a Technical Fellow in the Developer Division at Microsoft Corporation and works on Microsoft’s .NET and JavaScript development tools. He is the chief designer of the C# programming language and co-designer of the TypeScript programming language. Before joining Microsoft in 1996, Anders was a Principal Engineer at Borland International. As one of the first employees of Borland, he was the original author of Turbo Pascal and later worked as the Chief Architect of the Delphi product line. Anders studied Engineering at the Technical University of Denmark.

CheckInside: A Fine-grained Indoor Location-based Social Network

Add to EJ Playlist  Google Tech Talk November 19, 2014 Presented by Moustafa Youssef ABSTRACT Existing location-based social networks (LBSNs), e.g. Foursquare, depend mainly on GPS or network-based localization to infer users’ locations. However, GPS is unavailable indoors and network-based localization provides coarse-grained accuracy. This limits the accuracy of current LBSNs in indoor environments, where people spend 89% of their time. This in turn affects the user experience, in terms of the accuracy of the ranked list of venues, especially for the small screens of mobile devices; misses business opportunities; and leads to reduced venues coverage. In this talk, we present CheckInside: a system that can provide a fine-grained indoor location-based social network. CheckInside leverages the crowd-sensed data collected from users’ mobile devices during the check-in operation and knowledge extracted from current LBSNs to associate a place with its name and semantic fingerprint. This semantic fingerprint is used to obtain a more accurate list of nearby places as well as automatically detect new places with similar signatures. A novel algorithm for handling incorrect check-ins and inferring a semantically-en riched floorplan is proposed as well as an algorithm for enhancing the system performance based on the user implicit feedback. Evaluation of CheckInside in four malls over the course of six weeks with 20 participants shows that it can provide the actual user location within the top five venues 99% of the time. This is compared to 17% only in the case of current LBSNs. In addition, it can increase the coverage of current LBSNs by more than 25%. Speaker Info: Moustafa Youssef is an Associate Professor at Egypt-Japan University of Science and Technology (EJUST) and Director of the Wireless Research Center, Egypt. He received his Ph.D. degree in computer science from University of Maryland, USA in 2004 and a B.Sc. and M.Sc. in computer science and engineering from Alexandria University, Egypt in 1997 and 1999 respectively. His research interests include mobile wireless networks, mobile computing, location determination technologies, pervasive computing, and network security. He has twelve issued and pending patents. He is an associate editor for the ACM TSAS, an area editor of the ACM MC2R and served on the organizing and technical committees of numerous conferences. Dr. Youssef is the recipient of the 2003 University of Maryland Invention of the Year award, the 2010 joint TWAS-AAS-Micros oft Award for Young Scientists, the 2012 Egyptian State Award, the 2014 COMESA Innovation Award, among others. He is also an ACM Distinguished Speaker.

Blowing up the (C++11) Atomic Barrier

Add to EJ Playlist  Google Tech Talk October 27, 2014 Presented by Robin Morisset ABSTRACT Atomics in C11 and C++11 let the programmer express the guarantees needed for racy accesses in lock-free code, in theory bringing a zero-cost abstraction for parallelism to the language. This talk will showcase how you can use atomics today and where the abstraction breaks down. We’ll focus on LLVM’s recent improvements for atomics that provide significant performance gains on ARMv7, Power and x86. Finally we’ll discuss some extremely non-intuitive behaviors of atomics, how atomics in C++ may evolve, and how it may impact LLVM. Slides can be found here: https://docs.go tation/d/1Ok3NH ezdnKLD4XSzI8WV wdMC07DR3w87n80 Mj5ydtGE Speaker Info: Robin Morisset interned in Chrome's NaCl team for the summer, and focused on tuning C11/C++11 atomics in LLVM for x86/ARM/Power. He is a PhD Student at the ENS Paris.

The Data on Diversity: It's Not Just About Being Fair

Add to EJ Playlist  Google Tech Talk October 29, 2014 presented by Beryl Nelson ABSTRACT Google puts a lot of energy into diversity. Why should it matter whether you work in a team in which people all think the same way, or have different life experiences and points of view? And what can you personally do to improve diversity at Google? Beryl will open her talk with some of the wealth of research and data available about the value of a diverse team composition in terms of financial results and innovation. However, making a diverse team effective is not simple. The second part of the talk will include data relating to barriers to the effectiveness of diverse teams. One of the most difficult problems to deal with, and to measure, is unconscious bias. Why is it that 52% of Fortune 500 CEOs are over 6 feet tall (182.8 cm), and about a third are over 6 feet 2 inches (187.8 cm)? Imaginative researchers have found statistical methods that can measure unconscious bias and other barriers to effectiveness. People who are aware of these barriers can find ways to overcome them, as Beryl will show with a few examples. Finally, the talk will also focus on recommendations to engineers on what they can personally do to improve the diversity of teams, and the effectiveness of diverse teams. A more formal version of the same essay is being published as a review article in Communications of the ACM in the November, 2014 issue (article: http://cacm.acm .org/magazines/ 2014/11/179827- the-data-on-div ersity/fulltext ; full bibliography: http://rule-of- m/2014/10/the-d ata-on-diversit y-its-not-just. html). About the speaker Beryl Nelson is an Engineering Manager working in websearch infrastructure. Early in her career, Beryl worked on languages and compilers, including two early Lisp implementations , PSL at the U of Utah, and one of the first implementations of Common Lisp, at DEC. Beryl recently moved back to the US after 18 years in Asia and Europe: 8.5 years in Japan, 6.5 years in India, and almost 3 years in Kraków, Poland, a beautiful city. In part because of her experience of living as a minority in Asia for 15 years (see for example this recent blog post: http://rule-of- m/2014/10/major ity-minority-in versions.html), Beryl has taken an interest in the published research on diversity and its practical applications, and to this end has designed and co-presented diversity sessions at Grace Hopper India and Grace Hopper US, at the ACM India conference 2011, and internally within Google.

GTAC 2014: Impact of Community Structure on SAT Solver Performance

Add to EJ Playlist  Zack Newsham (University of Waterloo) Modern CDCL SAT solvers routinely solve very large in- dustrial SAT instances in relatively short periods of time. It is clear that these solvers somehow exploit the structure of real-world instances. How- ever, to-date there have been few results that precisely characterise this structure. In this paper, we provide evidence that the community struc- ture of real-world SAT instances is correlated with the running time of CDCL SAT solvers. It has been known for some time that real-world SAT instances, viewed as graphs, have natural communities in them. A community is a sub-graph of the graph of a SAT instance, such that this sub-graph has more internal edges than outgoing to the rest of the graph. The community structure of a graph is often characterised by a quality metric called Q. Intuitively, a graph with high-quality community struc- ture (high Q) is easily separableinto smaller communities, while the one with low Q is not. We provide three results based on empirical data which show that community structure of real-world industrial instances is a bet- ter predictor of the running time of CDCL solvers than other commonly considered factors such as variables and clauses. First, we show that there is a strong correlation between the Q value and Literal Block Distance metric of quality of conflict clauses used in clause-deletion policies in Glucose-like solvers. Second, using regression analysis, we show that the the number of communities and the Q value of the graph of real-world SAT instances is more predictive of the running time of CDCL solvers than traditional metrics like number of variables or clauses. Finally, we show that randomly-genera ted SAT instances with 0.05 ≤ Q ≤ 0.13 are dramatically harder to solve for CDCL solvers than otherwise.

GTAC 2014: Scalable Continuous Integration - Using Open Source

Add to EJ Playlist  Vishal Arora (Dropbox) Many open source tools are available for continuous integration (CI). Only a few operate well at large scale. And almost none are built to scale in a distributed environment. Come find out the challenges of implementing CI at scale, and one way to put together open source pieces to quickly build your own distributed, scalable CI system.

GTAC 2014: Move Fast & Don't Break Things

Add to EJ Playlist  GTAC 2014 Playlist: ba1rc Ankit Mehta, Google Move Fast & Don't Break Things Ankit joined Google in Dec 2003 lured by free food and an opportunity to play a role in how Testing evolves @ Google. Over the 10+ year career at Google he has worked in many product areas and currently leads test efforts for the Social Product Area @ Google; which consists of projects like Google+, Photos, Hangouts, Blogger, News, etc. Ankit is particularly interested in pushing the limits on the balance between Velocity and Quality.

GTAC 2014: Test Automation on an Infrared Set-top Box

Add to EJ Playlist  Olivier Etienne (Orange) This talk will explain what a TV App context is and the kind of problems we can encounter when trying to automate the things out. Olivier will go through previous failures, their approach and what have been the key points to build an automatic test tool. If time permits, he will go deeper in the details of the implementation. Come listen how a few solders and some lines of code have opened the rich world of web testing to a set-top box.

GTAC 2014: Espresso, Spoon, Wiremock, Oh my!

Add to EJ Playlist  Michael Bailey (American Express) GTAC 2014: Espresso, Spoon, Wiremock, Oh my! ( or how I learned to stop worrying and love Android testing ) Learn about creating and executing fast and reliable automated Android UI tests. Tools will include Espresso, Spoon, Wiremock and Jenkins. Basic Android and Java development knowledge is assumed.

GTAC 2014: I Don't Test Often ... But When I Do, I Test in Production

Add to EJ Playlist  Gareth Bowles (Netflix) Every day, Netflix has more customers consuming more content on an increasing number of client devices. We're also constantly innovating to improve our customers' experience. Testing in such a rapidly changing environment is a huge challenge, and we've concluded that running tests in our production environment can often be the most efficient way to validate those changes. This talk will cover three test methods that we use in production: simulating all kinds of outages with the Simian Army, looking for regressions using canaries, and measuring test effectiveness with code coverage analysis from production.

GTAC 2014: The Testing User Experience

Add to EJ Playlist  Alex Eagle (Google) Google's products release frequently, and that requires significant automated testing and "build-copping" . We are now working to offer our testing infrastructure as part of Google Cloud Platform. This talk will discuss some of the methodology we use to keep our builds green and our products defect-free, and give a preview of how we are exposing this to the world.

GTAC 2014: Test coverage at Google

Add to EJ Playlist  Andrei Chirila, Google Did you ever wonder how testing at Google looks like? What tools we use to help us out and how do we measure and act on test coverage? We will briefly describe the development process at Google, then focus on use of code coverage measurement and how we use code coverage to improve code quality and engineering productivity. In the end, we'll present the vast amount of coverage data, spanning more than 100.000 commits, we have collected and some more widely applicable conclusions we have reached.

GTAC 2014: Automation for a Better Web

Add to EJ Playlist  James Graham, Mozilla The web is the world's most popular application platform, yet poor browser interoperabilit y is an all-too-common cause of dismay and frustration amongst web developers. In order to try improve this situation the W3C has been facilitating a community effort to produce a continually updated, cross-browser, testsuite for the open web; the web-platform-te sts. In this talk James will introduce the web-platform-te sts and describe the tools we have created for driving automation of the tests across a range of desktop browsers, and on mobile devices running Firefox OS. He will show how this software has been designed to meet the challenges of running an externally-sour ced, frequently updated, testsuite on hundreds of commits a day in Mozilla's continuous integration system.

GTAC 2014: Selendroid - Selenium for Android

Add to EJ Playlist  ominik Dary (Adobe) Selendroid is an open source test automation framework which drives off the UI of Android native and hybrid applications and the mobile web. Tests are written using the Selenium 2 client API. For testing no modification of app under test is required in order to automate it. This presentation demonstrates to the audience how easy it is to do mobile test automation. It shows how Selendroid can be used to test native and hybrid Android apps and how the Selenium Grid can be used for parallel testing on multiple devices. Advances topics like extending Selendroid itself at runtime and doing cross platform tests will be covered as well.

GTAC 2014: Free Tests Are Better Than Free Bananas

Add to EJ Playlist  Celal Ziftci (Google) Free Tests Are Better Than Free Bananas: Using Data Mining and Machine Learning To Automate Real-Time Production Monitoring There is growing interest in leveraging data mining and machine learning techniques in the analysis, maintenance and testing of software systems. In this talk, Celal will discuss how we use such techniques to automatically mine system invariants, use those invariants in monitoring our systems in real-time and alert engineers of any potential production problems within minutes. The talk will consist of two tools we internally use, and how we combine them to provide real-time production monitoring for engineers almost for free: A tool that can mine system invariants. A tool that monitors production systems, and uses the first tool to automatically generate part of the logic it uses to identify potential problems in real-time.

GTAC 2014: Fire Away Sooner And Faster With MSL!

Add to EJ Playlist  Bryan Robbins (FINRA) and Daniel Koo (FINRA) Delivering software faster without compromising quality is not a trivial task. We all desire to move at speed by developing tests early and executing tests faster, with a minimal maintenance footprint. At FINRA, we developed MSL (pronounced "Missile") to enable Agile teams leveraging layered architectures such as MVC to test their UI code sooner and faster in isolation. MSL supports integration testing of UI code (such as Javascript, HTML, CSS) by deploying locally on a Node.js server and configuring mock HTTP responses from test code using one of our clients (Java, Javascript, or Node.js). This talk will introduce key features of MSL with a few examples.

GTAC 2014: The Importance of Automated Testing on Real and Virtual Mobile Devices

Add to EJ Playlist  Jay Srinivasan (Google) and Manish Lachwani (Google) Compared to the web world, mobile testing is a minefield. From different devices, operating systems, networks and locations, there are seemingly an infinite number of variables developers must account for. In this educational session, we will discuss some of the unique challenges that come with optimizing the performance and quality of mobile apps, and strategies for addressing them, including the need for automation, real devices and real user conditions.

GTAC 2014: Beyond Coverage: What Lurks in Test Suites?

Add to EJ Playlist  Patrick Lam (University of Waterloo) We all want "better" test suites. But what makes for a good test suite? Certainly, test suites ought to aim for good coverage, at least at the statement coverage level. To be useful, test suites should run quickly enough to provide timely feedback. This talk will investigate a number of other dimensions on which to evaluate test suites. The talk claims that better test suites are more maintainable, more usable (for instance, because they run faster, or use fewer resources), and have fewer unjustified failures. In this talk, I'll present and synthesize facts about 10 open-source test suites (from 8,000 to 246,000 lines of code) and evaluate how they are doing.

GTAC 2014: Make Chrome the best mobile browser

Add to EJ Playlist  Karin Lundberg (Google) One of the reasons for Chrome’s success has been its core principles of speed, stability, simplicity and security (the 4 S’s). When we released Chrome for Android and iOS, we not only applied the 4 S’s to the browser itself but also to how we do automated testing and the kind of tests we run: Speed is for performance testing and fast tests. Stability is for stability testing and stable tests. Simplicity is for testing that Chrome has a simple user experience and for making it simple to add and run tests. Security is for security testing.

GTAC 2014: Google BigQuery Analytics

Add to EJ Playlist  Brian Vance (Google) BigQuery is Google Cloud's interactive big data service. Users can analyze terabytes of data in a matter seconds through SQL-like queries. It is built on top of Dremel, which Google testers have been using internally for years. We will walk through a couple examples, and show you how you can get started with BigQuery.

GTAC 2014: Never Send a Human to do a Machine’s Job: How Facebook uses bots to manage tests

Add to EJ Playlist  Roy Williams (Facebook) Facebook doesn't have a test organization, developers own everything from writing their code to testing it to shepherding it into production. That doesn't mean we...

GTAC 2014: Going Green: Cleaning up the Toxic Mobile Environment

Add to EJ Playlist  Thomas Knych (Google), Stefan Ramsauer (Google), Valera Zakharov (Google) and Vishal Sethia (Google) We will present tools and techniques for creating fast, stable, hermetic test environments...

GTAC 2014: CATJS: Applications That Test Themselves

Add to EJ Playlist  Ran Snir (HP) and Lior Reuven (HP) In the past years we have seen many anomalies that have changed the way we think about the computing world. There are 3d printers that print 3d printers,...

GTAC 2015: Round Table Presentation 1: Mobile Cross-Platform Testing

Add to EJ Playlist  Yusuke Tsutsumi (Zillow) Shauvik Choudhary (Ph.D.. candidate at Georgia Tech.)

GTAC 2014: The Challenge of Fairly Comparing Cloud Providers and What We're Doing About It

Add to EJ Playlist  Anthony Voellm (Google) This talk will cover the history of benchmarking from mainframe to Cloud. The goal is to lay a foundation around where benchmarks started and how they have gotten to...

GTAC 2014: A Test Automation Language for Behavioral Models

Add to EJ Playlist  Nan Li, Medidata Solutions Model-based testers design abstract tests in terms of models such as paths in graphs. Then the abstract tests need to be converted to concrete tests, which are defined...

NEWS   Top Videos   Music   Classical   Listen   Funny   Fails   Artist List   Aww   Gaming   Minisode   Science   Technology   TED   TWiT   Trailers   M.M.   PBS   WSJ   AP   CSPAN   CNN   RT   Mox   TMZ   E!   ABC   CBS   Politics   Sports   ESPN   WTF   Conspiracy  

Related Uploaders:

GoogleTechTalks Playlists:
24 GTAC 2014
24 GTAC 2013
27 NASA@Google
12 Google Faculty Summit 2012
4 Online Learning
12 Alan M. Turing Centennial Conference - Israel
20 NIPS 2011 Big Learning: Algorithms, System & Tools Workshop
13 NIPS 2011 Sparse Representation & Low-rank Approx Workshop
13 NIPS 2011 Music and Machine Learning Workshop
5 NIPS 2011 Learning Semantics Workshop
9 NIPS 2011 Domain Adaptation Workshop
2 Make the Web Faster
15 GTAC 2011
20 Google NYC Tech Talks
21 GTAC 2010
8 Perspectivas Speaker Series (beta)
14 GTAC 2009
11 Google Intenet Summit 2009
11 Web Exponents
31 Energy and the Environment