Results 61 to 70 of about 1,309,904 (175)
Listening to tuna: Acoustic characterization of captive juvenile yellowfin tuna (Thunnus albacares)
Journal of Fish Biology, Volume 109, Issue 3, Page 1725-1736, September 2026.Abstract The effectiveness of passive acoustic monitoring (PAM) for studying marine biodiversity highly relies on comprehensive libraries of species‐specific sounds. While sound production is well‐documented in reef and freshwater fishes, the acoustic behaviour of ecologically and economically vital pelagic species like tunas still remains largely ...
Regi Fiji Anggawangsa +10 more
wiley +1 more source
Aquaculture, Fish and Fisheries, Volume 6, Issue 4, August 2026.ABSTRACT This study evaluated the long‐term effects of a dietary humic substance and butyrate blend (HSB) alone or with yeast cell wall (Beta‐MOS) in channel catfish. Around 1440 fish (31.31 ± 0.24 g) were distributed among 12 outdoor tanks in a pond‐supplied flow‐through design. Four dietary treatments were evaluated in triplicate: Diets containing no
Abdulmalik A. Oladipupo +5 more
wiley +1 more source
Human‐in‐the‐Loop Object Segmentation for 3D Gaussian Splatting via Finger‐based VR Interface
Advanced Intelligent Systems, Volume 8, Issue 8, August 2026.This study introduces a human‐in‐the‐loop segmentation framework for 3D Gaussian Splatting that integrates real‐time optimization with intuitive VR‐based finger prompting. Compared with existing automatic, learning‐based methods, it achieves significantly higher accuracy and reduced segmentation time.
Yongseok Lee +5 more
wiley +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +1 more source
Rainbow vertex-connection number of 2-connected graphs
, 2011 The {\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. In this paper we first determine the rainbow vertex-connection number of cycle $C_n$ of order $n\geq ...
Li, Xueliang, Liu, Sujuan
openaire +2 more sources
The Structure of Vertebrate Antigen Receptor Repertoires: An Evolutionary Perspective
Immunological Reviews, Volume 341, Issue 1, August 2026.ABSTRACT In vertebrate adaptive immune systems, somatically diversified antigen receptors assume a central role in self/nonself discrimination. Attesting to the presence of a unique but unknown selective environment at early stages of vertebrate evolution, this facility emerged twice, in the ancestors of jawless and jawed vertebrates.
Thomas Boehm, Orlando B. Giorgetti
wiley +1 more source
On a Ramsey–Turán variant of Roth's theorem
Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.Abstract A classical theorem of Roth states that the maximum size of a solution‐free set of a homogeneous linear equation L$\mathcal {L}$ in Fp$\mathbb {F}_p$ is o(p)$o(p)$ if and only if the sum of the coefficients of L$\mathcal {L}$ is 0. In this paper, we prove a Ramsey–Turán variant of Roth's theorem, with respect to a natural notion of “structured”
Matija Bucić +4 more
wiley +1 more source
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs
Contemporary Mathematics and Applications (ConMathA)Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph.
Muhammad Usaid Hudloir +4 more
doaj +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Journal of the London Mathematical Society, Volume 114, Issue 2, August 2026.Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
On the RACN of the comb product of the cycle C_3 with path P_n and broom Br_(n,m)
Journal Focus Action of Research MathematicThe combination of rainbow coloring and anti-magic labeling is known as Rainbow Antimagic Coloring (RAC). The Rainbow Antimagic Connection Number (RACN) of a graph G is the smallest number of colors induced by all edge weights under an antimagic labeling,
Brian Juned Septory +2 more
doaj +1 more source