Tootfinder

@mcdanlj@social.makerforums.info
2025-06-01 02:25:20

Baby's first unun!
My #AmateurRadio journey continues with making some of my own equipment...
I wanted to be able to connect either an EFHW or an EFRW to my KX3, but move the actual antenna away from the radio, so that I can POTA with other people close enough to talk, while keeping the antennas for the different out of each others' near field so they don't interere. To …

Partially-assembled unun. A nut on the upper right is connected to the coax shield, and is connected to a brass screw on the right for a counterpoise connection. A blue 100pf capacitor is in the upper left of a purple 3d-printed box, connected between ground and the center terminal of the input. At the bottom, the 6th turn is tapped and run to another brass screw which provides the 9:1 random wire connection. A strand of red magnet wire goes up to the upper left over the blue capacitor; it conn…

The internals of the unun with kapton tape covering the torroid, and the 49:1 antenna connection brass screw in the lid at the upper left.

The assembled unun with two wires attached. At the top is a wire next to a ground symbol on the side of the 3d-printed box. This wire is the counterpoise. On the lower right is another wire connected to the side of the box. This is the random wire connected to the 9:1 antenna connection. At the lower left, in the middle of the lid, is the antenna connection for an end-fed half-wave antenna.

Each of the terminals uses a heat-set insert as a finger nut to connect the antennas.

@azonenberg@ioc.exchange
2025-08-01 04:54:14

Just ordered a bunch of a quick little 4L test board: 3-pin header with one pin solidly connected to both internal layers, one connected via thermal reliefs, and the third not connected at all.
Plan is to assemble at least two, one hand soldered and one using pin-in-paste reflow, then cross section and evaluate intermetallics, voiding, percent hole fill, etc.

@arXiv_mathCO_bot@mastoxiv.page
2025-06-02 10:06:12

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

Complexity of the game connected domination problem
The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game.

@arXiv_csRO_bot@mastoxiv.page
2025-07-01 11:50:23

Predictive Risk Analysis and Safe Trajectory Planning for Intelligent and Connected Vehicles
Zeyu Han, Mengchi Cai, Chaoyi Chen, Qingwen Meng, Guangwei Wang, Ying Liu, Qing Xu, Jianqiang Wang, Keqiang Li
https://arxiv.org/abs/2506.23999

Predictive Risk Analysis and Safe Trajectory Planning for Intelligent and Connected Vehicles
The safe trajectory planning of intelligent and connected vehicles is a key component in autonomous driving technology. Modeling the environment risk information by field is a promising and effective approach for safe trajectory planning. However, existing risk assessment theories only analyze the risk by current information, ignoring future prediction. This paper proposes a predictive risk analysis and safe trajectory planning framework for intelligent and connected vehicles. This framework fi…

@arXiv_mathAT_bot@mastoxiv.page
2025-08-01 07:38:40

Manifold structures on highly connected Poincar\'e complexes
Wen Shen
https://arxiv.org/abs/2507.23228 https://arxiv.org/pdf/2507.23228

Manifold structures on highly connected Poincaré complexes
This paper constructs numerous examples of highly connected Poincaré complexes, each homotopy equivalent to a topological manifold yet not homotopy equivalent to any smooth manifold. Furthermore, we determine the homotopy type of any closed $2k$-connected framed $(4k+2)$-manifold with Kervaire invariant one for $k=7,15,31$.

@brichapman@mastodon.social
2025-07-31 22:08:01

"If everything is entangled, then no act is too small." -- more @ #activism

Everything is Connected (In a Giant Tangled Knot)
welcome to the existential hairball 🐈

@netzschleuder@social.skewed.de
2025-07-01 04:00:06

psi: Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The…

psi: Plant Photosystem I excitation energy transfer network (2020). 192 nodes, 29390 edges. https://networks.skewed.de/net/psi

psi — Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The weights correspond to the FRET Efficiency between connected chromophores.

@Dragofix@veganism.social
2025-06-29 12:36:50

Organized crime & gold trade are increasingly connected, report shows https://news.mongabay.com/2025/06/organized-crime-gold-trade-are-increasingly-connected-report-shows/

Organized crime & gold trade are increasingly connected, report shows
Latin American cartels once were masters of the drug trade, but spikes in prices led them into controlling a new venture.

@arXiv_mathGT_bot@mastoxiv.page
2025-07-01 09:28:23

Unknotting number is not additive under connected sum
Mark Brittenham, Susan Hermiller
https://arxiv.org/abs/2506.24088 https://arxiv…

