Results 41 to 50 of about 393 (164)
Simulating a Quantum Switch With Concurrent Demands
ABSTRACT Quantum networks rely on entanglement distribution to enable secure communication and distributed quantum computation. Most analytical models address idealized, single‐flow scenarios and overlook the impact of concurrent entanglement requests, limiting their applicability to realistic network conditions.
Juan Fernández‐Herrerín‐Álvarez +2 more
wiley +1 more source
Stability of Queueing Systems with Impatience, Balking and Non-Persistence of Customers
The operation of many queueing systems is adequately described by the structured multidimensional continuous-time Markov chains. The most well-studied classes of such chains are level-independent Quasi-Birth-and-Death processes, GI/M/1 type and M/G/1 ...
Alexander N. Dudin +3 more
doaj +1 more source
From rights to runtime: Privacy engineering for agentic AI
Abstract Agentic AI shifts stacks from request‐response to plan‐execute. Systems no longer just answer; they act—planning tasks, calling tools, keeping memory, and changing external state. That shift moves privacy from policy docs into the runtime.
Keivan Navaie
wiley +1 more source
Offline Learning for Acknowledgment Optimization in Massive LoRaWAN Networks
ABSTRACT LoRaWAN faces critical limitations in large‐scale deployments due to spectrum contention, duty‐cycle restrictions, and energy constraints. These challenges impact the reliability and responsiveness of bidirectional communication particularly when conventional acknowledgment mechanisms are used.
Leila Aissaoui Ferhi
wiley +1 more source
Convergence Of Generalized Truncation Method In Retrial Queues
Changwon, Korea у wshin @ changwon. ac. lain many cases, the queue length processes in retrial queues are described by the spatially inhomogeneous Markov chain caused by transitions due to repeated attempts.
Shin, Y.
core +1 more source
Heterogeneous Finite-Source Retrial Queues [PDF]
The paper considers a system with \(K\) different sources of primary calls, each consisting of a single request. When source \(i\) is free at time \(t\) (i.e., is not being served and not waiting for serving), it may generate a primary call during interval \((t,t + dt)\) with probability \(\lambda _i dt + o(dt)\).
Almási, B., Bolch, G., Sztrik, J.
openaire +1 more source
Abstract Machine‐learning (ML) models in flow cytometry have the potential to reduce error rates, increase reproducibility, and boost the efficiency of clinical labs. While numerous ML models for flow cytometry data have been proposed, few studies have described the clinical deployment of such models.
Lauren M. Zuromski +10 more
wiley +1 more source
Flow chart highlighting the service mechanism of MRP with impatience and working breakdown of the server. ABSTRACT The long‐term reliability of a machining system is essential for ensuring the uninterrupted operation of an automated manufacturing process.
Shreekant Varshney +4 more
wiley +1 more source
Markovian Retrial Queues with Two Way Communication
In this paper, we first consider single server retrial queues with two way communication. Ingoing calls arrive at the server according to a Poisson process. Service times of these calls follow an exponential distribution. If the server is idle, it starts
Phung-Duc, Tuan +3 more
core +1 more source
Supporting Smart Manufacturing in the Space Industry: A Case Study
ABSTRACT In the era of Industry 4.0, the New Space Economy, often called Space 4.0, has taken center stage in the satellite industry. The advent of mega‐constellations, which entails mass satellite production, necessitates state‐of‐the‐art manufacturing methods.
Ala Arman +3 more
wiley +1 more source

