Development of Electroformed X-Ray Optics Bridging Synchrotron Radiation Technology and Space Astronomy: #FOXSI mission, a US-Japan rocket program to observe the Sun: https://en.nagoya-u.ac.jp/news/articles/japan-delivers-its-sharpest-x-ray-telescope-for-the-foxsi-mission-a-us-japan-rocket-program-to-observe-the-sun/
I'll be in the #fosdem translations dev room this afternoon, speaking about something completely unrelated to my usual topics.
Don't expect a ready to use project though, it's more about sharing a story of creative problem solving. :blobcatartist:
The Wellness Bridge- Bridging Between Western Science And Eastern Energy
A place where modern clinical science meets traditional Eastern movement practices such as Tai Chi and Qigong...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/the-welln…
There’s a second wrinkle to the OP’s critique beyond “abstractions should be better.”
The fundamental thing that makes programming hard is bridging the gap between ambiguous natural language and an unambiguous programming language. That’s hard.
That’s hard partly because the things that make a language unambiguous make such a language deeply unintuitive to humans, no matter how much it resembles English. BUT…
…the other reason it’s hard is that it forces you to decide •exactly• what you want.
Lyα Nebulae in #HETDEX - The Largest Statistical Census Bridging Lyα Halos and Blobs across #CosmicNoon: #Universe Was Full of Hydrogen. Now They’ve Found It: https://hetdex.org/astronomers-thought-the-early-universe-was-full-of-hydrogen-now-theyve-found-it/
Olawale Fabiyi will speak on 'Bridging technical divides in government digital transformation: Lessons from Africa’s smiling coast' as part of our Open Government track at SCaLE 23x. Full details: https://www.socallinuxexpo.org/scale/23x
honestly, i think someone should set up a platform/instance on fedi, with automatic bsky bridging enabled, that looks and acts like bsky does (sans algorithms, tracking, ai, etc. of course). i think that would really help people find their way over, especially now that bsky is kinda dying again
Replaced article(s) found for cs.DS. https://arxiv.org/list/cs.DS/new
[1/1]:
- Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
Vladimir Braverman, Prathamesh Dharangutte, Shreyas Pai, Vihan Shah, Chen Wang
https://arxiv.org/abs/2411.09979 https://mastoxiv.page/@arXiv_csDS_bot/113502653187863544
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
William Kuszmaul
https://arxiv.org/abs/2501.03488 https://mastoxiv.page/@arXiv_csDS_bot/113791396712128907
- The Structural Complexity of Matrix-Vector Multiplication
Emile Anand, Jan van den Brand, Rose McCarty
https://arxiv.org/abs/2502.21240 https://mastoxiv.page/@arXiv_csDS_bot/114097340825270885
- Clustering under Constraints: Efficient Parameterized Approximation Schemes
Sujoy Bhore, Ameet Gadekar, Tanmay Inamdar
https://arxiv.org/abs/2504.06980 https://mastoxiv.page/@arXiv_csDS_bot/114312444050875805
- Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey, Sudeshna Kolay
https://arxiv.org/abs/2505.00296 https://mastoxiv.page/@arXiv_csDS_bot/114437013364446063
- Fast and Simple Densest Subgraph with Predictions
Thai Bui, Luan Nguyen, Hoa T. Vu
https://arxiv.org/abs/2505.12600 https://mastoxiv.page/@arXiv_csDS_bot/114538936921930134
- Compressing Suffix Trees by Path Decompositions
Becker, Cenzato, Gagie, Kim, Koerkamp, Manzini, Prezza
https://arxiv.org/abs/2506.14734 https://mastoxiv.page/@arXiv_csDS_bot/114703384646892523
- Improved sampling algorithms and functional inequalities for non-log-concave distributions
Yuchen He, Zhehan Lei, Jianan Shao, Chihao Zhang
https://arxiv.org/abs/2507.11236 https://mastoxiv.page/@arXiv_csDS_bot/114862112197588124
- Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
Peter Robinson, Ming Ming Tan
https://arxiv.org/abs/2507.11257 https://mastoxiv.page/@arXiv_csDS_bot/114862223634372292
- Optimally detecting uniformly-distributed $\ell_2$ heavy hitters in data streams
Santhoshini Velusamy, Huacheng Yu
https://arxiv.org/abs/2509.07286 https://mastoxiv.page/@arXiv_csDS_bot/115178875220889588
- Uncrossed Multiflows and Applications to Disjoint Paths
Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
https://arxiv.org/abs/2511.00254 https://mastoxiv.page/@arXiv_csDS_bot/115490402963680492
- Dynamic Matroids: Base Packing and Covering
Tijn de Vos, Mara Grilnberger
https://arxiv.org/abs/2511.15460 https://mastoxiv.page/@arXiv_csDS_bot/115580946319285096
- Branch-width of connectivity functions is fixed-parameter tractable
Tuukka Korhonen, Sang-il Oum
https://arxiv.org/abs/2601.04756 https://mastoxiv.page/@arXiv_csDS_bot/115864074799755995
- CoinPress: Practical Private Mean and Covariance Estimation
Sourav Biswas, Yihe Dong, Gautam Kamath, Jonathan Ullman
https://arxiv.org/abs/2006.06618
- The Ideal Membership Problem and Abelian Groups
Andrei A. Bulatov, Akbar Rafiey
https://arxiv.org/abs/2201.05218
- Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
Daksh Shami
https://arxiv.org/abs/2407.19575 https://mastoxiv.page/@arXiv_quantph_bot/112874282709517475
- Young domination on Hamming rectangles
Janko Gravner, Matja\v{z} Krnc, Martin Milani\v{c}, Jean-Florent Raymond
https://arxiv.org/abs/2501.03788 https://mastoxiv.page/@arXiv_mathCO_bot/113791421814248215
- On the Space Complexity of Online Convolution
Joel Daniel Andersson, Amir Yehudayoff
https://arxiv.org/abs/2505.00181 https://mastoxiv.page/@arXiv_csCC_bot/114437005955255553
- Universal Solvability for Robot Motion Planning on Graphs
Anubhav Dhar, Pranav Nyati, Tanishq Prasad, Ashlesha Hota, Sudeshna Kolay
https://arxiv.org/abs/2506.18755 https://mastoxiv.page/@arXiv_csCC_bot/114737342714568702
- Colorful Minors
Evangelos Protopapas, Dimitrios M. Thilikos, Sebastian Wiederrecht
https://arxiv.org/abs/2507.10467
- Learning fermionic linear optics with Heisenberg scaling and physical operations
Aria Christensen, Andrew Zhao
https://arxiv.org/abs/2602.05058
toXiv_bot_toot
Yes, let's try to re-implement source route bridging like we had in big flat token ring networks, that sounds awesome! Scionot. :-)
✨ SIG-Marcomms and SIG-MSP Joint Meeting Recap ✨
Earlier this month, NRENs gathered in Lisbon for two days of shared learning across two Special Interest Groups (SIGs).
The question that ran through both days: what changes when the people who build services and the people who communicate them work together from the very beginning?
🔗 Read the full recap:
Bridging Distant Ideas: the Impact of AI on R&D and Recombinant Innovation
Emanuele Bazzichi, Massimo Riccaboni, Fulvio Castellacci
https://arxiv.org/abs/2604.02189 https://arxiv.org/pdf/2604.02189 https://arxiv.org/html/2604.02189
arXiv:2604.02189v1 Announce Type: new
Abstract: We study how artificial intelligence (AI) affects firms' incentives to pursue incremental versus radical knowledge recombinations. We develop a model of recombinant innovation embedded in a Schumpeterian quality-ladder framework, in which innovation arises from recombining ideas across varying distances in a knowledge space. R&D consists of multiple tasks, a fraction of which can be performed by AI. AI facilitates access to distant knowledge domains, but at the same time it also increases the aggregate rate of creative destruction, shortening the monopoly duration that rewards radical innovations. Moreover, excessive reliance on AI may reduce the originality of research and lead to duplication of research efforts. We obtain three main results. First, higher AI productivity encourages more distant recombinations, if the direct facilitation effect is stronger than the indirect effect due to intensified competition from rivals. Second, the effect of increasing the share of AI-automated R&D tasks is non-monotonic: firms initially target more radical innovations, but beyond a threshold of human-AI complementarity, they shift the focus toward incremental innovations. Third, in the limiting case of full automation, the model predicts that optimal recombination distance collapses to zero, suggesting that fully AI-driven research would undermine the very knowledge creation that it seeks to accelerate.
toXiv_bot_toot
Translational Research and Teaching: Bridging Knowledge, Practice, and Community
https://ift.tt/baPmLiD
updated: Monday, March 30, 2026 - 3:04pmfull name / name of organization: Association for…
via Input 4 RELCFP …
ProphetKV: User-Query-Driven Selective Recomputation for Efficient KV Cache Reuse in Retrieval-Augmented Generation
Shihao Wang, Jiahao Chen, Yanqi Pan, Hao Huang, Yichen Hao, Xiangyu Zou, Wen Xia, Wentao Zhang, Haitao Wang, Junhong Li, Chongyang Qiu, Pengfei Wang
https://arxiv.org/abs/2602.02579 https://arxiv.org/pdf/2602.02579 https://arxiv.org/html/2602.02579
arXiv:2602.02579v1 Announce Type: new
Abstract: The prefill stage of long-context Retrieval-Augmented Generation (RAG) is severely bottlenecked by computational overhead. To mitigate this, recent methods assemble pre-calculated KV caches of retrieved RAG documents (by a user query) and reprocess selected tokens to recover cross-attention between these pre-calculated KV caches. However, we identify a fundamental "crowding-out effect" in current token selection criteria: globally salient but user-query-irrelevant tokens saturate the limited recomputation budget, displacing the tokens truly essential for answering the user query and degrading inference accuracy.
We propose ProphetKV, a user-query-driven KV Cache reuse method for RAG scenarios. ProphetKV dynamically prioritizes tokens based on their semantic relevance to the user query and employs a dual-stage recomputation pipeline to fuse layer-wise attention metrics into a high-utility set. By ensuring the recomputation budget is dedicated to bridging the informational gap between retrieved context and the user query, ProphetKV achieves high-fidelity attention recovery with minimal overhead. Our extensive evaluation results show that ProphetKV retains 96%-101% of full-prefill accuracy with only a 20% recomputation ratio, while achieving accuracy improvements of 8.8%-24.9% on RULER and 18.6%-50.9% on LongBench over the state-of-the-art approaches (e.g., CacheBlend, EPIC, and KVShare).
toXiv_bot_toot
Crosslisted article(s) found for cs.GR. https://arxiv.org/list/cs.GR/new
[1/1]:
- Optimization and Mobile Deployment for Anthropocene Neural Style Transfer
Po-Hsun Chen, Ivan C. H. Liu
https://arxiv.org/abs/2601.21141 https://mastoxiv.page/@arXiv_csHC_bot/115983012560898066
- HiFi-Mesh: High-Fidelity Efficient 3D Mesh Generation via Compact Autoregressive Dependence
Yanfeng Li, Tao Tan, Qingquan Gao, Zhiwen Cao, Xiaohong liu, Yue Sun
https://arxiv.org/abs/2601.21314 https://mastoxiv.page/@arXiv_csCV_bot/115983484680840673
- Synthetic-to-Real Domain Bridging for Single-View 3D Reconstruction of Ships for Maritime Monitoring
Borja Carrillo-Perez, Felix Sattler, Angel Bueno Rodriguez, Maurice Stephan, Sarah Barnes
https://arxiv.org/abs/2601.21786 https://mastoxiv.page/@arXiv_csCV_bot/115983653113440181
- EditYourself: Audio-Driven Generation and Manipulation of Talking Head Videos with Diffusion Tran...
Flynn, Paier, Dinev, Nguyen, Poghosyan, Toribio, Banerjee, Gafni
https://arxiv.org/abs/2601.22127 https://mastoxiv.page/@arXiv_csCV_bot/115983720617201966
toXiv_bot_toot
Replaced article(s) found for physics.chem-ph. https://arxiv.org/list/physics.chem-ph/new
[1/1]:
- Proposal on the Calculation of the Ionisation-Cluster Size Distribution (I). The Model and Its Si...
Bernd Heide
https://arxiv.org/abs/2404.03961 https://mastoxiv.page/@arXiv_physicscompph_bot/112234374992126208
- Bridging chemistry and Gaussian boson sampling: A photonic hierarchy of approximations for molecu...
Jan-Lucas Eickmann, et al.
https://arxiv.org/abs/2507.19442 https://mastoxiv.page/@arXiv_quantph_bot/114930272911651358
- Benchmarking Universal Machine Learning Interatomic Potentials for Supported Nanoparticles: Decou...
Jiayan Xu, Abhirup Patra, Amar Deep Pathak, Sharan Shetty, Detlef Hohl, Roberto Car
https://arxiv.org/abs/2512.05221 https://mastoxiv.page/@arXiv_condmatmtrlsci_bot/115683143867496047
- Knowledge Distillation of a Protein Language Model Yields a Foundational Implicit Solvent Model
Justin Airas, Bin Zhang
https://arxiv.org/abs/2601.05388 https://mastoxiv.page/@arXiv_physicsbioph_bot/115881090848393264
- Universal Foundations of Thermodynamics: Entropy and Energy Beyond Equilibrium and Without Extens...
Gian Paolo Beretta
https://arxiv.org/abs/2602.09986 https://mastoxiv.page/@arXiv_quantph_bot/116051530776008418
toXiv_bot_toot
Bridging Distant Ideas: the Impact of AI on R&D and Recombinant Innovation
Emanuele Bazzichi, Massimo Riccaboni, Fulvio Castellacci
https://arxiv.org/abs/2604.02189 https://…
Application of the aperiodic defect model to a negatively charged monovacancy in phosphorene
Charlotte Rickert, Lily Barta, Ernst-Christian Flach, Daniel Kats, Denis Usvyat
https://arxiv.org/abs/2603.23761 https://arxiv.org/pdf/2603.23761 https://arxiv.org/html/2603.23761
arXiv:2603.23761v1 Announce Type: new
Abstract: We apply the recently introduced aperiodic defect model (ADM) to a negatively charged monovacancy in a phosphorene monolayer. In contrast to conventional supercell approaches, the ADM treats a single defect embedded in the true non-defective crystalline mean field thereby avoiding spurious defect-defect interactions and the need for charge corrections. At the same time, it effectively reduces the calculation to a fragment, enabling the use of high-level molecular electronic-structure methods. Converging the Hartree-Fock and correlation contributions to the thermodynamic limit yields a benchmark CCSD(T)/POB-TZVP-rev2 formation energy of 0.91 eV for the negatively charged monovacancy in the (5|9) configuration. The excitation energy to the lowest singlet excited state of this defect at the EOM-CCSD/POB-TZVP-rev2 level is found to be 1.95 eV. Overall, the ADM provides a highly promising route towards quantitatively accurate and systematically improvable descriptions of defects in solids and on surfaces, bridging the gap between solid-state physics and molecular quantum chemistry.
toXiv_bot_toot