Tootfinder

Neues synthetisches Polymer ist leicht, sehr hart und tötet Viren ab
Ein neues Polymer hat ungewöhnliche Eigenschaften: Es ist sehr stabil, leicht, kann flexibel sein und Viren abtöten. Einfach herzustellen, ist es auch.

Morgen dus waarschijnlijk de hele dag een van de debatten die de meeste aandacht zal krijgen, maar inhoudelijk totaal niets waard hoogst waarschijnlijk.
@… #politiek #debat

Palmer’s Bar in #Minneapolis will close in September #Minnesota
Many good memories of Palmer's
“there are dives and dives in this world. There’s the type Guy Fieri calls out, old joints that might not feel like they need to get their hair done before seeing company but are nonetheless f…

Palmer’s, legendary 119-year-old Minneapolis dive bar, will close in September
The owners cited declining alcohol sales at the watering hole once hailed by Esquire as one of the best bars in America.

'Regeling van werkzaamheden' die voor de hele namiddag en avond ingepland is.
Ik heb het altijd al een best grappige omschrijving gevonden voor dit soort debatten. 😉
@…
#Politiek #debat

📣 Beim diesjährigen Culture Community Plenary 5
(24.–26.09.2025, Akademie der Wissenschaften und der Literatur | Mainz) bieten wir erneut beim Markt der Möglichkeiten ein Austauschformat vor Ort an, bei dem sich Projekte, Services von NFDI4Culture, aber auch Participants und Partner:innen des Konsortiums vorstellen können.
📨 Bis zum 15.07.2025 können Interessierte eine kurze Beschreibung des Posters an uns senden: coordination-office@nfdi4culture.de

(YouTube playlist) Some 15 years after receiving his Dobelle brain implant for restoring vision, Jens ("Patient Alpha") tried The vOICe vision BCI https://www.youtube.com/playlist?list=PLmrvukzbS44SMVxMLRpd-_iTpy_Cj5liB Will Neuralink Blinds…

Your reasoning powers are good, and you are a fairly good planner.

New Federal Employees Must Now Write Essays Praising Trump's Policies (Kate Plummer/Newsweek)
https://www.newsweek.com/trump-administration-federal-employees-merit-hiring-plan-2080139
http://www.memeorandum.com/250604/p3#a250604p3

The minimum size of maximal bipartite IC-plane graphs with given connectivity
Guiping Wang, Yuanqiu Huang, Zhangdong Ouyang, Licheng Zhang
https://arxiv.org/abs/2506.00878

The minimum size of maximal bipartite IC-plane graphs with given connectivity
Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph has at most 2.25n-4 edges, which implies that bipartite IC-planar graphs have vertex-connectivity at most 4. In this paper, we prove that any n-vertex maximal bipartite IC-plane graph with connectivity 2 has at least 3/2n-2 edges, and those with connectivity…

Haptic Rapidly-Exploring Random Trees: A Sampling-based Planner for Quasi-static Manipulation Tasks
Lin Yang, Huu-Thiet Nguyen, Donghan Yu, Chen Lv, Domenico Campolo
https://arxiv.org/abs/2506.00351

Haptic Rapidly-Exploring Random Trees: A Sampling-based Planner for Quasi-static Manipulation Tasks
In this work, we explore how conventional motion planning algorithms can be reapplied to contact-rich manipulation tasks. Rather than focusing solely on efficiency, we investigate how manipulation aspects can be recast in terms of conventional motion-planning algorithms. Conventional motion planners, such as Rapidly-Exploring Random Trees (RRT), typically compute collision-free paths in configuration space. However, in manipulation tasks, intentional contact is often necessary. For example, whe…