Tootfinder

Enhancing Spatio-Temporal Resolution of Process-Based Life Cycle Analysis with Model-Based Systems Engineering \& Hetero-functional Graph Theory
Niraj Gohil, Nawshad Haque, Amgad Elgowainy, Amro M. Farid
https://arxiv.org/abs/2506.00230

Enhancing Spatio-Temporal Resolution of Process-Based Life Cycle Analysis with Model-Based Systems Engineering \& Hetero-functional Graph Theory
Life cycle analysis (LCA) has emerged as a vital tool for assessing the environmental impacts of products, processes, and systems throughout their entire lifecycle. It provides a systematic approach to quantifying resource consumption, emissions, and waste, enabling industries, researchers, and policymakers to identify hotspots for sustainability improvements. By providing a comprehensive assessment of systems, from raw material extraction to end-of-life disposal, LCA facilitates the developmen…

Graph Neural Networks to Predict Coercivity of Hard Magnetic Microstructures
Heisam Moustafa, Alexander Kovacs, Johann Fischbacher, Markus Gusenbauer, Qais Ali, Leoni Breth, Thomas Schrefl, Harald Oezelt
https://arxiv.org/abs/2506.23615

Graph Neural Networks to Predict Coercivity of Hard Magnetic Microstructures
Graph neural networks (GNN) are a promising tool to predict magnetic properties of large multi-grain structures, which can speed up the search for rare-earth free permanent magnets. In this paper, we use our magnetic simulation data to train a GNN to predict coercivity of hard magnetic microstructures. We evaluate the performance of the trained GNN and quantify its uncertainty. Subsequently, we reuse the GNN architecture for predicting the maximum energy product. Out-of-distribution predictions…

Vector-valued Graph Signal Processing
Antonio Caputo
https://arxiv.org/abs/2505.22325 https://arxiv.org/pdf/2505.22325

Vector-valued Graph Signal Processing
Classical graph signal processing (GSP) introduces methodologies for analyzing real or complex signals defined on graph domains, moving beyond classical uniform sampling techniques, such as the graph discrete Fourier transform (GDFT), employed as a pivotal tool for transforming graph signals into their spectral representation, enabling effective signal processing techniques such as filtering and denoising. In this paper, we propose a possible generalization of the set of signals and we study so…

I just released nugraph, a #dotnet tool for creating visual dependency graph of NuGet packages.
Installation:
dotnet tool install --global nugraph
Usage for a NuGet package:
nugraph Azure.Core
or for a .NET project:
nugraph ~/Projects/Kerberos.NET/Bruce/Bruce.csproj
Many options are available, everything is documented on https://github.com/0xced/nugraph
Enjoy!
Here's the kind of graph it generates (Azure.Core example).

https://mermaid.live/view#pako:eNqcVU2P2jAQ_StWViu1EjgBVqjNjS6raqXl0t6qXIwzSVwSO3UmAor4780HKF4wWdJcYux5z2_ezISDw1UIju-Mx-NAosAUfLKEHGQIku9JrFmeEBWRxd9SA31WGsiEPs3plHySgF-o9zmQDTaQj4_kO0jQDCEk6z1JEPPCd91YYFKuKVeZ6-04hK4sG9oa0_K__ajXPGVFsYSIaKWQFKjVBsZbEWLiP-U74zyEiJUpkkikqc_-lCxjWkgYtRD_wfO-evPJiKtUaf9h1jz1BV0Oh0O3Ph5Jpb_0vNkLWQmuVaEipN94ShfFXvJXiaAjxqEwCTrIz32BkNHnVIDEVWVm2hu3gkzpPV0yZIHsrnvZIchCKFnQNxXHQsZ0sa7yYRzrTZtCA9IV7FX-hgbyDh7Ia5UfUNpU9NPYEjwVzeyeuriW7VNN6xPBN-ZJTT-dnptpu93Sqn8AqdKxmzO-YTEUbhfvtu3Zok7gq-Ztt88yeqt-qaw_-C6xvRRuNVPUeye__0oj_jqhAU1yO9EhJAMNGEDdGDO9YcwQiQZPr2HWQbzHJCvw_42x0TVmzD42wyrFwJ4NsAz2RaaWiLtSusbVE3pRSAu5EXQh0vjC3BBpRgwRaeDceWXSxCbSJDeCAumMnAx0xkRY_Z8e2l1MIIN26bevs-Lmx7HC5Ez-UipzfNQlHP8BAAD__wMAEYyvHw

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Graph theory inspired anomaly detection at the LHC
Jack Y. Araz, Dimitrios Athanasakos, Mateusz Ploskon, Felix Ringer
https://arxiv.org/abs/2506.19920 http…

Graph theory inspired anomaly detection at the LHC
Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an unsupervised, model-agnostic tool for anomaly detection, using the LHC Olympics dataset as a benchmark. By representing jet constituents as a graph, we introduce a method to systematically control the information available to the model through sparse graph c…

Parameter Identifiability of Linear-Compartmental Mammillary Models
Katherine Clemens, Jonathan Martinez, Anne Shiu, Michaela Thompson, Benjamin Warren
https://arxiv.org/abs/2506.21889

