Lmst

Metagenomics Research Scientist

Quadram Institute Bioscience

Applications are invited for a Research Scientist to join the Laboratory of Dr Hildebrand at the Quadram Institute Bioscience (QIB), Norwich, UK.

See the full job description on jobRxiv: https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96534

#gut_microbiome #microbiology #p...
https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96534

The Complexity of Counting Small Sub-Hypergraphs

Marco Bressan, Julian Brinkmann, Holger Dell, Marc Roth, Philip Wellnitz
https://arxiv.org/abs/2506.14081 https://arxiv.org/pdf/2506.14081 https://arxiv.org/html/2506.14081

arXiv:2506.14081v1 Announce Type: new
Abstract: Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by investigating the most basic sub-hypergraph counting problem: given a (small) hypergraph $H$ and a (large) hypergraph $G$, compute the number of sub-hypergraphs of $G$ isomorphic to $H$. Formally, for a family $\mathcal{H}$ of hypergraphs, let #Sub($\mathcal{H}$) be the restriction of the problem to $H \in \mathcal{H}$; the induced variant #IndSub($\mathcal{H}$) is defined analogously. Our main contribution is a complete classification of the complexity of these problems. Assuming the Exponential Time Hypothesis, we prove that #Sub($\mathcal{H}$) is fixed-parameter tractable if and only if $\mathcal{H}$ has bounded fractional co-independent edge-cover number, a novel graph parameter we introduce. Moreover, #IndSub($\mathcal{H}$) is fixed-parameter tractable if and only if $\mathcal{H}$ has bounded fractional edge-cover number. Both results subsume pre-existing results for graphs as special cases. We also show that the fixed-parameter tractable cases of #Sub($\mathcal{H}$) and #IndSub($\mathcal{H}$) are unlikely to be in polynomial time, unless respectively #P = P and Graph Isomorphism $\in$ P. This shows a separation with the special case of graphs, where the fixed-parameter tractable cases are known to actually be in polynomial time.

toXiv_bot_toot

New magnetic phenomenon observed – breakthrough in future data storage
https://kocka.news/en/article/hardware/293/new-magnetic-phenomenon-observed-breakthrough-in-future-data-storage

#p-wave #magnetism

Új mágneses jelenséget figyeltek meg – áttörés a jövő adattárolásában
https://kocka.news/hu/article/hardver/292/uj-magneses-jelenseget-figyeltek-meg-attores-a-jovo-adattarolasaban

#p-hullám #mágnes

Game 74: Detroit Tigers vs. Pittsburgh Pirates, 6:40 p.m. https://www.rawchili.com/mlb/111585/ #Baseball #bless #boys #Detroit #DetroitTigers #DetroitTigers #ExcludeFromStnVideo #FrontPage #game #GameThreads #m #MLB #p #pirates #Pittsburgh #Tigers #vs #you

A Compendium of Subset Search Problems and Reductions relating to the Parsimonious Property

Celina Janet Bartlett
https://arxiv.org/abs/2506.12255 https://arxiv.org/pdf/2506.12255 https://arxiv.org/html/2506.12255

arXiv:2506.12255v1 Announce Type: new
Abstract: This thesis centers around the concept of Subset Search Problems (SSP), a type of computational problem introduced by Gr\"une and Wulf to analyze the complexity of more intricate optimization problems. These problems are given an input set, a so-called universe, and their solution lies within their own universe, e.g. the shortest path between two point is a subset of all possible paths. Due to this, reductions upholding the SSP property require an injective embedding from the universe of the first problem into that of the second. This, however, appears inherently similar to the concept of a Parsimonious reduction, a reduction type requiring a bijective function between the solution spaces of the two problems. Parsimonious reductions are mainly used within the complexity class #P, as this class of problems concerns itself with the number of possible solutions in a given problem. These two concepts, SSP and Parsimonious reductions, are inherently similar but, crucially, not equivalent. We therefore explore the interplay between reductions upholding the SSP and Parsimonious properties, highlighting both the similarities and differences by providing a comprehensive theorem delineating the properties required for reductions to uphold both attributes. We also compile and evaluate 46 reductions between 30 subset search variants of computational problems, including those of classic NP-complete problems such as Satisfiability, Vertex Cover, Hamiltonian Cycle, the Traveling Salesman Problem and Subset Sum, providing reduction proofs, illustrative examples and insights as to where the SSP and Parsimonious properties coexist or diverge. With this compendium we contribute to the understanding of the computational complexity of bilevel and robust optimization problems, by contributing a vast collection of proven SSP- and #P-complete problems.

