@thijs_lucas@norden.social2026-02-08 05:58:57
@andycarolan@social.lol2026-03-07 21:03:11
I’m in love with this album by Mei Semones #Music #Bandcamp #MeiSemones
@radioeinsmusicbot@mastodonapp.uk2026-01-09 04:44:03
🇺🇦 Auf radioeins läuft...
Moscoman & SCUDFM:
🎵 Low Blood Sugar
#NowPlaying #Moscoman #SCUDFM
https://moscoman.bandcamp.com/track/low-blood-sugar-feat-scudfm
https://open.spotify.com/track/3LubKLDT9Nu0uwYGLzAIvm
@randombaywatch@mastodon.social2026-01-09 04:22:00
@cdarwin@c.im2026-03-07 19:49:20
Hours before Khamenei’s compound in Tehran was reduced to rubble last week,
an account under the username “magamyman” bet about $20,000 that the supreme leader would no longer be in power by the end of March.
Polymarket placed the odds at just 14 percent, netting “magamyman” a profit of more than $120,000.
Everyone knew that an attack might be in the works
—some American aircraft carriers had already been deployed to the Middle East weeks ago
—but the Iranian gove…
@memeorandum@universeodon.com2026-01-07 19:45:37
Trump officials loosen strings on federal education money for Iowa. More states could follow (Collin Binkley/Associated Press)
https://apnews.com/article/education-department-iowa-block-grant-mcmahon-trump-bd80ffce0d743e7d77efffc664bb225f
http://www.memeorandum.com/260107/p85#a260107p85
@cosmos4u@scicomm.xyz2026-03-04 23:25:41
So the new #Kreutz #comet #MAPS is *still* following the constant rapid rise in brightness it has shown since discovery: a dumb extrapolation - https://cobs.si/analysis/?comet=2688&from_date=2026-01-15 00:00&to_date=2026-04-30 00:00&observation_type=V&observation_type=C&plot_x_value=1&plot_y_value=1&fit_option=1&exclude_faint=on&exclude_issue=on&observer=&association=&country=&compare_values=compare - has it get 10,000-times brighter than the Sun at its extremely close perihelion which makes so sense at all, of course, physically.
"It must therefore be assumed that this increase in activity will level off significantly in the near future," writes https://fg-kometen.vdsastro.de/koj_2026/c2026a1/26a1eaus.htm: "More likely are parameters m m0=12.0 mag / n=4 (or even lower), which would still result in a (very short-term) maximum brightness of about –9 mag (but this would probably still be significantly too bright) – always assuming that the comet survives its perihelion passage unscathed."
For other views see http://www.cbat.eps.harvard.edu/iau/cbet/005600/CBET005663.txt and https://arxiv.org/abs/2602.17626 and https://www.facebook.com/photo?fbid=10236580364221799 and https://cometografia.es/cometa-kreutz-2026-a1-maps-analisis/ - and the actual brightness is tracked at https://cobs.si/obs_list?id=2688 where it has reached ~11.5 mag. now.
@fortune@social.linux.pizza2026-02-07 12:00:01
/*
* [...] Note that 120 sec is defined in the protocol as the maximum
* possible RTT. I guess we'll have to use something other than TCP
* to talk to the University of Mars.
* PAWS allows us longer timeouts and large windows, so once implemented
* ftp to mars will work nicely.
*/
(from /usr/src/linux/net/inet/tcp.c, concerning RTT [retransmission timeout])
@arXiv_csDS_bot@mastoxiv.page2026-02-09 07:36:02
Fast Makespan Minimization via Short ILPs
Danny Hermelin, Dvir Shabtay
https://arxiv.org/abs/2602.06514 https://arxiv.org/pdf/2602.06514 https://arxiv.org/html/2602.06514
arXiv:2602.06514v1 Announce Type: new
Abstract: Short integer linear programs are programs with a relatively small number of constraints. We show how recent improvements on the running-times of solvers for such programs can be used to obtain fast pseudo-polynomial time algorithms for makespan minimization on a fixed number of parallel machines, and other related variants. The running times of our algorithms are all of the form $\widetilde{O}(p^{O(1)}_{\max} n)$ or $\widetilde{O}(p^{O(1)}_{\max} \cdot n)$, where $p_{\max}$ is the maximum processing time in the input. These improve upon the time complexity of previously known algorithms for moderate values of $p_{\max}$.
toXiv_bot_toot
@arXiv_csGT_bot@mastoxiv.page2025-12-09 07:58:07
Learning Paths to Multi-Sector Equilibrium: Belief Dynamics Under Uncertain Returns to Scale
Stefano Nasini, Rabia Nessah, Bertrand Wigniolle
https://arxiv.org/abs/2512.07013 https://arxiv.org/pdf/2512.07013 https://arxiv.org/html/2512.07013
arXiv:2512.07013v1 Announce Type: new
Abstract: This paper explores the dynamics of learning in a multi-sector general equilibrium model where firms operate under incomplete information about their production returns to scale. Firms iteratively update their beliefs using maximum a-posteriori estimation, derived from observed production outcomes, to refine their knowledge of their returns to scale. The implications of these learning dynamics for market equilibrium and the conditions under which firms can effectively learn their true returns to scale are the key objects of this study. Our results shed light on how idiosyncratic shocks influence the learning process and demonstrate that input decisions encode all pertinent information for belief updates. Additionally, we show that a long-memory (path-dependent) learning which keeps track of all past estimations ends up having a worse performance than a short-memory (path-independent) approach.
toXiv_bot_toot