Parameter Identifiability of Linear-Compartmental Mammillary Models
Linear compartmental models are a widely used tool for analyzing systems arising in biology, medicine, and more. In such settings, it is essential to know whether model parameters can be recovered from experimental data. This is the identifiability problem. For a class of linear compartmental models with one input and one output, namely, those for which the underlying graph is a bidirected tree, Bortner et al. completely characterized which such models are structurally identifiability, which me…

Esto se ve realmente interesante. Una herramienta que permite migrar cuentas entre activitypub y ATprotocol conservando publicaciones y seguidores. Y, según entiendo, también permite migrar entre plataformas del mismo protocolo. Habrš que ver qué tal va.
https://blog.anew.social/bounce-a-cros…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

SVD-Based Graph Fractional Fourier Transform on Directed Graphs and Its Application
Lu Li, Haiye Huo
https://arxiv.org/abs/2506.03925 https://

SVD-Based Graph Fractional Fourier Transform on Directed Graphs and Its Application
Graph fractional Fourier transform (GFRFT) is an extension of graph Fourier transform (GFT) that provides an additional fractional analysis tool for graph signal processing (GSP) by generalizing temporal-vertex domain Fourier analysis to fractional orders. In recent years, a large number of studies on GFRFT based on undirected graphs have emerged, but there are very few studies on directed graphs. Therefore, in this paper, one of our main contributions is to introduce two novel GFRFTs defined o…

T-TExTS (Teaching Text Expansion for Teacher Scaffolding): Enhancing Text Selection in High School Literature through Knowledge Graph-Based Recommendation
Nirmal Gelal, Chloe Snow, Ambyr Rios, Hande K\"u\c{c}\"uk McGinty
https://arxiv.org/abs/2506.12075

T-TExTS (Teaching Text Expansion for Teacher Scaffolding): Enhancing Text Selection in High School Literature through Knowledge Graph-Based Recommendation
The implementation of transformational pedagogy in secondary education classrooms requires a broad multiliteracy approach. Due to limited planning time and resources, high school English Literature teachers often struggle to curate diverse, thematically aligned literature text sets. This study addresses the critical need for a tool that provides scaffolds for novice educators in selecting literature texts that are diverse -- in terms of genre, theme, subtheme, and author -- yet similar in conte…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

Stability and Extension of Steady and Ranging Persistence
Yann-Situ Gazull
https://arxiv.org/abs/2506.07911 https://arxiv.org/pdf/250…

Stability and Extension of Steady and Ranging Persistence
Persistent homology is a topological data analysis tool that has been widely generalized, extending its scope outside the field of topology. Among its extensions, steady and ranging persistence was developed to study a wide variety of graph properties. Precisely, given a feature of interest on graphs, it is possible to build two types of persistence (steady and ranging persistence) that follow the evolution of the feature along graph filtrations. This study extends steady and ranging persistenc…

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

OODTE: A Differential Testing Engine for the ONNX Optimizer
With over 700 stars on GitHub and being part of the official ONNX repository, the ONNX Optimizer is the default tool for applying graph-based optimizations to ONNX models. Despite its widespread use, its ability to maintain model accuracy during optimization has not been thoroughly investigated. In this work, we present OODTE, a utility designed to automatically and comprehensively evaluate the correctness of the ONNX Optimizer. OODTE adopts a straightforward yet powerful differential testing a…

Pendulum Tracker -- SimuF\'isica: A Web-based Tool for Real-time Measurement of Oscillatory Motion
Marco P. M. de Souza, Juciane G. Maia, Lilian N. de Andrade
https://arxiv.org/abs/2506.07301

Pendulum Tracker -- SimuFísica: A Web-based Tool for Real-time Measurement of Oscillatory Motion
We present Pendulum Tracker, a computer vision-based application that enables real-time measurement of the oscillatory motion of a physical pendulum. Integrated into the educational platform SimuFísica, the system uses the OpenCV.js library and runs directly in the browser, working on computers, tablets, and smartphones. The application automatically detects the pendulum's position via the device's camera, displaying in real time the angle-versus-time graph and estimates of the oscillation per…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.de/net/as_s…

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

Quadratic Transform for Fractional Programming in Signal Processing and Machine Learning
Fractional programming (FP) is a branch of mathematical optimization that deals with the optimization of ratios. It is an invaluable tool for signal processing and machine learning, because many key metrics in these fields are fractionally structured, e.g., the signal-to-interference-plus-noise ratio (SINR) in wireless communications, the Cramér-Rao bound (CRB) in radar sensing, the normalized cut in graph clustering, and the margin in support vector machine (SVM). This article provides a comp…

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
Akie Kowaguchi, Katsuhiro Endo, Kentaro Nomura, Shuichi Kurabayashi, Paul E. Brumby, Kenji Yasuoka
https://arxiv.org/abs/2506.02549

Navigating Phase Transitions with Path-Finding Algorithms: A Strategic Approach to Replica Exchange Monte Carlo
The replica exchange method is a powerful tool for overcoming slow relaxation in molecular simulations, but its efficiency depends strongly on the choice of the number and interval of replicas and their exchange probabilities. Here, we propose a new optimization scheme based on the Dijkstra algorithm that constructs an optimal exchange path by representing replicas and their exchange probabilities as a graph. Inspired by path-finding techniques widely used in computer science, including applica…