Results 61 to 70 of about 20,918 (155)
Polymers for Advanced Technologies, Volume 37, Issue 3, March 2026.ABSTRACT Nanocellulose is being increasingly used in biomedical applications because of its biocompatibility, mechanical robustness, tunable surface chemistry, and adjustable rheology. This review evaluates recent strategies for engineering cellulose nanofibrils, nanocrystals, and bacterial nanocellulose into cell‐instructive scaffolds for skin, bone ...
Aurora Rodríguez Martínez +6 more
wiley +1 more source
Cluster Computing and the Power of Edge Recognition
, 2005 We study the robustness--the invariance under definition changes--of the cluster class CL#P [HHKW05]. This class contains each #P function that is computed by a balanced Turing machine whose accepting paths always form a cluster with respect to some ...
Hemaspaandra, Lane A. +2 more
core +1 more source
Constructing National Higher Education Brands: Korea, India and Israel Compared
European Journal of Education, Volume 61, Issue 1, March 2026.ABSTRACT This study examines the websites of the national higher education (HE) brands of Study in Korea, Study in India and Study in Israel, exploring how these ‘offbeat’ destinations position themselves in the global HE market. Drawing on rhetorical analysis and employing a qualitative comparative case study approach, it reveals the key identity ...
Annette Bamberger +2 more
wiley +1 more source
Journal of Management Studies, Volume 63, Issue 2, Page 631-667, March 2026.Abstract The digital revolution is transforming global business practices. As organizations increasingly embed artificial intelligence (AI) within their operations, they face unprecedented uncertainty regarding future technological trajectories and competitive landscapes.
Chi Hon Li +3 more
wiley +1 more source
The strength of Ramsey Theorem for coloring relatively large sets
, 2012 We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.
Carlucci, Lorenzo, Zdanowski, Konrad
core
Approximations of algorithmic and structural complexity validate cognitive-behavioral experimental results. [PDF]
Front Comput Neurosci, 2022 Zenil H, Marshall JAR, Tegnér J.
europepmc +1 more source
The Π₃-theory of the computably enumerable Turing degrees is undecidable
, 1998 S. Lempp, A. Nies, T. Slaman
semanticscholar +1 more source
Foundations of Finitely Supported Structures: A Set Theoretical Viewpoint
, 2020 A. Alexandru, Gabriel Ciobanu
semanticscholar +1 more source
Discussion on the Relationship between Computation, Information, Cognition, and Their Embodiment. [PDF]
Entropy (Basel), 2023 Dodig-Crnkovic G, Miłkowski M.
europepmc +1 more source
Emergence and algorithmic information dynamics of systems and observers. [PDF]
Philos Trans A Math Phys Eng Sci, 2022 Abrahão FS, Zenil H.
europepmc +1 more source