Results 101 to 110 of about 916,150 (184)

Closing the Empirical Loop: Autonomous AI Agents Conduct End‐to‐end Research With Human Participants

open access: yesAdvanced Science, Volume 13, Issue 56, 9 October 2026.
A multi‐agent AI system autonomously executes the complete scientific workflow, from hypothesis to manuscript, across three psychological studies involving 288 participants. The system designs experiments, collects real world data, develops analysis pipelines, and writes manuscripts with theoretical rigor comparable to experienced researchers.
Gabrielle Wehr   +6 more
wiley   +1 more source

Detection of Bangla AI‐Generated Texts Using a Quantum Kernel Support Vector Machine

open access: yesApplied AI Letters, Volume 7, Issue 3, October 2026.
Fluent AI‐generated text is increasingly hard to tell from human writing and detection tools lag far behind for low‐resource languages such as Bangla. This work presents, to our knowledge, the first quantum‐kernel Support Vector Machine (QSVM) for detecting AI‐generated Bangla text.
Md. Siam Ansary
wiley   +1 more source

Phantom citations: An empirical study of non‐existent and unverifiable references in scholarly literature

open access: yesJournal of the Association for Information Science and Technology, Volume 77, Issue 10, Page 1287-1316, October 2026.
Abstract The integrity of scholarly communication depends critically on the accuracy and verifiability of cited references. Citations enable readers to trace prior work, assess evidence, and situate new contributions within the existing literature. However, concerns have emerged regarding the presence of references in published papers that cannot be ...
Chengcheng Han   +3 more
wiley   +1 more source

Measurement Agreement and Reliability of the 6‐m Gait Speed Test in Adult Population: The ADULT‐FIT Project

open access: yesEuropean Journal of Sport Science, Volume 26, Issue 10, October 2026.
ABSTRACT We aimed to examine: (i) measurement agreement between photoelectric cell system and manual stopwatch timing; (ii) inter‐rater agreement between trained and untrained raters using manual stopwatch timing; and (iii) reliability of the 6‐m gait speed test to assess motor fitness in adults, according to sex, age, and physical activity levels. 410
José Castro‐Piñero   +6 more
wiley   +1 more source

Predicting Solar Photovoltaic Power Output in Saudi Arabia's Jazan Region: Performance Comparison of Machine Learning Models

open access: yesEnergy Science &Engineering, Volume 14, Issue 10, Page 4838-4855, October 2026.
Workflow of the PV power estimation and ML forecasting methodology. ABSTRACT Accurate prediction of solar panel energy output is vital for managing power systems effectively and maintaining a stable electrical grid. This is especially important in regions that rely heavily on renewable sources. This research provides a direct comparison of five machine
Abdoalateef Alzhrani   +4 more
wiley   +1 more source

A Formal Definition of Perfect Bayesian Equilibrium for Extensive Games [PDF]

open access: yes
Often, perfect bayesian equilibrium is loosely defined by stating that players should be sequentially rational given some beliefs in which Bayes rule is applied “whenever possible”.
Miguel Melendez-Jimenez   +1 more
core  

Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs

open access: yesJournal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.
ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) Stefanie Gerke   +3 more
wiley   +1 more source

Robustness of the Sauer–Spencer Theorem

open access: yesRandom Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy