Results 181 to 190 of about 9,033 (258)

Verbal Metadisputes

Philosophy and Phenomenological Research, Volume 113, Issue 1, Page 153-168, July 2026.
ABSTRACT Many philosophical disputes have become so intractable that philosophers question whether there is a fact of the matter as to which side is right or whether these disputes are entirely verbal. Yet these “metadisputes” have also become intractable. This raises the question: Could they, too, be verbal? What would that even mean? Using tools from
Alexander W. Kocurek
wiley   +1 more source

UniqueNOSD: a novel framework for NoSQL over SQL databases. [PDF]

J Big Data
Gidado AA, Ezeife CI.
europepmc   +1 more source

Sparse Warcasting

Scottish Journal of Political Economy, Volume 73, Issue 3, July 2026.
ABSTRACT Forecasting economic activity during institutional collapse requires nowcasts derived exclusively from alternative data sources. Such sources are abundant yet theoretically unanchored and potentially weakly informative. This study examines whether sparse supervised dimension reduction extracts reliable signals in a context rich in data but ...
Mihnea Constantinescu
wiley   +1 more source

A novel multi-stage attack dataset for smart home intrusion detection. [PDF]

Data Brief
Das V, Nair BB.
europepmc   +1 more source

On the Auslander–Reiten theory for extended hearts of proper connective dg algebras

Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We prove that, for a proper connective dg algebra A$A$ with cohomology concentrated in degrees between 1−d$1-d$ and 0, the extended heart Dfd(A)(−d,0]⊆Dfd(A)$\mathcal {D}^{\mathrm{fd}}(A)^{(-d,0]}\subseteq \mathcal {D}^{\mathrm{fd}}(A)$ is an extriangulated category with almost‐split conflations.
Nao Mochizuki, Marvin Plogmann
wiley   +1 more source

Intelligent Service Chain Orchestration and Resource Allocation in End-Edge Collaborative IIoT Using Multi-Agent Proximal Policy Optimization. [PDF]

Sensors (Basel)
Zhao T, Tian B, Wang L, Ma W, Wei B.
europepmc   +1 more source

The sequential (distributional) topological complexity of the ordered configuration space of disks in a strip

Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract How hard is it to program n$n$ robots to move about a long narrow aisle while making a series of r−2$r-2$ intermediate stops, provided only w$w$ of the robots can fit across the width of the aisle? In this paper, we answer this question by calculating the rth$r{\text{th}}$‐sequential topological complexity of conf(n,w)$\text{conf}(n,w)$, the ...
Nicholas Wawrykow
wiley   +1 more source

Calderón problem for nonlocal viscous wave equations: Unique determination of linear and nonlinear perturbations. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Zimmermann P.
europepmc   +1 more source