Results 151 to 160 of about 24,012 (274)
Super-Turing synaptic resistor circuits for intelligent morphing wing. [PDF]
Deo A+11 more
europepmc +1 more source
Making Informed Decisions about Chemicals But Is It Ture? A Citizen's Guide to Environmental Health and Safety Issues Aaron Wildavsky [PDF]
Resha M. Putzrath
openalex +1 more source
Evaluating Reinforcement Learning Agents for Autonomous Cyber Defence
ABSTRACT Artificial Intelligence (AI) is set to become an essential tool for defending against machine‐speed attacks on increasingly connected cyber networks and systems. It will allow self‐defending and self‐recovering cyber‐defence agents to be developed, which can respond to attacks in a timely manner.
Abby Morris+2 more
wiley +1 more source
Induction of host genes by nested genes during C. elegans development
Summary: Embryonic development relies on tightly controlled gene expression. In this study, we analyzed the transcriptional effect during C. elegans development of a striking genomic topology, the opposite nested configuration, where a gene is located in
Fabien Soulavie+6 more
doaj
Visible-to-infrared photoabsorption in supermolecule-induced Turing-structured perovskite hybrid semiconductors. [PDF]
Gao P+8 more
europepmc +1 more source
Transmission and spectral aspects of tight-binding Hamiltonians for the counting quantum Turing machine [PDF]
Paul Benioff
openalex +1 more source
Generic Quantum‐Safe IIoT Forensics Framework (QS‐IIoT‐F) ABSTRACT The continuous evolution of quantum computing has shown novel and transformative possibilities and critical implications for the Industrial Internet of Things (IIoT) forensic processes.
Victor R. Kebande
wiley +1 more source
Pattern Formation as a Resilience Mechanism in Cancer Immunotherapy. [PDF]
Brennan M+3 more
europepmc +1 more source
Primate theory of mind is a Turing test [PDF]
Robert W. Mitchell, James R. Anderson
openalex +1 more source
The Generic Circular Triangle‐Free Graph
ABSTRACT In this article, we introduce the generic circular triangle‐free graph C 3 and propose a finite axiomatization of its first‐order theory. In particular, our main results show that a countable graph G embeds into C 3 if and only if it is a { K 3 , K 1 + 2 K 2 , K 1 + C 5 , C 6 }‐free graph.
Manuel Bodirsky, Santiago Guzmán‐Pro
wiley +1 more source