Results 61 to 70 of about 1,728 (218)

Implementing multidomain non‐pharmaceutical interventions for preventing cognitive decline in community‐dwelling older adults in China: An embedded mixed‐methods implementation study of determinants and strategies

open access: yesAlzheimer's &Dementia, Volume 22, Issue 6, June 2026.
Abstract INTRODUCTION The WW‐FINGERS network has demonstrated the efficacy of multidomain non‐pharmaceutical interventions (NPIs) but left their real‐world implementation largely unexplored, prompting this study in Changxing County to identify key determinants and develop actionable strategies for community‐based delivery.
Zishuo Huang   +8 more
wiley   +1 more source

Text Mining in Bibliometrics and Science Mapping: A Methodological Review

open access: yesWIREs Computational Statistics, Volume 18, Issue 2, June 2026.
Text mining has become a foundational component of contemporary bibliometrics and science mapping, enabling systematic analysis of the semantic structure, thematic evolution, and cognitive organization of scientific fields. Integrating textual evidence with relational indicators enriches knowledge maps and supports more comprehensive, content‐sensitive
Michelangelo Misuraca
wiley   +1 more source

Survey‐Based Research for Creativity and Innovation Management: Review and Recommendations

open access: yesCreativity and Innovation Management, Volume 35, Issue 2, Page 395-410, June 2026.
ABSTRACT Survey methodology remains a widely used data collection method in creativity and innovation management studies. However, evolving technological advancements and methodological challenges necessitate a reassessment of best practices to benefit the most from it.
Marco Mismetti   +2 more
wiley   +1 more source

Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras [PDF]

open access: yes, 2016
© 2016 Springer Science+Business Media New YorkIt is proved that for every computable ordinal α, the Turing degree 0(α) is a degree of autostability of some computable Boolean algebra and is also a degree of autostability relative to strong ...
Bazhenov N.
core  

Completeness of Boolean powers of Boolean algebras

open access: yesJournal of the Mathematical Society of Japan, 1988
For complete Boolean algebras A and B, let A[B] denote the Boolean power of A by B. This paper investigates conditions under which A[B] is a complete Boolean algebra, using techniques of Boolean valued models. The link between this problem and Boolean valued models is provided by a result of \textit{R. M. Solovay} and \textit{S. Tennenbaum} [Ann. Math.,
openaire   +2 more sources

Understanding Nurses' Intention to Use Artificial Intelligence Technologies in Their Clinical Practice: A Survey‐Based Configurational Analysis

open access: yesJournal of Advanced Nursing, Volume 82, Issue 6, Page 6220-6230, June 2026.
ABSTRACT Aims The study focused on nurses' familiarity with, beliefs about, and attitudes towards artificial intelligence, aiming to identify configurations of necessary and sufficient conditions associated with strong intentions to use artificial intelligence‐based health technologies in their clinical practice. Design Cross‐sectional survey conducted
Louis Raymond   +3 more
wiley   +1 more source

Independent families in complete Boolean algebras

open access: yes, 1982
We present a proof (without any set-theoretical assumptions) that every infinite complete Boolean algebra includes a free subalgebra of the same cardinality. It follows that the set of all ultrafilters on an infinite complete Boolean algebra B
B. Balcar, F. Franěk
core   +1 more source

Noncommutativity as a colimit [PDF]

open access: yes, 2011
We give substance to the motto “every partial algebra is the colimit of its total subalgebras” by proving it for partial Boolean algebras (including orthomodular lattices), the new notion of partial C*-algebras (including noncommutative C*-algebras), and
van den Berg, Benno   +7 more
core   +1 more source

Heights of Butterfly Trees

open access: yesRandom Structures &Algorithms, Volume 68, Issue 3, May 2026.
ABSTRACT Binary search trees (BSTs) are fundamental data structures whose performance is largely governed by tree height. We introduce a block model for constructing BSTs by embedding internal BSTs into the nodes of an external BST—a structure motivated by parallel data architectures—corresponding to composite permutations formed via Kronecker or ...
John Peca‐Medlin, Chenyang Zhong
wiley   +1 more source

Criterion for the cosemanticness of the Abelian groups in the enriched signature

open access: yesҚарағанды университетінің хабаршысы. Математика сериясы, 2018
In the present paper we give a criterion of the cosemanticness relative to the Jonsson spectrum of the model in the class of Abelian groups with a distinguished predicate.
A.R. Yeshkeyev   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy