81,935+ open-access research outputs.
Realistic long-horizon productivity work is strongly conditioned on user-specific computer environments, where much of the work context is stored and organized through directory structures and content…
In recent years, physics-informed neural networks (PINNs) have gained significant attention for solving differential equations, although they suffer from two fundamental limitations, namely, spectral …
In this paper, we propose a scaled gradient modified non-monotone line search method for solving constrained minimization problems, and explore several specific properties of this method, namely, its …
Solving practical multi-depot vehicle routing problems (MDVRP) is a challenging optimization task central to modern logistics, increasingly driven by e-commerce. To address the MDVRP's computational c…
Software development is a sociotechnical and human-centered endeavor in which human factors directly influence quality, productivity, and innovation capacity. In this context, career development in co…
Quantum key distribution (QKD) theoretically offers information-theoretic security. The prevailing approach is the prepare-and-measure BB84 protocol, which implements QKD using conventional laser rath…
In this paper, we study an inverse boundary value problem for the Jordan--Moore--Gibson--Thompson equation on a simple Riemannian manifold. We consider an all boundary measurement map that maps Dirich…
Recent advances in agentic AI are shifting automation from discrete tools to proactive multi-agent systems that coordinate multi-specialized capabilities behind unified interfaces. However, today's ag…
Every document format in existence was designed for a human reader moving linearly through text. Autonomous LLM agents do not read - they retrieve. This fundamental mismatch forces agents to inject en…
This paper addresses the problem of finding the densest $k$-vertex subgraph in an arbitrary graph. This problem is NP-hard and has important applications in social network analysis, fraud detection, r…
We introduce the TemporallyEdgeDisjointScheduleCompletion (TEDSC) problem in which we need to cover a set of temporal edge demands $D$ by routing $k$ temporal walks through a directed static graph whi…
This paper considers the robust control of a catenary robot composed of two quadrotors connected by an inextensible cable. The system is modeled on \(SE(3)\), with the cable treated as a geometric sub…
The full-field reconstruction of three-dimensional (3D) turbulent flows from sparse experimental measurements remains a significant challenge, particularly for flows exhibiting complex 3D flow separat…
The possible bound state of the $c\bar{c}+n+^{10}$Be system, representing a hypothetical charmonium-nucleus configuration, is investigated. The analysis is conducted within a three-cluster framework, …
People commonly leverage structured content to accelerate knowledge acquisition and research problem solving. Among these, roadmaps guide researchers through hierarchical subtasks to solve complex res…
The tragedy of the commons has traditionally been framed as a problem of resource overuse driven by self-interested exploitation. In contrast, growing empirical evidence shows that insufficient use or…
We investigate the existence of positive solutions to fractional equations presenting a double criticality: a multi-polar Hardy-type potential and a Sobolev critical nonlinearity. The nonlocal nature …
We demonstrate exponential quantum speedup for a restricted-Hamming-weight version of Simon's problem on present-day superconducting quantum processors by introducing a hardware-aware compilation stra…
The Nash-Williams conjecture establishes degree sequence conditions ensuring Hamilton cycles in digraphs. An asymptotic version of this conjecture for large digraphs was independently derived by sever…
This paper introduces the Structural Dissolution Framework to explain how artificial intelligence restructures the coordination architecture of traditional industries. We argue that AI dissolves the b…
Free open-access publishing with Google Scholar indexing.
Submission Guide →