Tootfinder

Por si acaso estoy de cumpleaños el 19 de julio 🙄
Ref: https://www.rockaxis.com/vanguardia/noticia/46983/ya-esta-disponible-la-nueva-version-remasterizada-de-peluson-of-milk-de-luis-al…

Jazzaria – Tilting Saints
#abstract

Looks indeed well made. Nice Website, too. https://www.threads.com/@luokai/post/DMNYb9hIunA

luokai (@luokai) on Threads
DJI just dropped the latest version of Terra, now supercharged with 3D Gaussian Splatting. 🚁✨ This isn’t just another update—it’s a leap for 3D reconstruction pros, blending photorealistic visuals, pinpoint mapping, and lightning-fast processing. Imagine digital twins so real, you’ll want to reach out and touch them. Key stats: Photorealistic 3D, trusted accuracy, LiDAR support, multispectral insights, and high-efficiency cluster processing—all in one end-to-end aerial survey s…

Extended Version of "Distributed Adaptive Resilient Consensus Control for Uncertain Nonlinear Multiagent Systems Against Deception Attacks"
Mengze Yu, Wei Wang, Jiaqi Yan
https://arxiv.org/abs/2506.07374

Extended Version of "Distributed Adaptive Resilient Consensus Control for Uncertain Nonlinear Multiagent Systems Against Deception Attacks"
This paper studies distributed resilient consensus problem for a class of uncertain nonlinear multiagent systems susceptible to deception attacks. The attacks invade both sensor and actuator channels of each agent. A specific class of Nussbaum functions is adopted to manage the attack-incurred multiple unknown control directions. Additionally, a general form of these Nussbaum functions is provided, which helps to ease the degeneration of output performance caused by Nussbaum gains. Then, by int…

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

This https://arxiv.org/abs/2003.11202 has been replaced.
link: https://scholar.google.com/scholar?q=a

Set System Blowups
We prove that given a constant $k \ge 2$ and a large set system $\mathcal{F}$ of sets of size at most $w$, a typical $k$-tuple of sets $(S_1, \cdots, S_k)$ from $\mathcal{F}$ can be ``blown up" in the following sense: for each $1 \le i \le k$, we can find a large subfamily $\mathcal{F}_i$ containing $S_i$ so that for $i \neq j$, if $T_i \in \mathcal{F}_i$ and $T_j \in \mathcal{F}_j$ , then $T_i \cap T_j=S_i \cap S_j$. We also show that the answer to the multicolor version of the sunflower conje…

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

A Generalized Framework for Higher-Order Localized Orthogonal Decomposition Methods
Moritz Hauck, Alexei Lozinski, Roland Maier
https://arxiv.org/abs/2506.19462

A Generalized Framework for Higher-Order Localized Orthogonal Decomposition Methods
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming constraints in the construction process. In particular, we offer a new perspective on localization strategies. We fully analyze the strategy for linear elliptic problems and discuss extensions to the Helmholtz equation and the Gross--Pitaevskii eigenvalue proble…

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph