Tootfinder

Yesterday near Rossgundscharte, Allgäu High Alps
(Longest, most stunning & varied tour in a while, traversing Warmatsgundtal into Rappenalptal, Germany's southernmost valley — 21km, incl. 1450 hm grueling descent over loose gravel...)
#SilentSunday #LandscapePhotography

Famous @… is famous https://lwn.net/SubscriberLink/1030821/6a54291db0975d91/

Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles
Liding Zhang, Zhenshan Bing, Yu Zhang, Kuanqi Cai, Lingyun Chen, Fan Wu, Sami Haddadin, Alois Knoll
https://arxiv.org/abs/2508.19771

Elliptical K-Nearest Neighbors -- Path Optimization via Coulomb's Law and Invalid Vertices in C-space Obstacles
Path planning has long been an important and active research area in robotics. To address challenges in high-dimensional motion planning, this study introduces the Force Direction Informed Trees (FDIT*), a sampling-based planner designed to enhance speed and cost-effectiveness in pathfinding. FDIT* builds upon the state-of-the-art informed sampling planner, the Effort Informed Trees (EIT*), by capitalizing on often-overlooked information in invalid vertices. It incorporates principles of physic…

Parallel athermal quasistatic deformation stepping of molecular systems
Maximilian Reihn, Franz Bamer, Benjamin Stamm
https://arxiv.org/abs/2507.20802 https://

Parallel athermal quasistatic deformation stepping of molecular systems
The athermal quasistatic deformation method provides an elegant solution to overcome the limitation of short time spans in molecular simulations. It provides overdamped conditions, allowing for the extraction of purely structural responses in the absence of thermal vibration. However, it requires computationally expensive sequences of affine deformation followed by minimization of the potential energy to incrementally find the path in the potential energy landscape that corresponds to the corre…

Handing AI the keys
"if we continue on the current path ... we are basically playing Russian roulette with humanity"
-- Grace Huckins, MIT Technology Review
On May 6, 2010, at 2:32 p.m. Eastern time nearly a trillion dollars evaporated from the
US stock market within 20 minutes
-at the time, the fastest decline in history
Then. almost as suddenly, the market rebounded.
After months of investigation, regalators attributed much of the respon…

Temperature-Aware Recurrent Neural Operator for Temperature-Dependent Anisotropic Plasticity in HCP Materials
Yannick Hollenweger, Dennis M. Kochman, Burigede Liu
https://arxiv.org/abs/2508.18806

Temperature-Aware Recurrent Neural Operator for Temperature-Dependent Anisotropic Plasticity in HCP Materials
Neural network surrogate models for constitutive laws in computational mechanics have been in use for some time. In plasticity, these models often rely on gated recurrent units (GRUs) or long short-term memory (LSTM) cells, which excel at capturing path-dependent phenomena. However, they suffer from long training times and time-resolution-dependent predictions that extrapolate poorly. Moreover, most existing surrogates for macro- or mesoscopic plasticity handle only relatively simple material b…

Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization
Liding Zhang, Yao Ling, Zhenshan Bing, Fan Wu, Sami Haddadin, Alois Knoll
https://arxiv.org/abs/2508.19776

Tree-Based Grafting Approach for Bidirectional Motion Planning with Local Subsets Optimization
Bidirectional motion planning often reduces planning time compared to its unidirectional counterparts. It requires connecting the forward and reverse search trees to form a continuous path. However, this process could fail and restart the asymmetric bidirectional search due to the limitations of lazy-reverse search. To address this challenge, we propose Greedy GuILD Grafting Trees (G3T*), a novel path planner that grafts invalid edge connections at both ends to re-establish tree-based connectiv…

In Hungary, the government has passed legislation limiting the rights of LGBTQ people and dual nationals.
The Hungarian news site Telex reports that the Fidesz majority in the National Assembly approved the 15th amendment to the Constitution by 140 votes to 21. 
Nepszava, a leading social-democratic daily in Hungary, headlines with comments from the Hungarian Helsinki Committee.
The human rights organisation says the amendment aims to "sow fear and divide society&quot…

Press Review - 'Sow fear and divide society': Papers react to Hungary's anti-LGBTQ amendment
PRESS REVIEW – Tuesday, April 15: The press are marking the two-year anniversary of the deadly civil war in Sudan. Also, papers in Hungary react to an amendment limiting the rights of LGBTQ people and dual nationals. Next, two teenagers are arrested in Kenya for attempting to smuggle 5,000 ants out of the country. Finally, Catalan architect Gaudi gets holy recognition on his path to becoming a saint.

And here are the last two #photos from my bike&hike recently. the one shows one of the (in my point of view) interesting geological parts of the hike. And in the second I tried to get some more foreground into the photo
I hope you enjoy the view as much as I enjoyed the hike up there 🙂
And I wonder if we could see the home area of @…

I got this bug report on Friday.
"According to POSIX, the time.h header must declare pid_t as declared in sys/types.h."
This morning, CI is finally happy with the patch series:
19 patches. 21 files changed, 1964 insertions( ), 993 deletions(-)
And I got to learn all about the 'getdate' function. Sometimes I feel like bringing light to the darker corners of the POSIX spec may not always be the wisest path.

time.h header fixes, strptime bug fixes and getdate/getdate_r implementation by keith-packard · Pull Request #1079 · picolibc/picolibc
Reviewing the time.h header uncovered some missing declarations, a couple of unimplemented functions and bugs in the existing strptime implementation. Closes: #1078

Summer solstice 2025
Short (5km), but absolutely stunning hike with my son to make the most of the solstice evening, with some grand views, sunset, radler and an adventurous T3 path along a steep 400m cliff drop-off... Back at the trailhead after 10pm, still not dark. Summer evenings...
#SilentSunday

A profile of Figma CEO Dylan Field, a former Thiel fellow whose Figma stake is worth ~$6.6B after the company ended its NYSE debut week with a $71B market cap (Jordan Novet/CNBC)
https://www.cnbc.com/2025/08/03/figma-ceo-dylan-fields-path…

Figma CEO's path from college dropout and Thiel fellow to tech billionaire
After Figma's first two days of trading on the NYSE, 33-year-old CEO Dylan Field owns a stake worth about $6.6 billion.

APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors
Liding Zhang, Sicheng Wang, Kuanqi Cai, Zhenshan Bing, Fan Wu, Chaoqun Wang, Sami Haddadin, Alois Knoll
https://arxiv.org/abs/2508.19790

APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors
Optimal path planning aims to determine a sequence of states from a start to a goal while accounting for planning objectives. Popular methods often integrate fixed batch sizes and neglect information on obstacles, which is not problem-specific. This study introduces Adaptively Prolated Trees (APT*), a novel sampling-based motion planner that extends based on Force Direction Informed Trees (FDIT*), integrating adaptive batch-sizing and elliptical $r$-nearest neighbor modules to dynamically modul…

From David Suzuki
Our current economic path leads to disaster
An economic approach that rewards waste, greed and endless growth isn’t compatible with today’s reality. But as some cling to this destructive, outdated, fossil-fuelled system in their pursuit of greater wealth and power, others are experimenting with better ways.
We invent economic systems to facilitate production and distribution of goods, services and wealth, and to maintain societal stability.
...

@… アカウントの方のハッシュタグで、その人の投稿だけハッシュタグで絞り込めるんだけど、その時、unlistedもprivateも表示するんすよ。
こういうやつ。

@… Bah. Try setting `LD_LIBRARY_PATH` too?
Don’t forget to preserve the existing one. Something like:
export LD_LIBRARY_PATH=“${pkg}:$LD_LIBRARY_PATH”

Compressing Suffix Trees by Path Decompositions
Ruben Becker, Davide Cenzato, Travis Gagie, Sung-Hwan Kim, Ragnar Groot Koerkamp, Giovanni Manzini, Nicola Prezza
https://arxiv.org/abs/2506.14734

Compressing Suffix Trees by Path Decompositions
In classic suffix trees, path compression works by replacing unary suffix trie paths with pairs of pointers to $T$, which must be available in the form of some random access oracle at query time. In this paper, we revisit path compression and show that a more careful choice of pointers leads to a new elegant, simple, and remarkably efficient way to compress the suffix tree. We begin by observing that an alternative way to path-compress the suffix trie of $T$ is to decompose it into a set of (di…

Sure, bombing Iran is the best path to peace :blobfox_w_:

from my link log —
Why does Windows use backslash as its path separator?
https://www.os2museum.com/wp/why-does-windows-really-use-backslash-as-path-separator/
saved 2024-04-25

To be effective a boobytrap needs to be laid in a location frequented by the enemy.
These raccoons are super predictable, you can see a path they've worn into the grass

[Intro]
Where are we going from here?
Where do we go?
Are we all blinded by fear?
Where do we go? How do we know?
Need for survival is clear
We persevere without an end
Into forever, we fall
And wander on and on and on
[Verse 1]
Dust of a thousand years thrown on your path
And in the aftermath, you'll stumble forward
Mouth full of air resuscitating life
And you'll ascend and carry on and on

Spanning path-cycle systems with given end-vertices in regular graphs (full version)
Yoshimi Egawa, Mikio Kano, Kenta Ozeki
https://arxiv.org/abs/2508.11302 https://

Spanning path-cycle systems with given end-vertices in regular graphs (full version)
We prove the following theorem. Let $r\ge 4$ be an integer, and $G$ be a $K_{1,r}$-free $r$-edge-connected $r$-regular graph. Then, for every set $W$ of even number of vertices of $G$ such that the distance between any two vertices of $W$ in $G$ is at least 3, $G$ has vertex-disjoint paths and cycles $P_1, \ldots, P_m, C_1, \ldots, C_n$ such that (i) $V(G)=V(P_1) \cup \cdots \cup V(P_m) \cup V(C_1) \cup \cdots \cup V(C_n)$, (ii) each path $P_i$ connects two vertices of $W$, and (iii) the set of…

Convergent perturbative series via finite path integral limits: application to energy at strong coupling of the anharmonic oscillator
Ariel Edery
https://arxiv.org/abs/2507.08782 …

Convergent perturbative series via finite path integral limits: application to energy at strong coupling of the anharmonic oscillator
Solving quantum field theories at strong coupling remains a challenging task. The main issue is that the usual perturbative series are asymptotic series which can be useful at weak coupling but break down completely at strong coupling. In this work, we show that if the limits of integration in the path integral are finite, the perturbative series is remarkably an absolutely convergent series which works well at strong coupling. For now, we apply this perturbative approach to $λ\,ϕ^4$ theory i…

the City just put in Stage 1 restrictions (we're very lucky here that we have abundant water resources, many places on Vancouver Island have restrictions almost immediately every summer)
So the clock is ticking! If we get to Stage 2 and I haven't filled the pond yet, I'll be prohibited from doing so until the rains come! We can only "top up" pools and ponds in Stage 2. And (god forbid) we get into Stage 3 or 4, the pond will have to be left to dry up. (at which point I would probably just use it as a watering source for the gardens)
I don't think we've ever reached Stage 3. The last time we got to Stage 2 was about 5 years ago I think, after the Heat Dome.
I would be surprised if we got to Stage 2 this year. It has been dry, but not excessively hot, so hopefully our resources can hold through August.
The good news is... I'm close to at least filling the intake bay and wetland filter.
Once the rest of the rock/pebble comes tomorrow I'll immediately start moving the rock into those two holes as quickly as I can, and once done, I'll start filling them with water so I can test out the pumps.
I might set up a temporary path for the water to recirculate through the intake bay and filter, avoiding the pond. That way those two parts can start to grow good-bacteria for the filter while I work on the big pond.
#pondlife #poolpond #backyardPrpject #diy #rock #labour

Deterministic Control of Photon-Number Probabilities via Phase-Controlled Quantum Interference
Sang Kyu Kim, Eduardo Zubizarreta Casalengua, Yeji Sim, Friedrich Sbresny, Carolin Calcagno, Hubert Riedl, Jonathan J. Finley, Elena del Valle, Carlos Ant\'on-Solanas, Kai M\"uller, Lukas Hanschke
https://arxiv.org/abs/2508.15352

Deterministic Control of Photon-Number Probabilities via Phase-Controlled Quantum Interference
Deterministically tailoring optical Fock states beyond the single-photon level is crucial for boson sampling, loss-tolerant photonic qubits, and quantum-enhanced sensing, however has yet remained elusive. Here, we report an all-linear-optical protocol that converts a resonantly driven single-photon emitter into a deterministic generator of vacuum--single-photon--two-photon states. A phase-stabilized, path-unbalanced Mach-Zehnder interferometer combines vacuum--single-photon interference and Hon…

Yes, yes, yes, yes, @…! 👏
“For now, I’m planning on continuing to roll up my sleeves. I want to make things because I’m human and alive. I want to go on journeys and grow. I’m not always looking for an easy path, I want the friction. Because if I give up the journey, what am I really making? What do I actually learn?”

Wooo, Jellyfin cache and metadata directories moved over to the slow storage via NFS. Not too much of a performance difference, but this will ensure that if I lose the VM then I won't lose the library.
#jellyfin #nfs

Replaced article(s) found for cs.RO. https://arxiv.org/list/cs.RO/new
[2/2]:
- Integration of a Graph-Based Path Planner and Mixed-Integer MPC for Robot Navigation in Cluttered...
Joshua A. Robbins, Stephen J. Harnett, Andrew F. Thompson, Sean Brennan, Herschel C. Pangborn

The Relentless Raider: Dylan Laube’s Path To The Raiders 53-Man Roster https://raiderramble.com/2025/08/11/the-relentless-raider-dylan-laubes-path-to-the-raiders-53-man-roster/

Active RISs: Modeling and Optimization
Recep Akif Tasci, Panagiotis Gavriilidis, Ertugrul Basar, George C. Alexandropoulos
https://arxiv.org/abs/2507.16499 https://

Active RISs: Modeling and Optimization
Reconfigurable Intelligent Surfaces (RIS)-empowered communication has emerged as a transformative technology for next generation wireless networks, enabling the programmable shaping of the propagation environment. However, conventional RISs are fundamentally limited by the double path loss effect, which severely attenuates the reflected signals. To overcome this, active RIS architectures, capable of amplifying impinging signals, have been proposed. This chapter investigates the modeling, perfor…

PathDB: A system for evaluating regular path queries
Roberto Garc\'ia, Renzo Angles, Vicente Rojas, Sebasti\'an Ferrada
https://arxiv.org/abs/2507.01755

PathDB: A system for evaluating regular path queries
PathDB is a Java-based graph database designed for in-memory data loading and querying. By utilizing Regular Path Queries (RPQ) and a closed path algebra, PathDB processes paths through its three main components: the parser, the logical plan, and the physical plan. This modular design allows for targeted optimizations and modifications without impacting overall functionality. Benchmark experiments illustrate PathDB's execution times and flexibility in handling dynamic and complex path queries, …

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
Stephan Sturm
https://arxiv.org/abs/2506.01815

Path Signatures for Feature Extraction. An Introduction to the Mathematics Underpinning an Efficient Machine Learning Technique
We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams. The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual character without plunging into the technical details of rigorous proofs. These notes are based on an introductory presentation given to students of the Research Experience for Undergraduates in Industrial Mathematics and Statistics at Worcester Polytechnic …

It won't be an easy path. I think maybe they should consider merger with the Greens and an electoral alliance with PC. Maybe later
MP Zarah Sultana resigns from Labour to co-found a new party with Corbyn | Jeremy Corbyn | The Guardian
https://www.…

How Broncos' Dondrea Tillman found 'light at the end of the tunnel' in uncommon NFL path https://www.nytimes.com/athletic/6466035/2025/07/03/dondrea-tillman-broncos-ufl-spring-league/

Computing Path Signature Varieties in Macaulay2
Carlos Am\'endola, Angelo El Saliby, Felix Lotter, Oriol Reig Fit\'e
https://arxiv.org/abs/2506.01429

Computing Path Signature Varieties in Macaulay2
The signature of a path is a non-commutative power series whose coefficients are given by certain iterated integrals over the path coordinates. This series almost uniquely characterizes the path up to translation and reparameterization. Taking only fixed degree parts of these series yields signature tensors. We introduce the Macaulay2 package $\texttt{PathSignatures}$ to simplify the study of these interesting objects for piecewise polynomial paths. It allows for the creation and manipulation o…

More than any time in history, mankind now faces a crossroads. One path
leads to despair and utter hopelessness, the other to total extinction.
Let us pray that we have the wisdom to choose correctly.
-- Woody Allen, "Side Effects"

Quantum Monte Carlo simulation of light and superlight bipolarons in extended Hubbard-Holstein models on face- and body-centered-cubic lattices
G. D. Adebanjo, J. P. Hague, P. E. Kornilovitch
https://arxiv.org/abs/2507.17398

Quantum Monte Carlo simulation of light and superlight bipolarons in extended Hubbard-Holstein models on face- and body-centered-cubic lattices
Superlight pairing of bipolarons driven by electron-phonon interactions (EPIs) in face-center-cubic (FCC) and body-center-cubic (BCC) lattices is investigated using a continuous-time path-integral quantum Monte Carlo (QMC) algorithm. The EPIs are of the Holstein and extended Holstein types, and a Hubbard interaction is also included. The number of phonons associated with the bipolaron, inverse mass, and radius are calculated and used to construct a phase diagram for bipolaron pairing (identifyi…

Ball path curvature and in-game free throw shooting proficiency in the National Basketball Association
Ruoqian Zhu, Dave Love, Scott Powers
https://arxiv.org/abs/2506.13779

Ball path curvature and in-game free throw shooting proficiency in the National Basketball Association
Basketball shooting coaches agree that smoother shooting motions are better, but there is less agreement about what "smooth" means quantitatively or what part of the shooting motion needs to be smooth. Using ball tracking data from the 2023-2024 National Basketball Association regular season, we explore the relationship between ball path curvature and free throw shooting performance. We fit Bézier curves to the ball tracking data in the sagittal plane and test different methods of calculating …

Efficient task and path planning for maintenance automation using a robot system
Christian Friedrich, Akos Csiszar, Armin Lechler, Alexander Verl
https://arxiv.org/abs/2508.18400

Efficient task and path planning for maintenance automation using a robot system
The research and development of intelligent automation solutions is a ground-breaking point for the factory of the future. A promising and challenging mission is the use of autonomous robot systems to automate tasks in the field of maintenance. For this purpose, the robot system must be able to plan autonomously the different manipulation tasks and the corresponding paths. Basic requirements are the development of algorithms with a low computational complexity and the possibility to deal with e…

Is Extending Modality The Right Path Towards Omni-Modality?
Tinghui Zhu, Kai Zhang, Muhao Chen, Yu Su
https://arxiv.org/abs/2506.01872 https://

Is Extending Modality The Right Path Towards Omni-Modality?
Omni-modal language models (OLMs) aim to integrate and reason over diverse input modalities--such as text, images, video, and audio--while maintaining strong language capabilities. Despite recent advancements, existing models, especially open-source ones, remain far from true omni-modality, struggling to generalize beyond the specific modality pairs they are trained on or to achieve strong performance when processing multi-modal inputs. We study the effect of extending modality, the dominant te…

2025 Cowboys game-by-game predictions: Is there a path to playoffs for Dallas? https://www.foxsports.com/stories/nfl/predicting-cowboys-2025-season-game-by-game

This https://arxiv.org/abs/2405.04860 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

Quantum Concolic Testing
This paper presents the first concolic testing framework explicitly designed for quantum programs. The framework introduces quantum constraint generation methods for quantum control statements that quantify quantum states and offers a symbolization method for quantum variables. Based on this framework, we generate path constraints for each concrete execution path of a quantum program. These constraints guide the exploration of new paths, with a quantum constraint solver determining outcomes to …

This https://arxiv.org/abs/2412.09433 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCC_…

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

A constant with #metrolinx is
1-they don’t seem to have deadlines. A culture based on having no deadlines goes against every project management principles
2. They can never answer you about what’s happening and what’s taking so long. You don’t have anyone to pressure to get answers
That’s what make Metrolinx much more undemocratic than the TTC.

Transition Path Theory For L\'{e}vy-Type Processes: SDE Representation and Statistics
Yuanfei Huang, Xiang Zhou
https://arxiv.org/abs/2506.09462 https:…

Transition Path Theory For Lévy-Type Processes: SDE Representation and Statistics
This paper establishes a Transition Path Theory (TPT) for Lévy-type processes, addressing a critical gap in the study of the transition mechanism between meta-stabile states in non-Gaussian stochastic systems. A key contribution is the rigorous derivation of the stochastic differential equation (SDE) representation for transition path processes, which share the same distributional properties as transition trajectories, along with a proof of its well-posedness. This result provides a solid theo…

Ukraine's Constitutional Court appointments: A test of EU commitment: https://benborges.xyz/2025/07/02/ukraines-constitutional-court-appointments-a.html

Nothing shows how out of shape you are as much as cycling in a new city, and the 38% grade of a path near where I'm staying doesn't help.

ProVeg: A Plant-Rich Diet Plays a Crucial Role on the Path to Greater Food Security https://vegconomist.com/society/proveg-plant-rich-diet-crucial-role-greater-food-security/

ProVeg: A Plant-Rich Diet Plays a Crucial Role on the Path to Greater Food Security - vegconomist - the vegan business magazine
The Food and Agriculture Organization of the United Nations (FAO) today released its annual report, outlining global progress towards eliminating hunger and

Path to an exact WKB analysis of black hole quasinormal modes: #BlackHole vibes: https://www.kyoto-u.ac.jp/en/research-news/2025-07-31

Park Discovery 🏞️
公园探险 🏞️
📷 Nikon FE
🎞️Lucky SHD 400
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

xAI apologizes for Grok's "horrific behavior" when it wrote antisemitic posts on July 8, and blames "an update to a code path upstream of the Grok bot" (Anthony Ha/TechCrunch)
https://techcrunch.com/2025/07/12/xai-and-grok-apologize-for…

xAI and Grok apologize for ‘horrific behavior’ | TechCrunch
In a series of posts on X, the AI chatbot Grok apologized for what it admitted was “horrific behavior.” The posts appear to be an official statement from xAI, the Elon Musk-led company behind Grok, as opposed to an AI-generated explanation for Grok’s posts. (xAI recently acquired X, where Grok is prominently featured.)

This https://arxiv.org/abs/2302.11997 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Beamforming Design with Partial Channel Estimation and Feedback for FDD RIS-Assisted Systems
Beamforming design with partial channel estimation and feedback for frequency-division duplexing (FDD) reconfigurable intelligent surface (RIS) assisted systems is considered in this paper. We leverage the observation that path angle information (PAI) varies more slowly than path gain information (PGI). Then, several dominant paths are selected among all the cascaded paths according to the known PAI for maximizing the spectral efficiency of downlink data transmission. To acquire the dominating …

Trees whose path ideals have linear quotients
Trung Chau, Kanoy Kumar Das, Animikha Dutta Dhar, Pranath S Karanth, Aniruda Suswaram
https://arxiv.org/abs/2506.06209

Trees whose path ideals have linear quotients
For any integer $n$, we classify all trees whose $n$-path ideals have linear quotients.

A Path Planning Model for Intercepting a Moving Target with Finite Obstacle Avoidance
Masuda Akter, Mohammed Mustafa Rizvi
https://arxiv.org/abs/2507.01447

A Path Planning Model for Intercepting a Moving Target with Finite Obstacle Avoidance
This paper investigates the problem of computing a two-dimensional optimal curvature straight line (CS) shortest path for an unmanned aerial vehicle (UAV) to intercept a moving target, with both the UAV (pursuer) and target travelling at constant speeds. We formulate an optimal control problem that integrates two critical objectives: avoiding static obstacles and successfully intercepting the target. The approach introduces constraints derived from obstacle avoidance and target interception req…

Cascadilla Gorge,
Ithaca NY
Aug 2025

Point upsampling networks for single-photon sensing
Jinyi Liu, Guoyang Zhao, Lijun Liu, Yiguang Hong, Weiping Zhang, Shuming Cheng
https://arxiv.org/abs/2508.12986 https://

Point upsampling networks for single-photon sensing
Single-photon sensing has generated great interest as a prominent technique of long-distance and ultra-sensitive imaging, however, it tends to yield sparse and spatially biased point clouds, thus limiting its practical utility. In this work, we propose using point upsampling networks to increase point density and reduce spatial distortion in single-photon point cloud. Particularly, our network is built on the state space model which integrates a multi-path scanning mechanism to enrich spatial c…

An Introductory Survey of Recursions in the Computation of Resistance Distance
Emily J. Evans, Russell Jay Hendel
https://arxiv.org/abs/2506.12048 https://…

An Introductory Survey of Recursions in the Computation of Resistance Distance
This paper presents an introduction and expository account of a beautiful, current, and active application of recursions to the computation of resistance distance. Resistance distance, also referred to as effective resistance, is a well-known graph metric that arises naturally by considering a graph as an electrical circuit; heuristically resistance distance measures both the number of paths between two vertices in a graph and the cost of each path. This topic finds applications in a rich array…

Automating Multi-Tenancy Performance Evaluation on Edge Compute Nodes
Joanna Georgiou, Moysis Symeonides, George Pallis, Marios D. Dikaiakos
https://arxiv.org/abs/2506.10461

Automating Multi-Tenancy Performance Evaluation on Edge Compute Nodes
Edge Computing emerges as a promising alternative of Cloud Computing, with scalable compute resources and services deployed in the path between IoT devices and Cloud. Since virtualization techniques can be applied on Edge compute nodes, administrators can share their Edge infrastructures among multiple users, providing the so-called multi-tenancy. Even though multi-tenancy is unavoidable, it raises concerns about security and performance degradation due to resource contention in Edge Computing.…

Neural Networks for Parameter Estimation of the Discretely Observed Hawkes Process
Jason J. Lambe, Feng Chen, Tom Stindl, Tsz-Kit Jeffrey Kwan
https://arxiv.org/abs/2506.01258

Neural Networks for Parameter Estimation of the Discretely Observed Hawkes Process
When the sample path of a Hawkes process is observed discretely, such that only the total event counts in disjoint time intervals are known, the likelihood function becomes intractable. To overcome the challenge of likelihood-based inference in this setting, we propose to use a likelihood-free approach to parameter estimation, where a fully connected neural network (NN) is trained using simulated data to estimate the parameters of the Hawkes process from a summary statistic of the count data. A…

On polynomial inequalities for cone-volumes of polytopes
Tom Baumbach, Martin Henk
https://arxiv.org/abs/2506.15370 https://arxiv.org…

On polynomial inequalities for cone-volumes of polytopes
Motivated by the discrete logarithmic Minkowski problem we study for a given matrix $U\in\mathbb{R}^{n\times m}$ its cone-volume set $C_{\tt cv}(U)$ consisting of all the cone-volume vectors of polytopes $P(U,b)=\{ x\in\mathbb{R}^n : U^\intercal x\leq b\}$, $b\in\mathbb{R}^n_{\geq 0}$. We will show that $C_{\tt cv}(U)$ is a path-connected semialgebraic set which extends former results in the planar case or for particular polytopes. Moreover, we define a subspace concentration polytope $P_{\tt s…

from my link log —
Postgres extensions in Rust.
https://depth-first.com/articles/2021/08/25/postgres-extensions-in-rust/
saved 2021-08-29

Postgres Extensions in Rust
Opening a new path to high-performance, domain-specific database applications.

Parallel Complexity of Depth-First-Search and Maximal path
Archit Chauhan, Samir Datta, M. Praveen
https://arxiv.org/abs/2506.14974 https://

Parallel Complexity of Depth-First-Search and Maximal path
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. In contrast, randomized parallel algorithms (and more recently, deterministic quasipolynomial parallel algorithms) are known for constructing a DFS tree in general (di)graphs. However a deterministic parallel algorithm for DFS in general graphs remains an elusive goal. Working towards this, a series of works gave deter…

Trivial Monodromy without Separation: A Non-Hausdorff Counterexample in Covering Theory
Abhiram Sripat
https://arxiv.org/abs/2506.00031 https://

Trivial Monodromy without Separation: A Non-Hausdorff Counterexample in Covering Theory
We present a concrete topological construction, a non-Hausdorff, locally Euclidean space with multiple origins, that behaves unexpectedly well under path-lifting. Despite lacking the Hausdorff property, the space remains second-countable, T1, and path-connected, yet its fundamental group sees only trivial monodromy. This violates intuitive expectations from classical covering theory and invites a systematic rethinking of how separation axioms interact with lifting properties. We offer this spac…

This https://arxiv.org/abs/2412.11283 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Cyclic polytopes through the lens of iterated integrals
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial automorphisms of the polytope. Motivated by this observation, we look for other linear combinations of iterated integrals that are invariant under the subgroup action. This yields interesting polynomial attributes of the cyclic polytope. We prove that there a…

Observation and Modeling of Small Spatial Structures of Solar Radio Noise Storms using the uGMRT
Surajit Mondal, Peijin Zhang, Devojyoti Kansabanik, Divya Oberoi, Gillian Pearce
https://arxiv.org/abs/2507.08093

Observation and Modeling of Small Spatial Structures of Solar Radio Noise Storms using the uGMRT
One of the most commonly observed solar radio sources in the metric and decametric wavelengths is the solar noise storm. These are generally associated with active regions and are believed to be powered by the plasma emission mechanism. Since plasma emission emits primarily at the fundamental and harmonic of the local plasma frequency, it is significantly affected by density inhomogeneities in the solar corona. The source can become significantly scatter-broadened due to the multi-path propagat…

I took this #photo when I thought that I'd be almost there. - Because I had mostly looked about the elevation. But as you might see on the photo, the way flattens a bit towards the summit.
Well, it was a great trail - it just took longer then I assumed.
Some more context and a video are on my blog:

QUIC Delay Control: an implementation of congestion and delay control
Saverio Mascolo, Andrea Vittorio Balillo, Gioacchino Manfredi, Davide D'Agostino, Luca De Cicco
https://arxiv.org/abs/2507.00896

QUIC Delay Control: an implementation of congestion and delay control
A new congestion and delay control algorithm named QUIC Delay Control (QUIC-DC) is proposed for controlling not only congestion but also the queuing delay encountered along the forward communication path. The core idea is to estimate the one-way queuing delay of a connection to trigger an early reaction to congestion. This idea, along with the TCP Westwood+ congestion control algorithm, has been implemented in QUIC-DC and compared with QUIC Cubic, BBRv2, NewReno, Westwood+. The results obtained…

Asymmetric-gate Mach--Zehnder interferometry in graphene: Multi-path conductance oscillations and visibility characteristics
Taegeun Song, Nojoon Myoung
https://arxiv.org/abs/2508.07380

Asymmetric-gate Mach--Zehnder interferometry in graphene: Multi-path conductance oscillations and visibility characteristics
Graphene provides an excellent platform for investigating electron quantum interference due to its outstanding coherent properties. In the quantum Hall regime, Mach--Zehnder (MZ) electronic interferometers are realized using p--n junctions in graphene, where electron interference is highly protected against decoherence. In this work, we present a phenomenological framework for graphene-based MZ interferometry with asymmetric p--n junction configurations. We show that the enclosed interferometer…

Neural Path Guiding with Distribution Factorization
Pedro Figueiredo, Qihao He, Nima Khademi Kalantari
https://arxiv.org/abs/2506.00839 https://

Neural Path Guiding with Distribution Factorization
In this paper, we present a neural path guiding method to aid with Monte Carlo (MC) integration in rendering. Existing neural methods utilize distribution representations that are either fast or expressive, but not both. We propose a simple, but effective, representation that is sufficiently expressive and reasonably fast. Specifically, we break down the 2D distribution over the directional domain into two 1D probability distribution functions (PDF). We propose to model each 1D PDF using a neur…

@… engineers call it the happy path, as I'm sure you know. Hope, but enforce!

This https://arxiv.org/abs/2504.19605 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

A Comparative Study on Positional Encoding for Time-frequency Domain Dual-path Transformer-based Source Separation Models
In this study, we investigate the impact of positional encoding (PE) on source separation performance and the generalization ability to long sequences (length extrapolation) in Transformer-based time-frequency (TF) domain dual-path models. The length extrapolation capability in TF-domain dual-path models is a crucial factor, as it affects not only their performance on long-duration inputs but also their generalizability to signals with unseen sampling rates. While PE is known to significantly i…

Front propagation on a general metric graph
Hiroshi Matano, Shuichi Jimbo
https://arxiv.org/abs/2505.24418 https://arxiv.org/pdf/2505…

Front propagation on a general metric graph
We consider a bistable reaction-diffusion equation on a metric graph that is a generalization of the so-called star graphs. More precisely, our graph $Ω$ consists of a bounded finite metric graph $D$ of arbitrary configuration and a finite number of branches $Ω_1,\ldots,Ω_N\,(N\geq 2)$ of infinite length emanating from some of the vertices of $D$. Each $Ω_i\,(i=1,\ldots,N)$ is called an ``outer path''. Our goal is to investigate the behavior of the front coming from infinity along a given o…

Urban Composition III 🫟
都市构图 III 🫟
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

Seeing smoke from the #GiffordFire down in Santa Barbara
https://share.watchduty.org/i/58187?ts=1754181161000

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks
Atsuyuki Miyai, Zaiying Zhao, Kazuki Egashira, Atsuki Sato, Tatsumi Sunada, Shota Onohara, Hiromasa Yamanishi, Mashiro Toyooka, Kunato Nishina, Ryoma Maeda, Kiyoharu Aizawa, Toshihiko Yamasaki
https://arxiv.org/abs/2506.01952

WebChoreArena: Evaluating Web Browsing Agents on Realistic Tedious Web Tasks
Powered by a large language model (LLM), a web browsing agent operates web browsers in a human-like manner and offers a highly transparent path toward automating a wide range of everyday tasks. As web agents become increasingly capable and demonstrate proficiency in general browsing tasks, a critical question emerges: Can they go beyond general browsing to robustly handle tasks that are tedious and complex, or chores that humans often avoid doing themselves? In this paper, we introduce WebChore…

Ah yes, MIPS Technologies.
https://mips.com/products/hardware/
The famous designer of MIPS (microprocessor without interlocked pipeline stages) architecture processors.
Such a well named company /s

IP Processors - MIPS
Products Forging a New Path for the AI Compute Era Billions of Units Shipped MIPS Sub-Systems – More than a Core A foundation of compute DNA built over decades with billions of units shipped Bring Your Own Accelerators Flexible Integration Coherent Through Coherence Manager Fabric or Connect Direct to CPU RISC-V Core RISC-V Multi-threading Custom […]

Equation of State and First Principles Prediction of the Vibrational Matrix Shift of Solid Parahydrogen
Alexander Ibrahim, Lecheng Wang, Tom Halverson, Robert J Le Roy, Pierre-Nicholas Roy
https://arxiv.org/abs/2506.01294

Equation of State and First Principles Prediction of the Vibrational Matrix Shift of Solid Parahydrogen
We generate the equation of state (EOS) of solid parahydrogen using a path-integral Monte Carlo (PIMC) simulation based on a highly accurate first-principles adiabatic hindered rotor (AHR) potential energy curve for the \para dimer. The EOS curves for the fcc and hcp structures of solid parahydrogen near the equilibrium density show that the hcp structure is the more stable of the two, in agreement with experiment. To accurately reproduce the structural and energy properties of solid parahydrog…

This https://arxiv.org/abs/2504.11711 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csSE_…

The Hitchhiker's Guide to Program Analysis, Part II: Deep Thoughts by LLMs
Static analysis plays a crucial role in software vulnerability detection, yet faces a persistent precision-scalability tradeoff. In large codebases like the Linux kernel, traditional static analysis tools often generate excessive false positives due to simplified vulnerability modeling and overapproximation of path and data constraints. While large language models (LLMs) demonstrate promising code understanding capabilities, their direct application to program analysis remains unreliable due to…

Trevon Diggs progressing well in recovery from 2024 injury: 'All signs are positive' https://www.dallascowboys.com/news/trevon-diggs-progressing-well-in-recovery-from-2024-injury-all-signs-are-positive…

Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
J. Lea\~nos, M. Lomel\'i-Haro, Christophe Ndjatchi, L. M. R\'ios-Castro
https://arxiv.org/abs/2506.00689

Mutual-visibility of the disjointness graph of segments in ${\mathbb R}^2$
Let $G=(V(G),E(G))$ be a simple graph, and let $U\subseteq V(G)$. Two distinct vertices $x,y\in U$ are $U$-mutually visible if $G$ contains a shortest $x$-$y$ path that is internally disjoint from $U$. $U$ is called a mutual-visibility set of $G$ if any two vertices of $U$ are $U$-mutually visible. The mutual-visibility number $μ(G)$ of $G$ is the size of a largest mutual-visibility set of $G$. Let $P$ be a set of $n\geq 3$ points in ${\mathbb R}^2$ in general position. The disjointness graph …

from my link log —
Bootstrapping HTTP/1.1, HTTP/2, and HTTP/3.
https://www.netmeister.org/blog/http-123.html
saved 2025-05-29 http…

Bootstrapping HTTP/1.1, HTTP/2, and HTTP/3
How do we get from HTTP/1.1 all the way to 11... I mean, to HTTP/3? Let's look at the path browsers take.

Launch pad.
(Not really, but that part of the Saalfelder Weg very much makes me feel like wanting to take off... Höhengefühle!)
#SilentSunday #LandscapePhotography #Photography

Martingales and Path-Dependent PDEs via Evolutionary Semigroups
Robert Denk, Markus Kunze, Michael Kupper
https://arxiv.org/abs/2507.01845 https://

Martingales and Path-Dependent PDEs via Evolutionary Semigroups
In this article, we develop a semigroup-theoretic framework for the analytic characterisation of martingales with path-dependent terminal conditions. Our main result establishes that a measurable adapted process of the form \[ V(t) - \int_0^tΨ(s)\, ds \] is a martingale with respect to an expectation operator $\mathbb{E}$ if and only if a time-shifted version of $V$ is a mild solution of a final value problem involving a path-dependent differential operator that is intrinsically connected to $…

Hey Google,
Now We Have This New Private, Offline Alternative:
A maps app that doesn't track you but lets you record your path on the map
https://news.itsfoss.com/comaps-launch/

Look Google, We Have This New Private, Offline Alternative Now
A maps app that doesn't track you but lets you track your path on the map. A pathbreaking open source alternative.

Trevon Diggs progressing well in recovery from 2024 injury: 'All signs are positive' https://www.dallascowboys.com/news/trevon-diggs-progressing-well-in-recovery-from-2024-injury-all-signs-are-positive…

Low-dispersion low free-spectral-range Mach-Zehnder interferometer with long straight path lengths on silicon
Cael Warner
https://arxiv.org/abs/2507.01114 …

Low-dispersion low free-spectral-range Mach-Zehnder interferometer with long straight path lengths on silicon
Multiple Mach-Zehnder interferometers are constructed using fiber-Bragg grating couplers, y-branches, silicon waveguides, and/or broadband splitters in silicon on insulator strip waveguides to test the effect of variation in waveguide length between consecutive bends on the transmission gain spectrum, free-spectral range, group refractive index, and dispersion. Dispersion is mitigated by increasing the path length between consecutive bends of minimum radius. With long linear waveguide sections,…

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
Massimiliano Gubinelli, Guopeng Li, Jiawei Li, Tadahiro Oh
https://arxiv.org/abs/2505.24270

Nonlinear PDEs with modulated dispersion IV: normal form approach and unconditional uniqueness
We study the modulated Korteweg-de~Vries equation (KdV) on the circle with a time non-homogeneous modulation acting on the linear dispersion term. By adapting the normal form approach to the modulated setting, we prove sharp unconditional uniqueness of solutions to the modulated KdV in $L^2(\mathbb T)$ if a modulation is sufficiently irregular. For example, this result implies that if the modulation is given by a sample path of a fractional Brownian motion with Hurst index $0 < H < \frac 25$, t…

This https://arxiv.org/abs/2505.24100 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Halfway to induced saturation for even cycles
For graphs $G$ and $H$, we say that $G$ is $H$-free if no induced subgraph of $G$ is isomorphic to $H$, and that $G$ is $H$-induced saturated if $G$ is $H$-free but removing or adding any edge in $G$ creates an induced copy of $H$. A full characterization of graphs $H$ for which $H$-induced saturated graphs exist remains elusive. Even the case where $H$ is a path -- now settled by the collective results of Martin and Smith, Bonamy et al., and Dvoŕǎk -- was already quite challenging. What if…

City Features IV 🌆
城市特征 IV 🌆
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1994
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Magnetocrystalline anisotropy of FeNi and FeCo along the Bain path
Nica Jane B. Ferrer, Gregory A. Fiete
https://arxiv.org/abs/2507.01120 https://

Magnetocrystalline anisotropy of FeNi and FeCo along the Bain path
We theoretically investigate magnetic anisotropy in materials with non-critical elements to determine which symmetry conditions and atomic shell filling favor enhanced magnetic anisotropy. We study the magnetocrystalline anisotropies (MCA) of the equiatomic ferrous compounds FeCo and FeNi using ab initio calculations and analytical approaches via the diatomic pair model. We find that when these materials undergo a Bain transformation, that is, the variation of the a and c lattice parameters adj…

This https://arxiv.org/abs/2402.10330 has been replaced.
initial toot: https://mastoxiv.page/@a…

Quantum dynamics of semiconductor quantum dot Josephson junctions
Josephson junctions constructed from superconductor-semiconductor-superconductor heterostructures have been used to realize a variety of voltage-tunable superconducting quantum devices, including qubits and parametric amplifiers. To date theoretical descriptions of these systems have been restricted to small quantum fluctuations of the junction phase, making them inapplicable to many experiments. In this work we relax this, employing a path-integral formulation where the phase quantum dynamics …

Needing more paths in more lives to be as beautiful as this...
(This hike & experiences further up touched me like not many others have...)
#SilentSunday #LandscapePhotography #Photography

Passage-traversing optimal path planning with sampling-based algorithms
Jing Huang, Hao Su, Kwok Wai Samuel Au
https://arxiv.org/abs/2506.23614 https://

Passage-traversing optimal path planning with sampling-based algorithms
This paper introduces a new paradigm of optimal path planning, i.e., passage-traversing optimal path planning (PTOPP), that optimizes paths' traversed passages for specified optimization objectives. In particular, PTOPP is utilized to find the path with optimal accessible free space along its entire length, which represents a basic requirement for paths in robotics. As passages are places where free space shrinks and becomes constrained, the core idea is to leverage the path's passage traversal…

This https://arxiv.org/abs/2411.01707 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction
We study Multi-Robot Coverage Path Planning (MCPP) on a 4-neighbor 2D grid G, which aims to compute paths for multiple robots to cover all cells of G. Traditional approaches are limited as they first compute coverage trees on a quadrant coarsened grid H and then employ the Spanning Tree Coverage (STC) paradigm to generate paths on G, making them inapplicable to grids with partially obstructed 2x2 blocks. To address this limitation, we reformulate the problem directly on G, revolutionizing grid-…

Reinforcement-Learning-Designed Field-Free Sub-Nanosecond Spin-Orbit-Torque Switching
Yuta Igarashi, Junji Fujimoto
https://arxiv.org/abs/2508.10792 https://

Reinforcement-Learning-Designed Field-Free Sub-Nanosecond Spin-Orbit-Torque Switching
We demonstrate deterministic, field-free magnetization reversal of a single-domain nanomagnet within 300 ps under a current density of $3 \times 10^{10}~\mathrm{A/m^2}$ by coupling reinforcement learning (RL) to the Landau-Lifshitz-Gilbert equation with the spin-orbit torques (SOTs). The RL agent autonomously discovers a current waveform that minimizes the magnetization trajectory path and exploits a precessional shortcut enabled by the field-like SOT and hard-axis anisotropy. From the learned …

Natura Urbana VIII 🏡
城市自然 VIII 🏡
📷 Nikon FE
🎞️Ilford FP4 Plus, expired 1995
buy me ☕️ ?/请我喝杯☕️？
#filmphotography

Yiding Cao Geld mit PayPal.Me senden
Folgen Sie dem Link PayPal.Me/dingsterdingster und geben Sie den Betrag ein. Es ist bequem und sicher. Sie haben noch kein PayPal-Konto? Kein Problem.

On the Visibility Polynomial of Graphs
Tonny K B, Shikhi M
https://arxiv.org/abs/2507.01851 https://arxiv.org/pdf/2507.01851

On the Visibility Polynomial of Graphs
Let G(V,E) be a simple graph and let X subset of V. Two vertices u and v are said to be X-visible if there exists a shortest u,v-path P such that V(P) intersection X is a subset of {u, v}. A set X is called a mutual-visibility set of G if every pair of vertices in X are X-visible. The visibility polynomial of a graph G is defined as nu (G)=sum_{i >= 0} r_i x^i, where r_i denotes the number of mutual-visibility sets in G of cardinality i. In the present paper, the visibility polynomial is studie…

This https://arxiv.org/abs/2505.20455 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

HAND Me the Data: Fast Robot Adaptation via Hand Path Retrieval
We hand the community HAND, a simple and time-efficient method for teaching robots new manipulation tasks through human hand demonstrations. Instead of relying on task-specific robot demonstrations collected via teleoperation, HAND uses easy-to-provide hand demonstrations to retrieve relevant behaviors from task-agnostic robot play data. Using a visual tracking pipeline, HAND extracts the motion of the human hand from the hand demonstration and retrieves robot sub-trajectories in two stages: fi…

GPU-Accelerated Barrier-Rate Guided MPPI Control for Tractor-Trailer Systems
Keyvan Majd, Hardik Parwana, Bardh Hoxha, Steven Hong, Hideki Okamoto, Georgios Fainekos
https://arxiv.org/abs/2508.05773

GPU-Accelerated Barrier-Rate Guided MPPI Control for Tractor-Trailer Systems
Articulated vehicles such as tractor-trailers, yard trucks, and similar platforms must often reverse and maneuver in cluttered spaces where pedestrians are present. We present how Barrier-Rate guided Model Predictive Path Integral (BR-MPPI) control can solve navigation in such challenging environments. BR-MPPI embeds Control Barrier Function (CBF) constraints directly into the path-integral update. By steering the importance-sampling distribution toward collision-free, dynamically feasible traj…