Results 211 to 220 of about 107,087 (251)

To vary or not to vary: A flexible empirical Bayes factor for testing variance components

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Random effects are the gold standard for capturing structural heterogeneity, such as individual differences or temporal dependence. Yet testing their presence is difficult because variance components are constrained to be non‐negative, creating a boundary problem. This paper introduces a flexible empirical Bayes factor (EBF) for testing random
Fabio Vieira, Hongwei Zhao, Joris Mulder
wiley   +1 more source

Evaluating Creative Output With Generative Artificial Intelligence: Comparing GPT Models and Human Experts in Idea Evaluation

Creativity and Innovation Management, Volume 34, Issue 4, Page 991-1012, December 2025.
ABSTRACT Traditional techniques for evaluating creative outcomes are typically based on evaluations made by human experts. These methods suffer from challenges such as subjectivity, biases, limited availability, ‘crowding’, and high transaction costs. We propose that large language models (LLMs) can be used to overcome these shortcomings.
Theresa Kranzle, Katelyn Sharratt
wiley   +1 more source

On the path to reference genomes for all biodiversity: lessons learned and laboratory protocols created in the Sanger Tree of Life core laboratory over the first 2000 species

Howard C, Denton A, Jackson B, Bates A, Jay J, Yatsenko H, Raman PS, Thomas A, Oatley G, do Amaral RV, Göktan ZE, Gómez JPN, Lucey IC, Sinclair E, Quail MA, Blaxter M, Howe K, Lawniczak MKN.   +17 more
europepmc   +1 more source

Seeing the Plane: Video Review as a Tool to Improve Total Mesorectal Excision Training

ANZ Journal of Surgery, EarlyView.
Rathin Gosavi, Vignesh Narasimhan, Rebecca Shine, Paul McMurrick, Satish Warrier   +4 more
wiley   +1 more source

Graceful Labellings of Paths

Discrete Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rohan Cattell
exaly   +2 more sources

Graceful Cascading Labelling Algorithm: Construction of Graceful Labelling of Trees

2021 2nd International Conference on Robotics, Electrical and Signal Processing Techniques (ICREST), 2021
The Graceful Labelling of trees is one of the most challenging conjectures in Graph Theory, proudly known as the 'Disease' of Graph Theory which remains a challenge as it remains unsolved. To counter the conjecture, an algorithm is proposed to construct a Graceful Binary Tree and a Graceful Caterpillar Tree.
Dipta Gomes, Md Manzurul Hasan
exaly   +2 more sources

Graceful Labelling of the Union of Paths and Cycles

Discrete Mathematics, 1999
The authors show that \(C_5\cup P_n\) is graceful and \(C_s\cup P_n\) is graceful for every \(s\geq 5\) when \(n\geq (s+ 5)/2\). This result is another step towards settling the conjecture that \(C_s\cup P_n\) is graceful whenever \(n+ s\geq 7\).
S A Choudum
exaly   +3 more sources

ODD GRACEFUL LABELINGS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2009
A graph G = (V(G), E(G)) with q edges is said to be odd graceful if there exists an injection f from V(G) to {0, 1, 2, …, 2q - 1} such that the edge labeling set is {1, 3, 5, …, 2q - 1} with each edge xy assigned the label |f(x) - f(y)|. In this paper, we prove that Pn × Pm (m = 2, 3, 4), generalized crown graphs Cn ⊙ K1,t and gear graphs are odd ...
Zhen-Bin Gao, Xiao-Dong Zhang 0001, Lijuan Xu   +2 more
openaire   +2 more sources

A Note on the Number of Graceful Labellings of Paths

Discrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jozef Siran
exaly   +3 more sources

0-Centred and 0-Ubiquitously Graceful Trees

Discrete Mathematics, 2004
A tree T is k-centred graceful if it has a graceful labelling f such that f assigns the label k to the centre vertex (or one of the centres if the tree has odd diameter); similarly, a graph G is k-ubiquitously graceful if for every vertex v∈V(G) there is
Van Bussel, Frank
exaly   +2 more sources