Results 41 to 50 of about 79,195 (126)
Optimal accessing and non-accessing structures for graph protocols
, 2011 An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D.
Gravier, Sylvain +3 more
core +1 more source
Modern Theology, EarlyView.Abstract This essay, designed as a complement to opinions expressed by Rowan Williams and some speakers at the conference in his honour, explores features of early Christianity which suggest a positive evaluation of artificial intelligence. Noting that the fear of reducing humans to machines has been joined in the modern age by the fear that machines ...
Mark J. Edwards
wiley +1 more source
Why Are All the Sets All the Sets?
Noûs, EarlyView.ABSTRACT Necessitists about set theory think that the pure sets exists, and are the way they are, as a matter of necessity. They cannot explain why the sets (de rebus) are all the sets. This constitutes the Ur‐Objection against necessitism; it is the primary motivation cited by potentialists about set theory.
Tim Button
wiley +1 more source
Systemic risk in the insurance sector: A semi‐parametric approach based on Spearman's rho
Risk Management and Insurance Review, EarlyView.Abstract We propose a new method to measure systemic risk in the global insurance sector by analyzing interconnectedness among firms under different market conditions. Using a semi‐parametric approach that relies on the Spearman correlation and copula‐based partial dependence, we assess relationships in relatively stable, extremely bullish, and ...
Leonardo Iania +2 more
wiley +1 more source
Exploring 2D Geometric Shape Classification Using AI‐Driven Feature Tables in Mathematics
School Science and Mathematics, EarlyView.ABSTRACT This study explored the effectiveness of an AI‐integrated instructional task designed to enhance preservice teachers' understanding of the features and hierarchical relationships of 2D geometric shapes. Originally developed and tested in online K‐12 professional development settings, this intervention was adapted for in‐person preservice ...
Yasemin Gunpinar, Woonhee Sung
wiley +1 more source
Expert Systems, Volume 43, Issue 3, March 2026.ABSTRACT Modelling the evolution of Alzheimer's disease (AD) requires a thorough spatiotemporal study of longitudinal neuroimaging data. We propose in this paper a novel deep learning framework that uses a parallel combination of Recurrent Neural Networks (RNNs) and Vision Transformers (ViT) to extract temporal disease dynamics and spatial structural ...
Sahbi Bahroun, Gwanggil Jeon
wiley +1 more source
Dimer models and conformal structures
Communications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala +3 more
wiley +1 more source
Identifying Causal Genotype–Phenotype Relationships for Population‐Sampled Parent–Child Trios
Genetic Epidemiology, Volume 50, Issue 1, February 2026.ABSTRACT The process by which genes are transmitted from parent to child provides a source of randomization preceding all other factors that may causally influence any particular child phenotype. Because of this, it is natural to consider genetic transmission as a source of experimental randomization.
Yushi Tang +2 more
wiley +1 more source
The DNA of Calabi–Yau Hypersurfaces
Fortschritte der Physik, Volume 74, Issue 2, February 2026.Abstract Genetic Algorithms are implemented for triangulations of four‐dimensional reflexive polytopes, which induce Calabi–Yau threefold hypersurfaces via Batyrev's construction. These algorithms are shown to efficiently optimize physical observables such as axion decay constants or axion–photon couplings in string theory compactifications.
Nate MacFadden +2 more
wiley +1 more source
Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes
, 2018 The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered.
Gledel, Valentin, Iršič, Vesna
core