We always enjoy [FloatHeadPhysics] explaining any math or physics topic. We don’t know if he’s acting or not, but he seems genuinely excited about every topic he covers, and it is infectious. He also has entertaining imaginary conversations with people like Feynman and Einstein. His recent video on tensors begins by showing the vector form of Ohm’s law, making it even more interesting. Check out the video below.

If you ever thought you could use fewer numbers for many tensor calculations, [FloatHeadPhysics] had the same idea. Luckily, imaginary Feynman explains why this isn’t right, and the answer shows the basic nature of why people use tensors.

The spoiler: vectors and even scalars are just a special case of tensors, so you use tensors all the time, you just don’t realize it. He works through other examples, including an orbital satellite and a hydroelectric dam.

We love videos that help us have aha moments about complex math or physics. It is easy to spew formulas, but there’s no substitute for having a “feeling” about how things work.

The last time we checked in with [FloatHeadPhysics], he convinced us we were already travelling at the speed of light. We’ve looked at a simple tensor explainer before, if you want a second approach.

youtube.com/embed/k2FP-T6S1x0?…

hackaday.com/2025/07/09/no-ten…

This week Jonathan chats with Joseph P. De Veaugh-Geiss about KDE’s eco initiative and the End of 10 campaign! Is Open Source really a win for environmentalism? How does the End of 10 campaign tie in? And what does Pewdiepie have to do with it? Watch to find out!

• * End Of 10 campaign: endof10.org/
• * KDE Eco project: eco.kde.org/

youtube.com/embed/COdArYxZWgg?…

Did you know you can watch the live recording of the show right on our YouTube Channel? Have someone you’d like us to interview? Let us know, or contact the guest and have them contact us! Take a look at the schedule here.

play.libsyn.com/embed/episode/…

Direct Download in DRM-free MP3.

If you’d rather read along, here’s the transcript for this week’s episode.

Places to follow the FLOSS Weekly Podcast:

• Spotify
• RSS

Theme music: “Newer Wave” Kevin MacLeod (incompetech.com)

Licensed under Creative Commons: By Attribution 4.0 License

hackaday.com/2025/07/09/floss-…

Questo mese, gli sviluppatori Microsoft hanno corretto 137 vulnerabilità nell’ambito del Patch Tuesday. Nessuno di questi bug è stato utilizzato in attacchi, ma i dettagli di una vulnerabilità zero-day in Microsoft SQL Server sono stati resi pubblici prima del rilascio della patch.

In totale, a luglio sono state risolte 14 vulnerabilità critiche, dieci delle quali riguardavano problemi di esecuzione di codice in modalità remota, una era un problema di divulgazione di informazioni e due erano correlate ad attacchi side-channel su AMD. L’unica vulnerabilità pubblicata prima del rilascio della fix è stata scoperta in Microsoft SQL Server.

Ricordiamo che Microsoft classifica come 0-day:

• Vulnerabilità che vengono già sfruttate (“exploited in the wild”) prima che l’azienda rilasci una patch.
• Oppure vulnerabilità rese pubbliche (ad esempio da ricercatori o gruppi hacker) senza che ci sia ancora una correzione ufficiale.

E tale definizione va in contrasto con il concetto classico di vulnerabilità 0day che significa una falla di sicurezza per la quale non esiste ancora una patch ufficiale al momento in cui viene scoperta o sfruttata attivamente.

Il CVE-2025-49719 è un problema di divulgazione di informazioni in Microsoft SQL Server. Il problema potrebbe consentire a un aggressore remoto e non autenticato di accedere ai dati da una memoria non inizializzata. “Una convalida impropria degli input in SQL Server potrebbe consentire a un aggressore non autorizzato di divulgare informazioni”, ha spiegato Microsoft. Gli amministratori possono mitigare la vulnerabilità installando la versione più recente di Microsoft SQL Server e Microsoft OLE DB Driver 18 o 19.

Si noti inoltre che questo mese Microsoft ha corretto una serie di bug RCE critici in Microsoft Office (tra cui CVE-2025-49695 , CVE-2025-49696 , CVE-2025-49697 e CVE-2025-49702 ) che possono essere sfruttati semplicemente aprendo un documento creato appositamente o tramite il riquadro di anteprima. Gli sviluppatori sottolineano che le patch per questi problemi non sono ancora disponibili in Microsoft Office LTSC per Mac 2021 e 2024 e dovrebbero essere rilasciate a breve.

