Results 61 to 70 of about 4,373 (234)
Energy Science &Engineering, EarlyView.A real‐time, data‐driven framework detects and classifies photovoltaic array faults using edge sensing and server‐side machine learning. Ensemble tree models achieve near‐perfect accuracy with low latency, enabling practical, low‐cost deployment for reliable PV monitoring and intelligent maintenance.
Premkumar Manoharan +4 more
wiley +1 more source
Expressive Completeness of Existential Rule Languages for Ontology-based Query Answering
, 2016 Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering.
You, Jia-Huai, Zhang, Heng, Zhang, Yan
core
Sticker systems over monoids [PDF]
, 2012 Molecular computing has gained many interests among researchers since Head introduced the first theoretical model for DNA based computation using the splicing operation in 1987.
Fong, Wan Heng +4 more
core
iNew Medicine, Volume 2, Issue 2, June 2026.ABSTRACT High‐grade serous ovarian cancer (HGSOC) is the most common and lethal histological subtype of ovarian cancer. This study aimed to identify peritoneal metastasis‐associated biomarkers of HGSOC to provide directions for subsequent treatment. Transcriptome data were extracted from the GEO database and literature. Differential expression analysis,
Jing Zhu +8 more
wiley +1 more source
The Alignment Risks of AI Overconfidence about Consciousness
Journal of Applied Philosophy, EarlyView.ABSTRACT Many contemporary AI systems (as of May 2025) have expressed extreme confidence in current and near‐future AI lacking consciousness and moral patiency. This article argues that artificially reinforcing such confidence, even if pragmatically useful, poses a novel alignment risk: as coherence‐seeking AIs become more epistemically principled ...
Sharon Berry
wiley +1 more source
Complexity of equivalence relations and preorders from computability theory
, 2013 We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]
Ianovski, Egor +3 more
core +1 more source
Compassion Focused Therapy to Address Shame and Guilt: A Case Study of a Client With Complex PTSD
Journal of Clinical Psychology, EarlyView.ABSTRACT This paper presents the case of “Ava” a woman in her late 40s diagnosed with ICD‐11 Complex Posttraumatic Stress Disorder (CPTSD), whose life was shaped by chronic childhood abuse, pervasive shame, and intense self‐criticism. Ava struggled with intrusive trauma memories, relational hypervigilance, fears of compassion, and enduring guilt ...
Deborah Lee +2 more
wiley +1 more source
On non-recursive trade-offs between finite-turn pushdown automata [PDF]
, 2004 It is shown that between one-turn pushdown automata (1-turn PDAs) and deterministic finite automata (DFAs) there will be savings concerning the size of description not bounded by any recursive function, so-called non-recursive tradeoffs.
Malcher, Andreas
core
JCPP Advances, EarlyView.Abstract Background Identifying interventions for developing language skills in autistic people is a top research priority. To develop effective language interventions, it is essential to understand whether community members feel they are important, acceptable, and meaningful.
Audrey Linden +9 more
wiley +1 more source
On the Number of Membranes in Unary P Systems
, 2009 We consider P systems with a linear membrane structure working on objects over a unary alphabet using sets of rules resembling homomorphisms. Such a restricted variant of P systems allows for a unique minimal representation of the generated unary ...
Freund, Rudolf +2 more
core +2 more sources