One common issue I have found working on the field with customers adopting Node.js is that they don’t have visibility around what happens when their applications crash, also, on specific critical applications these unexpected crashes don’t allow the server to exit gracefully missing opportunities to store state for possible recovery actions. This talk presents a series of best practices on how to deal with `uncaughtExceptions` and `unhandledRejections` in a way that gives developers visibility on errors, post-mortem information and how to handle graceful shutdowns. EVENT: NearForm 2019 SPEAKER: Julián Duque PUBLICATION PERMISSIONS: NearForm provided Coding Tech with the permission to republish NearForm conference talks. CREDITS: NearForm YouTube channel: https://www.youtube.com/channel/UCp2Tsbjd3P8itnBHUNHi82A https://www.youtube.com/watch?v=62ZRPJkHOX0

Shor's Algorithm for factoring integer numbers is the big threat to cryptography (RSA/ECC) as it reduces the complexity from exponential to polynomial, which means a Quantum Computer can reduce the time to crack RSA-2048 to a mere 10 seconds. However current noisy NISQ type quantum computers are very limited to something like 16 bit RSA keys. And the quality of the current qubits is so bad that error-correction comes at a massive cost of at least 100 times the amount of qubits. While the world is pre-occupied whether we have universal quantum computers big enough for Shor's algorithm, Quantum Annealing is stealing the show with having factored a 20-bit number just in January this year using 97 qubits. And these qubits are actually good enough to factor bigger numbers. If we assume a linear scalability, we'd "only" need around 10,000 qubits to factor a 2048bit RSA key. D-Wave announced a quantum computer with 5,640 qubits, so that puts it within reach soon. So, could Quantum Annealing be more of a threat to cryptography than Shor's algorithm on universal quantum computers? How do these algorithms work? How do they achieve a polynomial complexity to what traditional computers need exponential time? What impact will this have on the competition from NIST for the design of post-quantum-cryptography algorithms? https://www.youtube.com/watch?v=xdP1wpbsbdU

What does it take to create a FontAwesome equivalent for comics? S. Anand delivers this talk for:
1. JavaScript developers who want to include comics in their pages
2. JavaScript developers who want to understand gotchas in library packaging Anand shows what it takes to express data visualizations by evoking emotions – in the form of comics. He talks about the JavaScript utility that his team at Gramener created. This library, called ComicGen, breaks down comic characters into structured components (and how you can break down arbitrary images similarly in JS). The library also allows drawing and composing these images using data. ComicGen handles problems with static content and async loading on CDNs. EVENT: JSFood 2019 PUBLICATION PERMISSIONS: Original video was published with the Creative Commons Attribution license (reuse allowed). ATTRIBUTION CREDITS: Original video source: https://www.youtube.com/watch?v=-Ys4qtpUogg https://www.youtube.com/watch?v=-hC7c5nWG1I