Unknotting number is not additive under connected sum
We give the first examples of a pair of knots $K_1$,$K_2$ in the 3-sphere for which their unknotting numbers satisfy $u(K_1\#K_2)

@arXiv_eessSY_bot@mastoxiv.page
2025-08-01 07:58:50

Experimentally-Driven Analysis of Stability in Connected Vehicle Platooning: Insights and Control Strategies
Niladri Dutta, Elham Abolfazli, Themistoklis Charalambous
https://arxiv.org/abs/2507.23078

Experimentally-Driven Analysis of Stability in Connected Vehicle Platooning: Insights and Control Strategies
This paper presents the development of a tangible platform for demonstrating the practical implementation of cooperative adaptive cruise control (CACC) systems, an enhancement to the standard adaptive cruise control (ACC) concept by means of Vehicle-to-Everything (V2X) communication. It involves a detailed examination of existing longitudinal controllers and their performance in homogeneous vehicle platoons. Moreover, extensive tests are conducted using multiple autonomous experimental vehicle …

@arXiv_mathAG_bot@mastoxiv.page
2025-07-01 09:35:03

Abelianized Descent Obstruction for 0-Cycles
Hui Zhang
https://arxiv.org/abs/2506.22980 https://arxiv.org/pdf/2506.22980

Abelianized Descent Obstruction for 0-Cycles
Classical descent theory of Colliot-Thélène and Sansuc for rational points tells that, over a smooth variety $X$, the algebraic Brauer-Manin subset equals the descent obstruction subset defined by a universal torsor. Moreover, Harari shows that the Brauer-Manin subset equals the descent obstruction subset defined by torsors under connected linear groups. By using the abelian cohomology theory by Borovoi, we define abelianized descent obstructions by torsors under connected linear groups. As a…

@arXiv_csIT_bot@mastoxiv.page
2025-07-02 09:09:10

On Hierarchical Coded Caching with Offline Users
Rashid Ummer N. T., B. Sundar Rajan
https://arxiv.org/abs/2507.00727 https://arxiv.o…

On Hierarchical Coded Caching with Offline Users
This paper studies a two-layer hierarchical network in which some users are offline during the content delivery phase. A two-layer hierarchical network consists of a single server connected to multiple cache-aided mirror sites, and each mirror site is connected to a distinct set of cache-aided users. A scheme for such a hierarchical system with offline users has been proposed recently but considered a special case where all mirror caches have zero memory, which is a significant limitation. We p…

@arXiv_mathLO_bot@mastoxiv.page
2025-06-30 08:15:20

Connected components in d-minimal structures
Masato Fujita
https://arxiv.org/abs/2506.21846 https://arxiv.org/pdf/2506.21846

Connected components in d-minimal structures
For a given d-minimal expansion $\mathfrak R$ of the ordered real field, we consider the expansion $\mathfrak R^\natural$ of $\mathfrak R$ generated by the sets of the form $\bigcup_{S \in \mathcal C}S$, where $\mathcal C$ is a subfamily of the collection of connected components of an $\mathfrak R$-definable set. We prove that $\mathfrak R^{\natural}$ is d-minimal. A similar assertion holds for almost o-minimal expansions of ordered groups.

@arXiv_csDS_bot@mastoxiv.page
2025-07-01 08:08:23

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
Koustav Bhanja, Asaf Petruschka
https://arxiv.org/abs/2506.23215 https://

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
We present a compact labeling scheme for determining whether a designated set of terminals in a graph remains connected after any $f$ (or less) vertex failures occur. An $f$-FT Steiner connectivity labeling scheme for an $n$-vertex graph $G=(V,E)$ with terminal set $U \subseteq V$ provides labels to the vertices of $G$, such that given only the labels of any subset $F \subseteq V$ with $|F| \leq f$, one can determine if $U$ remains connected in $G-F$. The main complexity measure is th…

@midtsveen@social.linux.pizza
2025-06-01 16:53:51

:heart_trans: As a gender-fluid, bisexual, and queer person, #PrideMonth is the time I feel most seen and connected!
#GenderFluidity #GenderFluid

@netzschleuder@social.skewed.de
2025-07-02 04:00:06

psi: Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The…

psi — Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The weights correspond to the FRET Efficiency between connected chromophores.

@brichapman@mastodon.social
2025-08-01 18:03:03

Recognizing our interconnection isn't just comforting because it reminds us we matter; it can sometimes feel overwhelming because it also highlights the magnitude of the issues we face. full article @ https://www.brichapman.com/p/everything-is-connected-in-a-giant

Everything is Connected (In a Giant Tangled Knot)
welcome to the existential hairball 🐈

@drewmcmanus@hachyderm.io
2025-07-31 22:56:35

It’s all connected. https://www.livescience.com/animals/land-mammals/return-of-wolves-to-yellowstone-has-led-to-a-surge-in-aspen-trees-unseen-for-80-years

@arXiv_condmatmeshall_bot@mastoxiv.page
2025-08-01 09:56:01

Current-induced spin-orbit torque on the surface of a transition metal dichalcogenide connected to a two-dimensional ferromagnet CrI$_3$: Effects of twisting and gating
Leyla Majidi, Azadeh Faridi, Reza Asgari
https://arxiv.org/abs/2507.23655

Current-induced spin-orbit torque on the surface of a transition metal dichalcogenide connected to a two-dimensional ferromagnet CrI$_3$: Effects of twisting and gating
Motivated by recent progress in employing two key classes of two-dimensional materials-topological insulators and transition-metal dichalcogenides (TMDCs)-as spin sources for generating spin-orbit torque (SOT), we investigate current-induced spin polarization and the resulting SOT in bilayers composed of a TMDC (WSe$_2$ or MoSe$_2$) and ferromagnetic chromium iodide (CrI$_3$), beyond the linear response regime. Using the steady-state Boltzmann equation, we find that intra-band transitions yield…

@cdarwin@c.im
2025-06-28 23:33:04

The Justice Department on Friday 👉fired at least three prosecutors involved in U.S. Capitol riot criminal cases,
the latest moves by the Trump administration targeting attorneys connected to the massive prosecution of the Jan. 6, 2021, attack,
according to two people familiar with the matter.
Those dismissed include two attorneys who worked as supervisors overseeing the Jan. 6 prosecutions in the U.S. attorney’s office in Washington
as well as a line attorney who pro…

Justice Department fires 3 lawyers involved in Jan. 6 cases
The Justice Department has fired at least three prosecutors involved in U.S. Capitol riot criminal cases, according to two people familiar with the matter. It’s the latest move by the Trump administration targeting attorneys connected to the massive prosecution of the Jan. 6, 2021, attack. Those dismissed include two attorneys who worked as supervisors overseeing the Jan. 6 prosecutions in the U.S. attorney’s office in Washington as well as a line attorney who prosecuted cases stemming from…

@dawid@social.craftknight.com
2025-08-02 10:46:12

@… I glued a rpi zero to my printer, connected it via usb, and set it up as a print server on my lan - I don't have to deal with any of those issues ever again :D

@Aschniedermann@fediscience.org
2025-07-01 14:52:33

I am slowly but surely enjoying Reiner Keller's "Sociology of knowledge approach to discourse". I highly appreciate the level of care towards what is identified/extracted and taken for real. However, as with any other sociological framework, the position of the analyst remains problematic.
Even if one masters the analytical practice, communicating it remains problematic, as language must be used to do so. Traditionally, sociologists attempt to find a new form of language, which often becomes increasingly abstract and incomprehensible.
I wonder what the alternative would be: expressing analytical insights in every possible language or discursive logic (which is practically impossible), or at least in those connected to the analysis. Language translation or 'elif' could be examples of this. However, I also consider 'speaking in your terms' when communicating with individuals from different backgrounds.
#ADSK #Sociology #DiscourseAnalysis

@cowboys@darktundra.xyz
2025-08-01 20:49:47

Lions, Raiders named top landing spots for disgruntled Cowboys edge rusher Micah Parsons https://www.sportingnews.com/us/nfl/las-vegas-raiders/news/lions-raiders-named-top-landin…

Lions, Raiders named top landing spots for disgruntled Cowboys edge rusher Micah Parsons
The Detroit Lions and Las Vegas Raiders have been connected in a league-altering trade involving Dallas Cowboys disgruntled edge rusher Micah Parsons.

@frankel@mastodon.top
2025-07-31 08:21:01

Need to connect two devices? Try a dumb pipe
https://www.dumbpipe.dev/

Dumb Pipe
Iroh connections are dumb pipes: easy, direct connections that punch through NATs & stay connected as network conditions change.

@arXiv_quantph_bot@mastoxiv.page
2025-07-02 10:06:40

High-fidelity two-qubit quantum logic gates in a trapped-ion chain using axial motional modes
Xingyu Zhao, Ji Bian, Yi Li, Yue Li, Mengxiang Zhang, Yiheng Lin
https://arxiv.org/abs/2507.00504

High-fidelity two-qubit quantum logic gates in a trapped-ion chain using axial motional modes
Trapped-ion systems are one of the leading platforms for quantum information processing, where a key challenge is to scale up system size while maintaining high-fidelity two-qubit operations. A promising approach is to build high-performance modules interconnected via strong coupling. In particular, axial motional modes provide a feasible means of coupling short ion chains. However, previous implementations of fully connected 5-ion modules based on axial modes have been limited to fidelities of…

@arXiv_mathNT_bot@mastoxiv.page
2025-06-02 10:12:33

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

Quantum Modular Forms and Resurgence
In 2010, Zagier described a new phenomenon which he called quantum modularity. This connected various examples coming from disparate fields which exhibit near-modular behavior. In the fifteen years since, Zagier's philosophy has informed new developments in areas such as knot theory, 3-dimensional topology, combinatorics, and physics. More recently, the concept of holomorphic quantum modularity has emerged, pointing to a clearer structure for Zagier's original examples. These new developments s…

@raiders@darktundra.xyz
2025-08-01 21:13:38

Lions, Raiders named top landing spots for disgruntled Cowboys edge rusher Micah Parsons https://www.sportingnews.com/us/nfl/las-vegas-raiders/news/lions-raiders-named-top-landin…

Lions, Raiders named top landing spots for disgruntled Cowboys edge rusher Micah Parsons
The Detroit Lions and Las Vegas Raiders have been connected in a league-altering trade involving Dallas Cowboys disgruntled edge rusher Micah Parsons.

@arXiv_hepth_bot@mastoxiv.page
2025-07-01 09:31:23

Homomorphism, substructure and ideal: Elementary but rigorous aspects of renormalization group or hierarchical structure of topological orders
Yoshiki Fukusumi, Yuma Furuta
https://arxiv.org/abs/2506.23155

Homomorphism, substructure and ideal: Elementary but rigorous aspects of renormalization group or hierarchical structure of topological orders
We study ring homomorphisms between fusion rings appearing in conformal field theories connected under massless renormalization group (RG) flows. By interpreting the elementary relationship between homomorphism, quotient ring, and projection, we propose a general quantum Hamiltonian formalism of a massless and massive RG flow with an emphasis on generalized symmetry. In our formalism, the noninvertible nature of the ideal of a fusion ring plays a fundamental role as a condensation rule between …

@arXiv_mathOA_bot@mastoxiv.page
2025-07-31 08:22:01

Free semigroupoid algebras and the first cohomology groups
Linzhe Huang, Minghui Ma
https://arxiv.org/abs/2507.22508 https://arxiv.org/pdf/2507.22508

Free semigroupoid algebras and the first cohomology groups
This paper investigates derivations of the free semigroupoid algebra $\mathfrak{L}_G$ of a countable or uncountable directed graph $G$ and its norm-closed version, the tensor algebra $\mathcal{A}_G$. We first prove a weak Dixmier approximation theorem for $\mathfrak{L}_G$ when $G$ is strongly connected. Using the theorem, we show that if every connected component of $G$ is strongly connected, then every bounded derivation $δ$ from $\mathcal{A}_G$ into $\mathfrak{L}_G$ is of the form $δ=δ_T$ …

@arXiv_csSE_bot@mastoxiv.page
2025-07-28 09:21:31

SDVDiag: A Modular Platform for the Diagnosis of Connected Vehicle Functions
Matthias Wei{\ss}, Falk Dettinger, Michael Weyrich
https://arxiv.org/abs/2507.19403 https://

SDVDiag: A Modular Platform for the Diagnosis of Connected Vehicle Functions
Connected and software-defined vehicles promise to offer a broad range of services and advanced functions to customers, aiming to increase passenger comfort and support autonomous driving capabilities. Due to the high reliability and availability requirements of connected vehicles, it is crucial to resolve any occurring failures quickly. To achieve this however, a complex cloud/edge architecture with a mesh of dependencies must be navigated to diagnose the responsible root cause. As such, manua…

@arXiv_mathCO_bot@mastoxiv.page
2025-06-02 10:14:12

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

Maximal independent sets in graphs with given matching number
A maximal independent set in a graph $G$ is an independent set that cannot be extended to a larger independent set by adding any vertex from $G$. This paper investigates the problem of determining the maximum number of maximal independent sets in terms of the matching number of a graph. We establish the maximum number of maximal independent sets for general graphs, connected graphs, triangle-free graphs, and connected triangle-free graphs with a given matching number, and characterize the extre…

@simoncox@seocommunity.social
2025-07-30 18:09:02

Schema sorted finally!
#11ty
Went for a modular set of includes in the end.

SEO-schema visualiser Chrome extension showing my sites article collection page and all the articles connected to it as well as other information. Get in!

@arXiv_csCG_bot@mastoxiv.page
2025-07-02 07:31:29

Minimum Selective Subset on Some Graph Classes
Bubai Manna
https://arxiv.org/abs/2507.00235 https://arxiv.org/pdf/2507.00235

Minimum Selective Subset on Some Graph Classes
In a connected simple graph G = (V(G),E(G)), each vertex is assigned a color from the set of colors C={1, 2,..., c}. The set of vertices V(G) is partitioned as V_1, V_2, ... ,V_c, where all vertices in V_j share the same color j. A subset S of V(G) is called Selective Subset if, for every vertex v in V(G), and if v is in V_j, at least one of its nearest neighbors in (S union (V(G)\ V_j)) has the same color as v. The Minimum Selective Subset (MSS) problem seeks to find a selective subset of mini…

@arXiv_mathGT_bot@mastoxiv.page
2025-07-02 08:03:20

Simply slicing knots
Anthony Conway, Patrick Orson, Mark Pencovitch
https://arxiv.org/abs/2507.00431 https://arxiv.org/pdf/2507.00431…

Simply slicing knots
Given a simply-connected 4-manifold with boundary the 3-sphere, this paper establishes sufficient conditions for a knot in the boundary to be sliced by a locally flat disc in the 4-manifold, whose complement has finite cyclic fundamental group. In addition, necessary and sufficient conditions are described to ensure that such discs exist stably, that is after taking the connected sum of the 4-manifold with copies of $S^2 \times S^2$.

@arXiv_eessSP_bot@mastoxiv.page
2025-07-02 09:10:10

SComCP: Task-Oriented Semantic Communication for Collaborative Perception
Jipeng Gan, Yucheng Sheng, Hua Zhang, Le Liang, Hao Ye, Chongtao Guo, Shi Jin
https://arxiv.org/abs/2507.00895

SComCP: Task-Oriented Semantic Communication for Collaborative Perception
Reliable detection of surrounding objects is critical for the safe operation of connected automated vehicles (CAVs). However, inherent limitations such as the restricted perception range and occlusion effects compromise the reliability of single-vehicle perception systems in complex traffic environments. Collaborative perception has emerged as a promising approach by fusing sensor data from surrounding CAVs with diverse viewpoints, thereby improving environmental awareness. Although collaborati…

@arXiv_eessSY_bot@mastoxiv.page
2025-07-31 08:56:41

Safe and Efficient Data-driven Connected Cruise Control
Haosong Xiao, Chaozhe R. He
https://arxiv.org/abs/2507.22227 https://arxiv.org/pdf/2507.22227

Safe and Efficient Data-driven Connected Cruise Control
In this paper, we design a safe and efficient cruise control for the connected automated vehicle with access to motion information from multiple vehicles ahead via vehicle-to-vehicle (V2V) communication. Position and velocity data collected from a chain of human-driven vehicles are systematically leveraged to design a connected cruise controller that smoothly responds to traffic perturbations while maximizing energy efficiency. A safety filter derived from a control barrier function provides th…

@arXiv_statME_bot@mastoxiv.page
2025-06-02 10:22:16

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

A Dirichlet stochastic block model for composition-weighted networks
Network data are observed in various applications where the individual entities of the system interact with or are connected to each other, and often these interactions are defined by their associated strength or importance. Clustering is a common task in network analysis that involves finding groups of nodes displaying similarities in the way they interact with the rest of the network. However, most clustering methods use the strengths of connections between entities in their original form, ig…

@arXiv_mathDG_bot@mastoxiv.page
2025-07-01 08:20:53

On the Dirichlet Problem at Infinity and Poisson Boundary for Certain Manifolds without Conjugate Points
Fei Liu, Yinghan Zhang
https://arxiv.org/abs/2506.22883

On the Dirichlet Problem at Infinity and Poisson Boundary for Certain Manifolds without Conjugate Points
In this paper, we investigate the problem of the existence of the bounded harmonic functions on a simply connected Riemannian manifold $\widetilde{M}$ without conjugate points, which can be compactified via the ideal boundary $\widetilde{M}(\infty)$. Let $\widetilde{M}$ be a uniform visibility manifold which satisfy the Axiom $2$, or a rank $1$ manifold without focal points, suppose that $Γ$ is a cocompact discrete subgroup of $Iso(\widetilde{M})$, we show that for a given continuous function …

@arXiv_csDM_bot@mastoxiv.page
2025-06-02 07:17:22

Cartesian Prime Graphs and Cospectral Families
Abhinav Bitragunta, Hareshkumar Jadav, Ranveer Singh
https://arxiv.org/abs/2505.24358 https://

Cartesian Prime Graphs and Cospectral Families
We introduce a method for constructing larger families of connected cospectral graphs from two given cospectral families of sizes $p$ and $q$. The resulting family size depends on the Cartesian primality of the input graphs and can be one of $pq$, $p + q - 1$, or $\max(p, q)$, based on the strictness of the applied conditions. Under the strictest condition, our method generates $O(p^3q^3)$ new cospectral triplets, while the more relaxed conditions yield $\varOmega(pq^3 + qp^3)$ such triplets. W…

@newsie@darktundra.xyz
2025-07-01 17:13:39

Cyberattack on Russian independent media had links to US-sanctioned institute, researchers find https://therecord.media/cyberattack-on-russian-media-linked-to-sanctioned-institute

Cyberattack on Russian independent media had links to US-sanctioned institute, researchers find
A Russian hosting provider allegedly involved in a recent cyberattack against independent media organizations in the country is reportedly connected to a state-affiliated research center sanctioned by the U.S.

@netzschleuder@social.skewed.de
2025-07-01 03:00:03

contiguous_usa: Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.
This network has 49 nodes and 107 edges.
Tags: Transportation, Roads, Unweighted

contiguous_usa: Contiguous states (USA). 49 nodes, 107 edges. https://networks.skewed.de/net/contiguous_usa

contiguous_usa — Contiguous states (USA)
A network of contiguous states in the USA, in which each state is a node and two nodes are connected if they share a land-based geographic border. The dataset includes the lower 48 states, and the District of Columbia.

@Techmeme@techhub.social
2025-06-16 11:25:39

Amazon Ads and Roku sign a new ad initiative to give media buyers access to 80% of US connected-TV households, set to launch by Q4 2025, using Amazon's DSP (Dade Hayes/Deadline)
https://deadline.com/2025/06/amazon-ads-roku-set…

Amazon Ads & Roku Set Landmark Pact Giving Brands Access To 80% Of Connected-TV Households
Amazon Ads and Roku are teaming on a landmark initiative that will give advertisers access to more than 80% of connected-TV households in the U.S.

@arXiv_csSI_bot@mastoxiv.page
2025-06-02 10:01:24

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

PureRank: A Parameter-Free Recursive Importance Measure for Network Nodes
Classical parameter-free centrality measures based on the recursive definition of importance (RDI), such as eigenvector centrality and Seeley centrality, are limited to strongly connected networks, while widely used methods like Katz centrality and PageRank rely on free parameters, such as the damping factor, to handle general networks. This motivates our central question: can an RDI-based importance (centrality) measure be defined for arbitrary networks without any tunable parameters? We answe…

@arXiv_mathDS_bot@mastoxiv.page
2025-07-01 09:34:13

Degenerate perturbations of infinite graph-directed iterated function systems
Haruyoshi Tanaka
https://arxiv.org/abs/2506.23877 https://

Degenerate perturbations of infinite graph-directed iterated function systems
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide lower and upper estimates of the Hausdorff dimension of the limit set of such GIFS. Bowen type formula is also given under conformal condition and suitable separate conditions. We also introduce perturbed GIFS in which the images of arbitrarily chosen contraction…

@memeorandum@universeodon.com
2025-07-26 10:36:09

Two high-ranking NOAA employees connected to 'Sharpiegate' are put on leave (Evan Bush/NBC News)
https://www.nbcnews.com/science/science-news/two-high-ranking-noaa-employees-connected-sharpiegate-incident-put-lea-rcna221113
http://www.memeorandum.com/250726/p6#a250726p6

@arXiv_csNI_bot@mastoxiv.page
2025-08-01 09:10:11

Networked Physical Computing: A New Paradigm for Effective Task Completion via Hypergraph Aided Trusted Task-Resource Matching
Botao Zhu, Xianbin Wang
https://arxiv.org/abs/2507.23556

Networked Physical Computing: A New Paradigm for Effective Task Completion via Hypergraph Aided Trusted Task-Resource Matching
Due to the diverse physical attributes of computing resources and tasks, developing effective mechanisms to facilitate task and resource matching in complex connected systems for value-oriented task completion has become increasingly challenging. To address the challenge, this paper proposes a networked physical computing system that integrates the physical attributes of computing resources and tasks as well as task-specific trust relationships among devices to enable value-driven task completi…

@unixviking@social.linux.pizza
2025-07-31 05:47:07

After weeks of use, I have now discovered that the exotic WiFi module installed in my mini PC is not recognized by Debian and cannot be used, as I was connected to the Internet via cable the whole time.
I only noticed this yesterday when I wanted to send a file to my computer via Localsend, which requires a connection via the same WLAN network. My ThinkPad T490s is also running Debian, and the WLAN module doesn't cause any problems there, and since I've only ever sent files ba…

@arXiv_mathAP_bot@mastoxiv.page
2025-07-01 09:08:43

Subelliptic Random Walks on Riemannian Manifolds and Their Convergence to Equilibrium
Davide Tramontana
https://arxiv.org/abs/2506.22869 https://

Subelliptic Random Walks on Riemannian Manifolds and Their Convergence to Equilibrium
The aim of this work is to study the convergence to equilibrium of an $(h,ρ)$-subelliptic random walk on a closed, connected Riemannian manifold $(M,g)$ associated with a subelliptic second-order differential operator $A$ on $M$. In such a random walk, $h$ roughly represents the step size and $ρ$ the speed at which it is carried out. To construct the random walk and prove the convergence result, we employ a technique due to Fefferman and Phong, which reduces the problem to the study of a cons…

@arXiv_mathNA_bot@mastoxiv.page
2025-06-02 10:07:26

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

Multisymplecticity in finite element exterior calculus
We consider the application of finite element exterior calculus (FEEC) methods to a class of canonical Hamiltonian PDE systems involving differential forms. Solutions to these systems satisfy a local multisymplectic conservation law, which generalizes the more familiar symplectic conservation law for Hamiltonian systems of ODEs, and which is connected with physically-important reciprocity phenomena, such as Lorentz reciprocity in electromagnetics. We characterize hybrid FEEC methods whose numer…

@arXiv_condmatsoft_bot@mastoxiv.page
2025-07-02 09:05:59

Conformational properties of strictly two-dimensional equilibrium polymers
J. P. Wittmer, A. Cavallo, A. Johner
https://arxiv.org/abs/2507.00649 https://…

Conformational properties of strictly two-dimensional equilibrium polymers
Two-dimensional monodisperse linear polymer chains are known to adopt for sufficiently large chain lengths $N$ and surface fractions $ϕ$ compact configurations with fractal perimeters. We show here by means of Monte Carlo simulations of reversibly connected hard disks (without branching, ring formation and chain intersection) that polydisperse self-assembled equilibrium polymers with a finite scission energy $E$ are characterized by the same universal exponents as their monodisperse peers. Con…

@johnleonard@mastodon.social
2025-07-25 07:48:22

No sector has seen greater change than automotive. Packed with intelligent sensors, AI, GPS, cameras and in-car software, today’s vehicles generate and transmit vast volumes of data.
While this helps with seamless connectivity and smarter driving, it also creates serious security, privacy, and compliance risks automotive firms and tech providers can’t afford to ignore.

How connected cars are creating new data protection risks
Seamless connectivity helps with smarter driving, but creates security, privacy and compliance risks vendors can’t afford to ignore, argues Jonathan Armstrong.

@losttourist@social.chatty.monster
2025-06-28 15:26:24

We're shopping for a new oven and one of my key criteria is "can it be connected to wifi?"
Any oven for which the answer is "yes", even if it's optional, is immediately crossed off the shortlist.
#InternetOfShit

@arXiv_mathCV_bot@mastoxiv.page
2025-08-01 08:06:01

Generic conservative dynamics on Stein manifolds with the volume density property
Leandro Arosio, Finnur Larusson
https://arxiv.org/abs/2507.23133 https://…

Generic conservative dynamics on Stein manifolds with the volume density property
We study the dynamics of generic volume-preserving automorphisms $f$ of a Stein manifold $X$ of dimension at least 2 with the volume density property. Among such $X$ are all connected linear algebraic groups (except $\mathbb{C}$ and $\mathbb{C}^*$) with a left- or right-invariant Haar form. We show that a generic $f$ is chaotic and of infinite topological entropy, and that the transverse homoclinic points of each of its saddle periodic points are dense in $X$. We present analogous results with …

@andres4ny@social.ridetrans.it
2025-06-28 16:58:23

One of the reasons I appreciate walking, biking, and public transit so much (aside from just being a more joyful/connected way to travel, and better for our environment) is because they starve so many absolutely awful billionaires/corporations/oligarchs of profit. Oil companies, car manufacturers, large chain stores..
https://

AnarchoNinaWrites (@AnarchoNinaWrites@jorts.horse)
I mean the reality is that if we can take away profit, THIS fascist regime, will crumble. That is not true of ALL fascist regimes, but this one, is literally all about locking in the ability of billionaire nazi cultists to keep extracting wealth on a boiling planet even as billions die. We could probably make them surrender in less than a month; the issue of course is they will start shooting before then.

@arXiv_condmatstrel_bot@mastoxiv.page
2025-06-02 07:32:06

Nematicity in iron pnictides: phase competition and emergent symmetry
Yiming Wang, Changle Liu, Shan Wu, Jianda Wu, Qimiao Si, Rong Yu
https://arxiv.org/abs/2505.24847

Nematicity in iron pnictides: phase competition and emergent symmetry
The phase diagram of iron-based superconductors contains a host of electronic orders, which are intimately connected with their superconductivity. Here we analyze the fluctuations of one type of nematic order in another. Our analysis leads to an emergent U(1) symmetry at a first-order transition between a nematic phase and a $C_4$-symmetric charge-ordered phase. We characterize the continuous symmetry in terms of a certain hidden Lie algebra that links the different orders. This emergent symmet…

@Mediagazer@mstdn.social
2025-06-16 11:40:41

Amazon Ads and Roku sign a new ad initiative to give media buyers access to 80% of US connected-TV households, set to launch by Q4 2025, using Amazon's DSP (Dade Hayes/Deadline)
https://deadline.com/2025/06/amazon-ads-roku-set…

Amazon Ads & Roku Set Landmark Pact Giving Brands Access To 80% Of Connected-TV Households
Amazon Ads and Roku are teaming on a landmark initiative that will give advertisers access to more than 80% of connected-TV households in the U.S.

@arXiv_mathGM_bot@mastoxiv.page
2025-07-02 08:32:20

A note on D-functions and P-covariances on Hilbert spaces and related inequalities
Sergio Scarlatti
https://arxiv.org/abs/2507.00009 https://

A note on D-functions and P-covariances on Hilbert spaces and related inequalities
In this note we first review the concept of D-function, closely connected with Cauchy-Schwarz inequality, and then introduce the notion of P-covariance on a Hilbert space, where $P$ is an orthogonal projection. We show that when P is specialized to be one-dimensional many well-known inequalities such as Buzano, Richard and Walker inequalities are simple consequences of P-covariance inequalities and their relation with D-functions. By means of these concepts enhancements of the previous mentione…

@arXiv_csLO_bot@mastoxiv.page
2025-06-30 07:35:09

On the role of connectivity in Linear Logic proofs
Raffaele Di Donna, Lorenzo Tortora de Falco
https://arxiv.org/abs/2506.21678 https://

On the role of connectivity in Linear Logic proofs
We investigate a property that extends the Danos-Regnier correctness criterion for linear logic proof-structures. The property applies to the correctness graphs of a proof-structure: it states that any such graph is acyclic and that the number of its connected components is exactly one more than the number of nodes bottom or weakening. This is known to be necessary but not sufficient in multiplicative exponential linear logic (MELL) to recover a sequent calculus proof from a proof-structure. We…

@arXiv_physicscompph_bot@mastoxiv.page
2025-07-01 08:32:43

Data-Driven Surrogate Modeling of DSMC Solutions Using Deep Neural Networks
Ehsan Roohi, Ahmad Shoja-sani
https://arxiv.org/abs/2506.22453 https://

Data-Driven Surrogate Modeling of DSMC Solutions Using Deep Neural Networks
This study presents a deep neural network (DNN) framework that accelerates Direct Simulation Monte Carlo (DSMC) computations for rarefied-gas flows, while maintaining high physical fidelity. First, a fully connected deep neural network is trained on high-quality DSMC data for seven temperatures (200-650 K) to reproduce the Maxwell-Boltzmann speed distribution of argon. Injecting the physical boundary point into the training set enforces the correct low-speed limit. It reduces the mean-squared e…

@netzschleuder@social.skewed.de
2025-07-02 07:00:03

product_space: Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS …

product_space: Atlas of Economic Complexity export network. 774 nodes, 1779 edges. https://networks.skewed.de/net/product_space#SITC

product_space — Atlas of Economic Complexity export network
Two networks of economic products, where a pair of products are connected if they are exported at similar rates by the same countries. The data are a projection from a bipartite network of nations and the products they export. Edges weights represent a similarity score (called "proximity"). Data based on UN Comtrade worldwide trade patterns. SITC network based on the Standard International Trade Classification and HS network based on the Harmonized Commodity Description and Coding System.

@arXiv_econTH_bot@mastoxiv.page
2025-07-02 08:18:19

Local Strategy-Proofness and Dictatorship
Abinash Panda, Anup Pramanik, Ragini Saxena
https://arxiv.org/abs/2507.00913 https://arxiv.…

Local Strategy-Proofness and Dictatorship
We investigate preference domains where every unanimous and locally strategy-proof social choice function (scf) satisfies dictatorship. We identify a condition on domains called connected with two distinct neighbours which is necessary for unanimous and locally strategy-proof scfs to satisfy dictatorship. Further, we show that this condition is sufficient within the class of domains where every unanimous and locally strategy-proof scf satisfies tops-onlyness. While a complete characterization r…

@geant@mstdn.social
2025-07-30 09:14:06

We’re heading to #OSFair2025
Together with the European e-Infrastructures Assembly, we’ll be at CERN with a joint booth and a shared mission: to help shape a more open, inclusive, and connected future for research and #openscience
📅 Register by 31 July:

@arXiv_statML_bot@mastoxiv.page
2025-07-31 08:17:41

Simulating Posterior Bayesian Neural Networks with Dependent Weights
Nicola Apollonio, Giovanni Franzina, Giovanni Luca Torrisi
https://arxiv.org/abs/2507.22095 https://

Simulating Posterior Bayesian Neural Networks with Dependent Weights
In this paper we consider posterior Bayesian fully connected and feedforward deep neural networks with dependent weights. Particularly, if the likelihood is Gaussian, we identify the distribution of the wide width limit and provide an algorithm to sample from the network. In the shallow case we explicitly compute the distribution of the output, proving that it is a Gaussian mixture. All the theoretical results are numerically validated.

@arXiv_mathFA_bot@mastoxiv.page
2025-08-01 07:55:00

Optimal Dual Frame Pairs: A Synergy with Graph Theory
Shankhadeep Mondal, Ram Narayan Mohapatra
https://arxiv.org/abs/2507.23249 https://arxiv.org/pdf/2507…

Optimal Dual Frame Pairs: A Synergy with Graph Theory
This paper investigates the optimization of dual frame pairs in the context of erasure problems in data transmission, using a graph theoretical approach. Frames are essential for mitigating errors and signal loss due to their redundancy properties. We address the use of spectral radius and operator norm for error measurements, presenting conditions for the optimality of dual pairs for one and two erasures. Our study shows that a tight frame generated by connected graphs and its canonical dual p…

@bammerlaan@mastodon.nl
2025-06-23 18:24:44

Just picked up this #Salter Improved Family Scale to gift a friend who's getting married and is into old-fashioned stuff and British stuff.
But, it doesn't quite sit at 0. Does anyone have any experience on how to tare a machine like this? There's no knob as far as I can see. The plate on top also doesn't seem like it can be removed without force.
More pictures below. …

A Salter's Family Scale, British-made, is displayed in seven images. The scale features a round, shallow pan at the top, supported by a central post connected to the main body. The body is a dark color, possibly black or dark green, with brass-colored accents.
The dial is white with black markings and text, indicating measurements in kilograms. The scale ranges from 0 to 10 kilograms, with smaller increments marked along the outer edge. The needle is brass-colored. The base of the scale is roun…

@arXiv_mathCO_bot@mastoxiv.page
2025-07-31 09:51:21

Proof of the linkage conjecture for highly connected tournaments
Jia Zhou, Jin Yan
https://arxiv.org/abs/2507.22651 https://arxiv.org/pdf/2507.22651…

Proof of the linkage conjecture for highly connected tournaments
A digraph $D$ is $k$-linked if for every $2k$ distinct vertices $ x_1,\ldots , x_k, y_1, \ldots , y_k$ in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$ for each $i\in [k]$. In 2021, Girão, Popielarz, and Snyder [Combinatorica 41 (2021) 815--837] conjectured that there exists a constant $C >0$ such that every $(2k+1)$-connected tournament with minimum out-degree at least $Ck$ is $k$-linked. In this paper, we disprove this…

@arXiv_mathAG_bot@mastoxiv.page
2025-06-02 10:09:04

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

Moduli spaces of twisted equivariant G-bundles over a curve
Let $X$ be a compact Riemann surface, $Γ$ a finite group of automorphisms of $X$ and $G$ a connected reductive complex Lie group with center $Z$. If we equip this data with a homomorphism $θ:Γ\to\text{Aut}(G)$ and a 2-cocycle $c:Γ\timesΓ\to Z$, there is a notion of $(θ,c)$-twisted $Γ$-equivariant $G$-bundle over $X$. The aim of this paper is to construct a coarse moduli space of isomorphism classes of polystable $(θ,c)$-twisted equivariant $G$-bundles over $X$, according to the definiti…

@cowboys@darktundra.xyz
2025-07-31 20:01:58

Cowboys, Micah Parsons Are ‘Further Apart Than They Were in March’: Insider https://heavy.com/sports/nfl/dallas-cowboys/cowboys-micah-parsons-are-further-apart-than-they-were-in-march-insider/?adt_ei=[email…

Cowboys, Micah Parsons Are ‘Further Apart Than They Were in March’: Insider
The Dallas Cowboys‘ situation with Micah Parsons’ contract is starting to become an issue. The game-wrecking EDGE rusher and two-time All-Pro and the Cowboys are “further apart than than they were in March,” according to well-connected ESPN insider Adam Schefter. Parsons is playing on his fifth-year option and will be a free agent in March. He has made the Pro Bowl in each of his first four seasons and has been a first- or second-team All-Pro performer in three of his four seasons and i…

@simon_lucy@mastodon.social
2025-07-29 17:26:56

The newly reconfigured server room in the shed. Things still need putting in boxes.

Wooden rack for two laptops running as servers and a couple of Raspberry Ps

Bookcase no. 9 in the shed and next to it a metal rack with various hardware things and lots of routers not connected.

@arXiv_mathOC_bot@mastoxiv.page
2025-07-31 09:18:41

Set Invariance with Probability One for Controlled Diffusion: Score-based Approach
Wenqing Wang, Alexis M. H. Teter, Murat Arcak, Abhishek Halder
https://arxiv.org/abs/2507.22385

Set Invariance with Probability One for Controlled Diffusion: Score-based Approach
Given a controlled diffusion and a connected, bounded, Lipschitz set, when is it possible to guarantee controlled set invariance with probability one? In this work, we answer this question by deriving the necessary and sufficient conditions for the same in terms of gradients of certain log-likelihoods -- a.k.a. score vector fields -- for two cases: given finite time horizon and infinite time horizon. The deduced conditions comprise a score-based test that provably certifies or falsifies the exi…

@netzschleuder@social.skewed.de
2025-06-01 15:00:04

power: Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.
This network has 4941 nodes and 6594 edges.
Tags: Technological, Power grid, Unweighted
https://networks.…

power: Western US Power Grid. 4941 nodes, 6594 edges. https://networks.skewed.de/net/power

power — Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.

@arXiv_csDS_bot@mastoxiv.page
2025-07-01 08:40:03

Parameterized Critical Node Cut Revisited
Du\v{s}an Knop, Nikolaos Melissinos, Manolis Vasilakis
https://arxiv.org/abs/2506.23363 https://

Parameterized Critical Node Cut Revisited
Given a graph $G$ and integers $k, x \geq 0$, the Critical Node Cut problem asks whether it is possible to delete at most $k$ vertices from $G$ such that the number of remaining pairs of connected vertices is at most $x$. This problem generalizes Vertex Cover (when $x = 0$), and has applications in network design, epidemiology, and social network analysis. We investigate the parameterized complexity of Critical Node Cut under various structural parameters. We first significantly strengthen exis…

@memeorandum@universeodon.com
2025-07-25 20:56:08

"Free Ghislaine" Advocate Claims People Connected to White House Contacted Her Before Reaching Out to Maxwell (J.D. Wolf/MeidasTouch News)
https://meidasnews.com/news/free-ghislaine-advocate-claims-people-connected-to-white-house-contacted-her-before-reaching-out-to-maxwell
http://www.memeorandum.com/250725/p92#a250725p92

@arXiv_csNI_bot@mastoxiv.page
2025-06-02 07:20:31

Optimizing Server Load Distribution in Multimedia IoT Environments through LSTM-Based Predictive Algorithms
Somaye Imanpour, Ahmadreza Montazerolghaem, Saeed Afshari
https://arxiv.org/abs/2505.24806

Optimizing Server Load Distribution in Multimedia IoT Environments through LSTM-Based Predictive Algorithms
The Internet of Multimedia Things (IoMT) represents a significant advancement in the evolution of IoT technologies, focusing on the transmission and management of multimedia streams. As the volume of data continues to surge and the number of connected devices grows exponentially, internet traffic has reached unprecedented levels, resulting in challenges such as server overloads and deteriorating service quality. Traditional computer network architectures were not designed to accommodate this ra…

@netzschleuder@social.skewed.de
2025-07-01 12:00:07

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.

arxiv_authors: Arxiv authors (1993-2003). 68746 nodes, 51971 edges. https://networks.skewed.de/net/arxiv_authors#HepTh

arxiv_authors — Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.

@arXiv_mathOA_bot@mastoxiv.page
2025-07-30 08:10:31

Equivariant Localization of $K$-homological Euler Class for almost connected Lie Groups
Hongzhi Liu, Hang Wang, Zijing Wang, Shaocong Xiang
https://arxiv.org/abs/2507.21415 http…

Equivariant Localization of $K$-homological Euler Class for almost connected Lie Groups
Using the Witten deformation and localization algebra techniques, we compute the $G$-equivariant $K$-homology class of the de Rham operator on a proper cocompact $G$-spin manifold, where $G$ is an almost connected Lie group. By applying a $G$-invariant Morse-Bott perturbation, this class is localized near the zero set of the perturbation and can be identified explicitly with an element in the representation rings associated to some isotropy subgroups. The result yields an equivariant Poincaré-…

@arXiv_condmatsoft_bot@mastoxiv.page
2025-07-02 08:42:40

Origami of Multi-Layered Spaced Sheets
Guowei Wayne Tu, Evgueni T. Filipov
https://arxiv.org/abs/2507.00341 https://arxiv.org/pdf/250…

Origami of Multi-Layered Spaced Sheets
Two-dimensional (2D) origami tessellations such as the Miura-ori are often generalized to build three-dimensional (3D) architected materials with sandwich or cellular structures. However, such 3D blocks are densely packed with continuity of the internal material, while for many engineering structures with multi-physical functionality, it is necessary to have thin sheets that are separately spaced and sparsely connected. This work presents a framework for the design and analysis of multi-layered…

@arXiv_mathAG_bot@mastoxiv.page
2025-07-01 09:37:13

Compact K\"ahler manifolds with nef anti-canonical bundle
Shin-ichi Matsumura, Juanyong Wang, Xiaojun Wu, Qimin Zhang
https://arxiv.org/abs/2506.23218

Compact Kähler manifolds with nef anti-canonical bundle
In this paper, we prove that a compact Kähler manifold $X$ with the nef anti-canonical bundle $-K_{X}$ admits a locally trivial fibration $ϕ\colon X \to Y$, where the fiber $F$ is a rationally connected manifold and the base $Y$ is a Calabi--Yau manifold. We introduce a suitable approach that extends the strategy of Cao--Höring, originally developed for smooth projective varieties, to more general singular Kähler spaces. A key technical ingredient is a flatness criterion for pseudo-effectiv…

@cowboys@darktundra.xyz
2025-06-26 21:39:46

Former Steelers running back connected to Cowboys in stunning NFL trade proposal https://www.sportingnews.com/us/nfl/pittsburgh-steelers/news/former-steelers-running-back-con…

Former Steelers running back connected to Cowboys in stunning NFL trade proposal
Najee Harris left the Pittsburgh Steelers this offseason to sign a one-year deal with the Los Angeles Chargers. However, an NFL analyst believes Harris could be traded to the Dallas Cowboys at some point in the future.

@netzschleuder@social.skewed.de
2025-06-01 14:00:07

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 108300 nodes and 186936 edges.

arxiv_authors: Arxiv authors (1993-2003). 108300 nodes, 186936 edges. https://networks.skewed.de/net/arxiv_authors#CondMat

arxiv_authors — Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.

@arXiv_mathGT_bot@mastoxiv.page
2025-05-29 07:26:15

Amalgamations along surfaces with boundary in a handlebody
Siqi Ding, Fengchun Lei, Wei Lin, Andrei Vesnin
https://arxiv.org/abs/2505.22530 https://…

Amalgamations along surfaces with boundary in a handlebody
Let M be a connected orientable 3-manifold, and F a compact connected orientable surface properly embedded in M. If F cuts M into two connected 3-manifolds X and Y, that is, M=X \cup_F Y, we say that M is an amalgamation of X and Y along F; and if F cuts M into a connected 3-manifold X, we say that M is a self-amalgamation of X along F. A characterization of an amalgamation of two handlebodies along a surface, incompressible in both, to be a handlebody was obtained by Lei, Liu, Li, and Vesnin. …

@arXiv_mathCO_bot@mastoxiv.page
2025-08-01 09:10:41

The net-regular strongly regular signed graphs with degree 5
Qian Yu, Yaoping Hou
https://arxiv.org/abs/2507.23420 https://arxiv.org/pdf/2507.23420

The net-regular strongly regular signed graphs with degree 5
In this paper, we determine all connected net-regular strongly regular signed graphs with degree 5. There are five and two strongly regular signed graphs with net-degree 3 and 1, respectively.

@arXiv_eessSY_bot@mastoxiv.page
2025-08-01 09:07:21

Energy management and flexibility quantification in a discrete event distribution grid simulation
Sebastian Peter, Daniel Feismann, Johannes Bao, Thomas Oberlie{\ss}en, Christian Rehtanz
https://arxiv.org/abs/2507.23396

Energy management and flexibility quantification in a discrete event distribution grid simulation
Distribution grid operation faces new challenges caused by a rising share of renewable energy sources and the introduction of additional types of loads to the grid. With the increasing adoption of distributed generation and emerging prosumer households, Energy Management Systems, which manage and apply flexibility of connected devices, are gaining popularity. While potentially beneficial to grid capacity, strategic energy management also adds to the complexity of distribution grid operation and…

@arXiv_statML_bot@mastoxiv.page
2025-06-30 09:18:00

Beyond ReLU: How Activations Affect Neural Kernels and Random Wide Networks
David Holzm\"uller, Max Sch\"olpple
https://arxiv.org/abs/2506.22429 …

Beyond ReLU: How Activations Affect Neural Kernels and Random Wide Networks
While the theory of deep learning has made some progress in recent years, much of it is limited to the ReLU activation function. In particular, while the neural tangent kernel (NTK) and neural network Gaussian process kernel (NNGP) have given theoreticians tractable limiting cases of fully connected neural networks, their properties for most activation functions except for powers of the ReLU function are poorly understood. Our main contribution is to provide a more general characterization of t…

@Techmeme@techhub.social
2025-07-27 15:10:34

New York City-based cybersecurity company Axonius acquires Cynerio, which offers healthcare IoT cybersecurity and asset management services, for $180M (Golan Hazani/CTech)
https://www.calcalistech.com/ctechnews/article/hkek009mdle

Cyber unicorn Axonius acquires Cynerio in $180M deal to expand into healthcare security
Move expands company’s offerings amid growing threats to connected medical devices.

@arXiv_mathAG_bot@mastoxiv.page
2025-06-02 07:24:32

A new addition to the zoo of isolated symplectic singularities
Callum Berry
https://arxiv.org/abs/2505.24524 https://arxiv.org/pdf/25…

A new addition to the zoo of isolated symplectic singularities
We give details of a new isolated symplectic singularity found in an affine chart in a crepant partial resolution of $\mathbb{C}^4/G_5$, which is 4-dimensional, isolated, and locally simply-connected. We distinguish the new singularity among all known such by the fact that the projective tangent cone at the singularity is non-reduced. We also find all 12 of its $\mathbb{Q}$-factorial terminalisations, in the process finding 24 for the quotient singularity $\mathbb{C}^4/G_5$.

@arXiv_csDS_bot@mastoxiv.page
2025-06-27 08:32:39

Almost Tight Additive Guarantees for \boldmath $k$-Edge-Connectivity
Nikhil Kumar, Chaitanya Swamy
https://arxiv.org/abs/2506.20906 https://

Almost Tight Additive Guarantees for \boldmath $k$-Edge-Connectivity
We consider the \emph{$k$-edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs $\{c_e\}_{e\in E}$, and we seek a minimum-cost \emph{$k$-edge connected} subgraph $H$ of $G$. For even $k$, we present a polytime algorithm that computes a $(k-2)$-edge connected subgraph of cost at most the optimal value $LP^*$ of the natural LP-relaxation for kECSS; for odd $k$, we obtain a $(k-3)$-edge connected subgraph of cost at most …

@arXiv_mathCO_bot@mastoxiv.page
2025-07-01 10:57:23

Approximate Itai-Zehavi conjecture for random graphs
Lawrence Hollom, Lyuben Lichev, Adva Mond, Julien Portier, Yiting Wang
https://arxiv.org/abs/2506.23970

Approximate Itai-Zehavi conjecture for random graphs
A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and $v$ in different trees are internally vertex-disjoint. We show that with high probability the Itai-Zehavi conjecture holds asymptotically for the Erdős-Rényi random graph $G(n,p)$ when $np= ω(\log n)$ and for random regular graphs $G(n,d)$ when $d= ω(\log …

@arXiv_mathAG_bot@mastoxiv.page
2025-07-29 09:56:22

Bifurcations of polynomial maps with diffeomorphic and connected fibers
Cezar Joi\c{t}a, Mihai Tib\u{a}r
https://arxiv.org/abs/2507.20269 https://arxiv.org…

Bifurcations of polynomial maps with diffeomorphic and connected fibers
We show the existence of polynomial maps which have a regular bifurcation value, while over a neighbourhood of this value the fibres are connected and diffeomorphic.

@arXiv_mathCO_bot@mastoxiv.page
2025-06-02 07:26:03

Vulnerability Measures and Zagreb Indices of Graphs
Sanju Vaidya, Cheng Chang
https://arxiv.org/abs/2505.24707 https://arxiv.org/pdf/…

Vulnerability Measures and Zagreb Indices of Graphs
This paper establishes sharp bounds for the vulnerability measures of closeness and generalized closeness in graphs and identifies graphs that attain these bounds. It further develops bounds incorporating Zagreb indices for triangle- and quadrangle-free graphs, yielding formulas for closeness and generalized closeness in such graphs with diameter at most 3. Moreover, using Zagreb indices, we derive bounds for trees and connected graphs with girth at least 7, which are attained by graphs with di…

@netzschleuder@social.skewed.de
2025-05-31 09:00:04

power: Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.
This network has 4941 nodes and 6594 edges.
Tags: Technological, Power grid, Unweighted
https://networks.…

power — Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.

@netzschleuder@social.skewed.de
2025-05-31 09:00:04

power: Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.
This network has 4941 nodes and 6594 edges.
Tags: Technological, Power grid, Unweighted
https://networks.…

power — Western US Power Grid
A network representing the Western States Power Grid of the United States, in which nodes are transforms or power relay points and two nodes are connected if a power line runs between them.

@netzschleuder@social.skewed.de
2025-06-30 08:00:16

wiki_article_words: Wikipedia article-words (en) (2010)
A bipartite network of English Wikipedia articles and the words they contain. The edge weight gives the number of times a word appeared in the connected article.
This network has 276739 nodes and 2941902 edges.
Tags: Informational, Language, Weighted
https://

wiki_article_words: Wikipedia article-words (en) (2010). 276739 nodes, 2941902 edges. https://networks.skewed.de/net/wiki_article_words

wiki_article_words — Wikipedia article-words (en) (2010)
A bipartite network of English Wikipedia articles and the words they contain. The edge weight gives the number of times a word appeared in the connected article.

@netzschleuder@social.skewed.de
2025-06-28 19:00:05

psi: Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The…

psi — Plant Photosystem I excitation energy transfer network (2020)
Weighted directed network of the light-harvesting Photosystem Ι (PSI) of the plant Pisum sativum. The nodes represent chromophores with different identities (i.e. chlorophyll a, chlorophyll b, β-carotene and derivates, lutein, violaxanthin), while edges represent FRET transfer between chromophores. The link directionality connecting nodes in the PSI network depends on the energy levels of the connected chromophores. The weights correspond to the FRET Efficiency between connected chromophores.

@arXiv_mathCO_bot@mastoxiv.page
2025-06-26 09:05:00

On minors of non-hamiltonian graphs
On-Hei Solomon Lo
https://arxiv.org/abs/2506.20087 https://arxiv.org/pdf/2506.20087

On minors of non-hamiltonian graphs
A theorem of Tutte states that every 4-connected non-hamiltonian graph contains $K_{3,3}$ as a minor. We strengthen this result by proving that such a graph must contain $K_{3,4}$ as a minor, thereby confirming a special case of a conjecture posed by Chen, Yu, and Zang in a strong form. This result may be viewed as a step toward characterizing the minor-minimal 4-connected non-hamiltonian graphs. As a 3-connected analog, Ding and Marshall conjectured that every 3-connected non-hamiltonian graph…

@arXiv_mathAG_bot@mastoxiv.page
2025-06-30 09:23:30

Holomorphic 1-forms without zeros on K\"ahler threefolds
Simon Pietig
https://arxiv.org/abs/2506.22067 https://arxiv.org/pdf/250…

Holomorphic 1-forms without zeros on Kähler threefolds
We classify all smooth compact connected Kähler threefolds that admit the structure of a $C^\infty$-fiber bundle over the circle. This generalizes the work of Hao and Schreieder in the projective case. In contrast to the projective case, there cannot always exist a smooth morphism to a positive-dimensional torus. Instead, we show that such a compact Kähler threefold admits a finite étale cover that is bimeromorphic to a $\mathbb{P}^1$-, $\mathbb{P}^2$-, or Hirzebruch surface-bundle over a lo…

@netzschleuder@social.skewed.de
2025-06-27 19:00:06

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 68746 nodes and 51971 edges.

arxiv_authors — Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.

@netzschleuder@social.skewed.de
2025-06-27 21:00:05

arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 89209 nodes and 237010 edges.

…

arxiv_authors: Arxiv authors (1993-2003). 89209 nodes, 237010 edges. https://networks.skewed.de/net/arxiv_authors#HepPh

arxiv_authors — Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.

@netzschleuder@social.skewed.de
2025-05-31 13:00:05

hiv_transmission: HIV transmission network (1988-2001)
A set of networks of HIV transmissions between people through sexual, needle-sharing, or social connections, based on combining 8 datasets collected from 1988 to 2001. Metadata includes test results of several diseases, as well as demographic variables such as age, ethnicity, and gender. Networks come in two flavors: egodyads and altdyads. Egodyads are the network among study-participants and their direct partners. Altdyads are the…

hiv_transmission: HIV transmission network (1988-2001). 35229 nodes, 85890 edges. https://networks.skewed.de/net/hiv_transmission

hiv_transmission — HIV transmission network (1988-2001)
A set of networks of HIV transmissions between people through sexual, needle-sharing, or social connections, based on combining 8 datasets collected from 1988 to 2001. Metadata includes test results of several diseases, as well as demographic variables such as age, ethnicity, and gender. Networks come in two flavors: egodyads and altdyads. Egodyads are the network among study-participants and their direct partners. Altdyads are the network among people who are connected to the egodyad network. …

@netzschleuder@social.skewed.de
2025-05-31 13:00:05

hiv_transmission: HIV transmission network (1988-2001)
A set of networks of HIV transmissions between people through sexual, needle-sharing, or social connections, based on combining 8 datasets collected from 1988 to 2001. Metadata includes test results of several diseases, as well as demographic variables such as age, ethnicity, and gender. Networks come in two flavors: egodyads and altdyads. Egodyads are the network among study-participants and their direct partners. Altdyads are the…

hiv_transmission — HIV transmission network (1988-2001)
A set of networks of HIV transmissions between people through sexual, needle-sharing, or social connections, based on combining 8 datasets collected from 1988 to 2001. Metadata includes test results of several diseases, as well as demographic variables such as age, ethnicity, and gender. Networks come in two flavors: egodyads and altdyads. Egodyads are the network among study-participants and their direct partners. Altdyads are the network among people who are connected to the egodyad network. …

Tootfinder

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