toXiv_bot_toot

#PlaneAlert ICAO: #405F7F Tail: #GLPIN
Owner: #Private
Aircraft: #P & M Aviation QuikR
2025-06-17 10:15:21 CEST
#ULAC #PeopleBeCrazy #Ultralight #NopeMobile http://www.pmaviationusa.com/
https://globe.adsbexchange.com/?icao=405F7F&zoom=7&lat=53.017319&lon=7.586136&timestamp=1750148121&showTrace=2025-06-17

#adsb #planefence #planealert by kx1t - https://sdr-e.com/docker-planefence

Metagenomics Research Scientist

Quadram Institute Bioscience

Applications are invited for a Research Scientist to join the Laboratory of Dr Hildebrand at the Quadram Institute Bioscience (QIB), Norwich, UK.

See the full job description on jobRxiv: https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96457

#gut_microbiome #microbiology #p...
https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96457

Metagenomics Research Scientist

Quadram Institute Bioscience

Applications are invited for a Research Scientist to join the Laboratory of Dr Hildebrand at the Quadram Institute Bioscience (QIB), Norwich, UK.

See the full job description on jobRxiv: https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96457

#gut_microbiome #microbiology #p...
https://jobrxiv.org/job/quadram-institute-bioscience-27778-metagenomics-research-scientist/?feed_id=96457

Facing a labor crisis, Japan’s food industry is embracing #KitchenAutomation. Tokyo startup #TechMagic leads the way with cooking robots like #iRobo and #P-Robo, revolutionizing kitchens and preserving culinary heritage.

https://joelhu.medium.com/tech-magic-and-japans-culinary-automation-revolution-in-2025-28ff25a01b81?sk=0c63808f84731ec2370e2107c8bdc116

Game 73: Detroit Tigers vs. Cincinnati Reds, 12:05 p.m. https://www.rawchili.com/mlb/105981/ #Baseball #bless #boys #Cincinnati #CincinnatiReds #CincinnatiReds #Detroit #ExcludeFromStnVideo #FrontPage #game #GameThreads #m #MLB #p #Reds #Tigers #vs #you

Mariners J.P. Crawford sees improvements in using whole field approach https://www.rawchili.com/mlb/104666/ #approach #Baseball #Crawford #ExcludeFromStnVideo #Field #FrontPage #Improvements #in #J. #landing #lookout #Mariners #MLB #p #Seattle #SeattleMariners #SeattleMariners #sees #using #whole

Game 72: Detroit Tigers vs. Cincinnati Reds, 1:10 p.m. https://www.rawchili.com/mlb/104025/ #Baseball #bless #boys #Cincinnati #CincinnatiReds #CincinnatiReds #Detroit #ExcludeFromStnVideo #FrontPage #game #GameThreads #m #MLB #p #Reds #Tigers #vs #you

Here are all the ‘No Kings’ demonstration locations in Los Angeles on Saturday https://www.rawchili.com/nhl/74790/ #A.M. #AdaStandardDetail #day #DemonstrationLocation #FlatGround #GlendaleCityHallTime #Hockey #HotelDena #Kings #LA #LAKings #LAKings #LosAngeles #LosAngelesAreaSaturday #LosAngelesKings #LosAngeles #LosAngelesKings #MoreInfo #NHL #NoKing #P.m.Accessibility #saturday #stair #StepDetail

Nimeni făcând bine, să nu se fălească, căci toți cei ce s-au nădăjduit în sineși, au căzut Zis-a avva Xantie: tâlharul pe Cruce era și dintr-un cuvânt s-a îndreptat. Și Iuda cu apostolii era împreună numărat și într-o noapte a prăpădit toată osteneala și s-a pogorât din ceruri în iad. Drept aceea, nimeni făcând bine, să nu se fălească, căci toți cei ce s-au nădăjduit în sineși, au căzut. Extras din ”Patericul”, […] 👉 https://c.aparatorul.md/kojm8 👈 #AvvaXantie #p...
https://c.aparatorul.md/kojm8