Inoltre, Microsoft ha corretto una vulnerabilità RCE critica in Microsoft SharePoint (CVE-2025-49704) che potrebbe essere sfruttata su Internet semplicemente avendo un account sulla piattaforma. Il punteggio CVSS più alto di questo mese (9,8 punti) è stato ottenuto da un altro bug critico: CVE-2025-47981. Questo errore viola i protocolli di sicurezza Microsoft Simple and Protected GSS-API Negotiation Mechanism (SPNEGO) utilizzando un overflow del buffer heap, che consente l’esecuzione di codice remoto.

Un bug nei componenti del file system NTFS ha permesso a un aggressore di aggirare i meccanismi di difesa di Windows. Una potenziale vittima avrebbe dovuto solo aprire un disco virtuale appositamente predisposto affinché l’aggressore potesse sfruttare la vulnerabilità e ottenere il pieno controllo del sistema. “Per sfruttare la vulnerabilità CVE-2025-49686, un aggressore non avrebbe bisogno di aumentare i privilegi di sistema o di ottenere diritti di accesso speciali. Basterebbe indurre l’utente a eseguire un programma dannoso che sfrutta una vulnerabilità nel driver che garantisce la comunicazione tra i dispositivi in rete. Poiché l’errore ha causato l’accesso tramite un puntatore errato, potrebbe causare una chiusura anomala del programma e, di conseguenza, un errore di sistema. Di conseguenza, l’accesso alle risorse aziendali sarebbe limitato, il che potrebbe potenzialmente compromettere le operazioni dell’organizzazione”.

L'articolo Microsoft Corregge 137 Vulnerabilità nel Patch Tuesday di Luglio. Nessuna sotto attacco attivo proviene da il blog della sicurezza informatica.

It should probably come as no surprise to anyone that the images which we look at every day – whether printed or on a display – are simply illusions. That cat picture isn’t actually a cat, but rather a collection of dots that when looked at from far enough away tricks our brain into thinking that we are indeed looking at a two-dimensional cat and happily fills in the blanks. These dots can use the full CMYK color model for prints, RGB(A) for digital images or a limited color space including greyscale.

Perhaps more interesting is the use of dithering to further trick the mind into seeing things that aren’t truly there by adding noise. Simply put, dithering is the process of adding noise to reduce quantization error, which in images shows up as artefacts like color banding. Within the field of digital audio dithering is also used, for similar reasons. Part of the process of going from an analog signal to a digital one involves throwing away data that falls outside the sampling rate and quantization depth.

By adding dithering noise these quantization errors are smoothed out, with the final effect depending on the dithering algorithm used.

The Digital Era

Plot of a quantized signal and its error. (Source: Wikimedia)
For most of history, humanity’s methods of visual-auditory recording and reproduction were analog, starting with methods like drawing and painting. Until fairly recently reproducing music required you to assemble skilled artists, until the arrival of analog recording and playback technologies. Then suddenly, with the rise of computer technology in the second half of the 20th century we gained the ability to not only perform analog-to-digital conversion, but also store the resulting digital format in a way that promised near-perfect reproduction.

Digital optical discs and tapes found themselves competing with analog formats like the compact cassette and vinyl records. While video and photos remained analog for a long time in the form of VHS tapes and film, eventually these all gave way to the fully digital world of digital cameras, JPEGs, PNGs, DVDs and MPEG. Despite the theoretical pixel- and note-perfect reproduction of digital formats, considerations like sampling speed (Nyquist frequency) and the aforementioned quantization errors mean a range of new headaches to address.

That said, the first use of dithering was actually in the 19th century, when newspapers and other printed media were looking to print phots without the hassle of having a woodcut or engraving made. This led to the invention of halftone printing.

Polka Dots

Left: halftone dot pattern with increasing size downwards, Right: how the human eye would see this, when viewed from a sufficient distance. (Source: Wikimedia)
With early printing methods, illustrations were limited to an all-or-nothing approach with their ink coverage. This obviously meant serious limitations when it came to more detailed illustrations and photographs, until the arrival of the halftone printing method. First patented in 1852 by William Fox Talbot, his approach used a special screen to break down an image into discrete points on a photographic plate. After developing this into a printing plate, these plates would then print this pattern of differently sized points.

Although the exact halftone printing methods were refined over the following decades, the basic principle remains the same to this day: by varying the size of the dot and the surrounding empty (white) space, the perceived brightness changes. When this method got extended to color prints with the CMYK color model, the resulting printing of these three colors as adjoining dots allowed for full-color photographs to be printed in newspapers and magazines despite having only so few ink colors available.

While it’s also possible to do CMYK printing with blending of the inks, as in e.g. inkjet printers, this comes with some disadvantages especially when printing on thin, low-quality paper, such as that used for newspapers, as the ink saturation can cause the paper to rip and distort. This makes CMYK and monochrome dithering still a popular technique for newspapers and similar low-fidelity applications.

Color Palettes

