A Collection of Lectures on the Ethical implications of Data and Artificial Intelligence from Different Perspectives

OpenTelemetry Protocol

Arrow Format

In Adobe's internal developer platform journey to a platform development, a number of themes have emerged. A look at how it's dealt with them.

What if we used the OpenAPI specification to whip up the smallest version of an API and spin up a mock with nothing on the backend, just to test it out?

Different tokens have different purposes and should be used appropriately for each use case.

Mutual TLS Sender Constrained Tokens add another security layer and mitigate the risk of misuse of tokens.

The advancement of hackers requires stepping up security. That’s why using an access control system using the principle of least privilege is recommended.

Federated learning allows data scientists to leave the data where it is while still training artificial intelligence models.

Hidden configuration improvements in Elixir's latest releases.

Leaflet is a modern, lightweight open-source JavaScript library for mobile-friendly interactive maps.

GPX - The GPS Exchange Format

Lately, I’ve been thinking about the idea of creating a web app for storing and visualizing my cycle rides. Most of the popular activity trackers, allow exporting your activities as GPX files. We can use those files to import activity to the other service, for example to the one that we will build in a moment.

A FIDO credential that is backed up (usually to the user’s platform account; e.g., Google Account or AppleID), allowing users to restore the credential to, and use it from, another device. From a user experience standpoint, this will be very similar to how one interacts with a password manager today to help them securely enroll and sign into websites – only it will be far more secure. For service providers, this expands the range of options for deploying modern, phishing-resistant authentication.

Railway is an infrastructure platform where you can provision infrastructure, develop with that infrastructure locally, and then deploy to the cloud.

Wherein I use LEGO to talk about organizing your code for ease of use

Companies spend a lot of money on runtime logging. But are we getting a lot of value? This blog post examines some common logging pitfalls and provides examples and best practices for how you can i…

A case study by Nils Hyoma, Jan Schneider and Wuk Petrovic.

The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solve a TSP problem instance that is larger than 1 M nodes given only 1 h of computing time. In this article, we analyze the results and show which design choices are decisive in providing the best solution to the problem with the given constraints. There were three valid submissions, all based on local search, including k-opt up to k = 5. The most important design choice turned out to be the localization of the operator using a neighborhood graph. The divide-and-merge strategy suffers a 2% loss of quality. However, via parallelization, the result can be obtained within less than 2 min, which can make a key difference in real-life applications.

(Or, “regularized greedy algorithms and their applications.”) James Gilles “Algorithm” is one of those words that sounds fancier than it really deserves. We hear all the time about the “facebook algorithm”, the “youtube algorithm”, “high frequency trading algorithms”, “artificial intelligence algorithms”, and so on. What are these, really? The “facebook algorithm” is a large blob of software that Facebook uses to try to get people to stay on their website longer.

Have you ever been to an event where you had to present ID to prove that you were the person who bought the ticket? The act of asking for…

“After building like eight personal wikis/information management systems/hypertext databases (and becoming exceedingly efficient at it) I'll say the problem is that 99% of their uses decompose into three disjoint usecases: 1. Todo list+journal 2. Learning 3. Reference archive”

The kernel is, in many ways, a marvel of scalability, but there is a longstanding pain point in the memory-management subsystem that has resisted all attempts at elimination: the mmap_lock. This lock was inevitably a topic at the 2022 Linux Storage, Filesystem, Memory-Management and BPF Summit (LSFMM), where the idea of using per-VMA locks was raised. Suren Baghdasaryan has posted an implementation of that idea — but with an interesting twist on how those locks are implemented.

Minimalistic data structure sketches

We’ll build a web app to solve every developer's most common problem – finding an excuse to justify our messy work! And will do it with a single config file that covers the full-stack app architecture plus several dozen lines of code. In the quickest possible way, so we can’t excuse ourselves from building it!