Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@v_i_o_l_a@openbiblio.social
2025-10-19 14:47:43

"the weight of the evidence": netter whodunit-krimi, der an einer fiktiven nordenglischen uni spielt, aus dem jahr 1944. #2025reads 📗🐧
de.wikipedia.org/wiki/Michael_…

foto des besagten krimis in der grünen ausgabe von penguin books
foto der rückseite des besagten krimis mit dem "klappentext"
@mcdanlj@social.makerforums.info
2025-10-21 00:57:10

@… #HC43S I've published several 3D printable designs for #HamRadio, all designed with

3d-printed morse code key parts, ready to assemble
Assembled and connected morse code key with hand-hold cover
QRP Linked dipole on a 3d printed winder base, made with 26awg wire, 1.5mm shock cord, RG316 coax, and 7 turns on a 0.82" ferrite choke. This is an earlier version of the winder; the latest version has the ability to build your choice of an SO239 or BNC connector instead of integral coax, if you want.
QRP dual-tapped unun that can be used with EFHW (49:1) or EFRW (9:1) depending on which of the red terminals the antenna wire is connected to. The purple terminal is for counterpoise either way. The coax is RG316.
@arXiv_csSE_bot@mastoxiv.page
2025-10-14 11:24:08

Cracking CodeWhisperer: Analyzing Developers' Interactions and Patterns During Programming Tasks
Jeena Javahar, Tanya Budhrani, Manaal Basha, Cleidson R. B. de Souza, Ivan Beschastnikh, Gema Rodriguez-Perez
arxiv.org/abs/2510.11516

Cracking CodeWhisperer: Analyzing Developers' Interactions and Patterns During Programming Tasks
The use of AI code-generation tools is becoming increasingly common, making it important to understand how software developers are adopting these tools. In this study, we investigate how developers engage with Amazon's CodeWhisperer, an LLM-based code-generation tool. We conducted two user studies with two groups of 10 participants each, interacting with CodeWhisperer - the first to understand which interactions were critical to capture and the second to collect low-level interaction data using…

@stefanlaser@social.tchncs.de
2025-12-11 09:31:01

Talking #water in Hsinchu: the biggest reservoir and cleanest stream here in the mid-north of #Taiwan is connected with the Science Park. It serves the #semiconductor industry. A bit is for agricu…

A picture of a river, with mountains in the back. So the right, there are four openings, which is where four large pipes guide the water down to the city area. 3 of them are for the Science Park, and half of this will be used by industry for production
@losttourist@social.chatty.monster
2025-12-07 13:07:59

@… Fortunately we'd only been in there 5 minutes so no, just fruit & veg in the trolley. We were outside for about 20 minutes before the staff were given the OK and everyone could go back in. Not really the biggest crisis ever but y'know, that's as exciting as things get round here on a grey, damp Sunday morning.

@rae@bne.social
2025-11-28 23:20:16
Content warning: Beer

Every time I drive the Hume Highway I am amazed at the volume of big trucks doing the Sydney to Melbourne run. Surely this freight would be better sent by rail?
abc.net.au/news/2025-11-29/rec

Australia's emissions have dropped, but we've got our work cut out to reach targets
Australia's emissions had the biggest drop ever this year outside the artificial kink in the curve during COVID-19 shutdowns, but there's still a lot of work to do.

@arXiv_csDS_bot@mastoxiv.page
2025-10-06 08:21:29

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Sayan Mukherjee, Shinichiro Akiyama
arxiv.org/abs/2510.02725

Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Embedding the vertices of arbitrary graphs into trees while minimizing some measure of overlap is an important problem with applications in computer science and physics. In this work, we consider the problem of bijectively embedding the vertices of an $n$-vertex graph $G$ into the leaves of an $n$-leaf rooted binary tree $\mathcal{B}$. The congestion of such an embedding is given by the largest size of the cut induced by the two components obtained by deleting any vertex of $\mathcal{B}$. The c…