In an ideal world, every image would have an unlimited color depth. Unfortunately we sometimes have to adapt to a narrower color space, such as when converting to the Graphics Interchange Format (GIF), which is limited to 8 bits per pixel. This 1987-era and still very popular format thus provides an astounding 256 possible colors -albeit from a full 24-bit color space – which poses a bit of a challenge when using a 24-bit PNG or similar format as the source. Simply reducing the bit depth causes horrible color banding, which means that we should use dithering to ease these sharp transitions, like the very common Floyd-Steinberg dithering algorithm:
From left to right: original image. Converted to web safe color. Web safe with Floyd-Steinberg dithering. (Source: Wikipedia)
The Floyd-Steinberg dithering algorithm was created in 1976 by Robert W. Floyd and Louis Steinberg. Its approach to dithering is based on error diffusion, meaning that it takes the quantization error that causes the sharp banding and distributes it across neighboring pixels. This way transitions are less abrupt, even if it means that there is noticeable image degradation (i.e. noise) compared to the original.

This algorithm is quite straightforward, working its way down the image one pixel at a time without affecting previously processed pixels. After obtaining the current pixel’s quantization error, this is distributed across the subsequent pixels following and below the current one, as in the below pseudo code:
for each y from top to bottom do
for each x from left to right do
oldpixel := pixels[x]
[y] newpixel := find_closest_palette_color(oldpixel)
pixels[x][y] := newpixel
quant_error := oldpixel - newpixel
pixels[x + 1][y ] := pixels[x + 1][y ] + quant_error × 7 / 16
pixels[x - 1][y + 1] := pixels[x - 1][y + 1] + quant_error × 3 / 16
pixels[x ][y + 1] := pixels[x ][y + 1] + quant_error × 5 / 16
pixels[x + 1][y + 1] := pixels[x + 1][y + 1] + quant_error × 1 / 16

The implementation of the find_closest_palette_color() function is key here, with for a greyscale image a simple round(oldpixel / 255) sufficing, or trunc(oldpixel + 0.5) as suggested in this CS 559 course material from 2000 by the Universe of Wisconsin-Madison.

As basic as Floyd-Steinberg is, it’s still commonly used today due to the good results that it gives with fairly minimal effort. Which is not to say that there aren’t other dithering algorithms out there, with the Wikipedia entry on dithering helpfully pointing out a number of alternatives, both within the same error diffusion category as well as other categories like ordered dithering. In the case of ordered dithering there is a distinct crosshatch pattern that is both very recognizable and potentially off-putting.

Dithering is of course performed here to compensate for a lack of bit-depth, meaning that it will never look as good as the original image, but the less obnoxious the resulting artefacts are, the better.

Dithering With Audio

Although at first glance dithering with digital audio seems far removed from dithering the quantization error with images, the same principles apply here. When for example the original recording has to be downsampled to CD-quality (i.e. 16-bit) audio, we can either round or truncate the original samples to get the desired sample size, but we’d get distortion in either case. This distortion is highly noticeable by the human ear as the quantization errors create new frequencies and harmonics, this is quite noticeable in the 16- to 6-bit downsampling examples provided in the Wikipedia entry.

In the sample with dithering, there is clearly noise audible, but the original signal (a sine wave) now sounds pretty close to the original signal. This is done through the adding of random noise to each sample by randomly rounding up or down and counting on the average. Although random noise is clearly audible in the final result, it’s significantly better than the undithered version.

Random noise distribution is also possible with images, but more refined methods tend to give better results. For audio processing there are alternative noise distributions and noise shaping approaches.

Regardless of which dither method is being applied, it remains fascinating how the humble printing press and quantization errors have led to so many different ways to trick the human eye and ear into accepting lower fidelity content. As many of the technical limitations that existed during the time of their conception – such as expensive storage and low bandwidth – have now mostly vanished, it will be interesting to see how dithering usage evolves over the coming years and decades.

Featured image: “JJN Dithering” from [Tanner Helland]’s great dithering writeup.

hackaday.com/2025/07/09/dither…

E' successo ancora: un mio collega ha lasciato la bici alla stazione, regolarmente bloccata con un lucchetto, e stamattina non l'ha più trovata.

Capisco che il Paese abbia altri e più importanti problemi di cui occuparsi, ma sarebbe davvero uno sforzo proibitivo quello di dotare tutte le stazioni ferroviarie o degli autobus di una rastrelliera e di un paio di telecamere puntate sopra?

Per quanto ancora il furto della propria bici dovrà essere vissuto come la norma, come una tassa da pagare per lo "sfizio" di volersi muovere con il mezzo meno inquinante di tutti?

Io veramente non capisco...

#ciclismourbano