faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …
The FBI raided an elections office in Georgia
and seized ballots from the 2020 presidential election
in connection with a federal investigation into
“deficiencies or defects” into Donald Trump’s loss in the state, according to newly unsealed documents.
An affidavit for the search signed by a judge last month reveals that
the investigation followed a referral from Trump’s former campaign-linked attorney
"Plötzlich Wissen!" ist ein guerilla #WissKomm Projekt von Dr. Julia Schnetzer, Inga Marie Ramcke und mir, gestartet in 2017 (Wissenschaftsjahr 2016*17 Meere und Ozeane), das sich zur Pandemie auf online verlegen musste, einiges hin & her hinter sich hat und immernoch läuft. Heute kam unser Paper darüber raus, im Journal of Science Communication, Sonderedition "
Already 6 years old, so not even taking into account post-2022 hyperscaling, this is a sobering, very rational and well argued 20 min presentation for some cold flush reality check of the hot fever dreams of AI proponents (and all YOLO energy/resource guzzlers of any walk/standing):
Blip (2020)
https://www.youtube.com/watch?v=cd…
An F.B.I. search warrant affidavit unsealed on Tuesday shows that
a criminal investigation into 2020 election results in Fulton County, Ga.,
was set off by a leading election denier in the Trump administration
and relied heavily on claims about ballots that have been widely debunked.
The unsealing of the affidavit in Fulton County is likely to raise more questions
about the Trump administration’s use of the F.B.I. and Justice Department to revive old, largely di…
The Republican former lieutenant governor of North Carolina,
Mark Robinson,
has admitted he "misled" voters during his unsuccessful 2024 gubernatorial campaign
when he denied posting racist and offensive comments on a pornography website
– suggesting he did so to protect Donald Trump’s successful presidential run.
Robinson, who worked in furniture manufacturing before entering politics in 2020, told the "After the Call" podcast on Thursday:
from my link log —
Every Jurassic Park dinosaur illustrated with modern science.
https://jurassicparkterror.net/jurassic-park-dinosaurs/
saved 2020-06-06
Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot
from my link log —
UK public transport API.
https://www.transportapi.com/
saved 2020-02-26 https://dotat.at/:/ZF2L4.html
@netzschleuder@social.skewed.de
