Tootfinder

train_terrorists: Madrid train bombing terrorists (2004)
A network of associations among the terrorists involved in the 2004 Madrid train bombing, as reconstructed from press stories after-the-fact. Edge weights encode four levels of connection strength: friendships, ties to Al Qaeda and Osama Bin Laden, co-participants in wars, and co-participants in previous terrorist attacks.
This network has 64 nodes and 243 edges.
Tags: Social, Offline, Weighted

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

Weak compactness criteria in $L_1$ space in terms of Orlicz function
In this paper, we provide a direct proof for the equivalence of K.M. Chong's and De la Vallée Poussin's criteria of weak compactness of a subset $K$ of $L_1(0,1)$ in terms of some Orlicz function. Furthermore, we discuss the equivalence in $L_1(0, \infty)$.

"Trading Jerry" torpedoed the Cowboys’ 2004 Draft in 1st round https://insidethestar.com/trading-jerry-torpedoed-the-cowboys-2004-draft-in-1st-round/

"Trading Jerry" torpedoed the Cowboys’ 2004 Draft in 1st round ⋆ Inside The Star
Explore the ill-fated draft trade that left Dallas Cowboys fans questioning Jerry Jones' football talent judgment.

Danger Mouse – The Grey Album
20 years ago... the album is made available as a download, for free for one day.
https://www.didiermary.fr/danger-mouse-grey-album/
[…] the first truly popular mashup album (February 2004).Put together by the producer Danger …

Danger Mouse - Grey Album - Didier J. MARY (blog)
The Grey Album is a mashup by Danger Mouse, in 2004, mixing a cappella version of Jay-Z's Black Album with samples from Beatles' 9th album

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

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces. The pieces must be placed so that in the resulting placement, they are pairwise interior-disjoint. We establish a framework which enables us to show that for many combinations of allowed pieces, containers and motions, the resulting problem is $\exists \math…

Blast from the past, if you're interested:
At last we know why the Columbine killers did it.
https://slate.com/news-and-politics/2004/04/at-last-we-know-why-the-columbine-killers-did-it.html

At Last We Know Why the Columbine Killers Did It
Most Americans have reached one of two wrong conclusions.

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

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces. The pieces must be placed so that in the resulting placement, they are pairwise interior-disjoint. We establish a framework which enables us to show that for many combinations of allowed pieces, containers and motions, the resulting problem is $\exists \math…

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

Tuning upstream swimming of micro-robots by shape and cargo size
The navigation of micro-robots in complex flow environments is controlled by rheotaxis, the reorientation with respect to flow gradients. Here we demonstrate how payloads can be exploited to enhance the motion against flows. Using fully resolved hydrodynamic simulations, the mechanisms are described that allow micro-robots of different shapes to reorient upstream. We find that cargo pullers are the fastest at most flow strengths, but pushers feature a non-trivial optimum as a function of the co…

polbooks: Political books network (2004)
A network of books about U.S. politics published close to the 2004 U.S. presidential election, and sold by Amazon.com. Edges between books represent frequent copurchasing of those books by the same buyers. The network was compiled by V. Krebs and is unpublished.
This network has 105 nodes and 441 edges.
Tags: Informational, Relatedness, Unweighted, Metadata

polbooks: Political books network (2004)
A network of books about U.S. politics published close to the 2004 U.S. presidential election, and sold by Amazon.com. Edges between books represent frequent copurchasing of those books by the same buyers. The network was compiled by V. Krebs and is unpublished.
This network has 105 nodes and 441 edges.
Tags: Informational, Relatedness, Unweighted, Metadata