scholarly journals Construction and Validation of the Intimate Images Diffusion Scale Among Adolescents

2019 ◽  
Vol 10 ◽  
Author(s):  
María Penado ◽  
María Luisa Rodicio-García ◽  
María Marcos Cuesta ◽  
Tania Corrás
Keyword(s):  
Diffusion Scale

scholarly journals Diffusion-Scale Tightness of Invariant Distributions of a Large-Scale Flexible Service System

2015 ◽  
Vol 47 (01) ◽  
pp. 251-269 ◽  
Author(s):  
A. L. Stolyar
Keyword(s):  
Diffusion Process ◽  
Service Time ◽  
Large Scale ◽  
Service System ◽  
Arrival Rate ◽  
Asymptotic Regime ◽  
Invariant Distributions ◽  
Multiple Customer Classes ◽  
The Mean ◽  
Diffusion Scale

A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routeing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a leaf activity priority (LAP) policy, introduced by Stolyar and Yudovina (2012). An asymptotic regime is considered, where the arrival rate of customers and number of servers in each pool tend to ∞ in proportion to a scaling parameter r, while the overall system load remains strictly subcritical. We prove tightness of diffusion-scaled (centered at the equilibrium point and scaled down by r −1/2) invariant distributions. As a consequence, we obtain a limit interchange result: the limit of diffusion-scaled invariant distributions is equal to the invariant distribution of the limiting diffusion process.

scholarly journals Diffusion-Scale Tightness of Invariant Distributions of a Large-Scale Flexible Service System

2015 ◽  
Vol 47 (1) ◽  
pp. 251-269 ◽  
Author(s):  
A. L. Stolyar
Keyword(s):  
Diffusion Process ◽  
Service Time ◽  
Large Scale ◽  
Service System ◽  
Arrival Rate ◽  
Asymptotic Regime ◽  
Invariant Distributions ◽  
Multiple Customer Classes ◽  
The Mean ◽  
Diffusion Scale

A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routeing choices) form a tree (in the graph with vertices being both customer classes and server pools). We study the behavior of the system under a leaf activity priority (LAP) policy, introduced by Stolyar and Yudovina (2012). An asymptotic regime is considered, where the arrival rate of customers and number of servers in each pool tend to ∞ in proportion to a scaling parameter r, while the overall system load remains strictly subcritical. We prove tightness of diffusion-scaled (centered at the equilibrium point and scaled down by r−1/2) invariant distributions. As a consequence, we obtain a limit interchange result: the limit of diffusion-scaled invariant distributions is equal to the invariant distribution of the limiting diffusion process.

Subdiffusive Load Balancing in Time-Varying Queueing Systems

2019 ◽  
Vol 67 (6) ◽  
pp. 1678-1698
Author(s):  
Rami Atar ◽  
Isaac Keslassy ◽  
Gal Mendelson
Keyword(s):  
Load Balancing ◽  
Queue Length ◽  
Queueing Systems ◽  
Load Condition ◽  
Service Rates ◽  
Queue Lengths ◽  
Join The Shortest Queue ◽  
The Difference ◽  
Shortest Queue ◽  
Diffusion Scale

The degree to which delays or queue lengths equalize under load-balancing algorithms gives a good indication of their performance. Some of the most well-known results in this context are concerned with the asymptotic behavior of the delay or queue length at the diffusion scale under a critical load condition, where arrival and service rates do not vary with time. For example, under the join-the-shortest-queue policy, the queue length deviation process, defined as the difference between the greatest and smallest queue length as it varies over time, is at a smaller scale (subdiffusive) than that of queue lengths (diffusive).

scholarly journals ALFVÉNIC TURBULENCE BEYOND THE AMBIPOLAR DIFFUSION SCALE

2015 ◽  
Vol 805 (2) ◽  
pp. 118 ◽  
Author(s):  
Blakesley Burkhart ◽  
A. Lazarian ◽  
D. Balsara ◽  
C. Meyer ◽  
J. Cho
Keyword(s):  
Ambipolar Diffusion ◽  
Diffusion Scale

scholarly journals Probing the turbulent ambipolar diffusion scale in molecular clouds with spectroscopy

2013 ◽  
Vol 438 (1) ◽  
pp. 663-671 ◽  
Author(s):  
T. Hezareh ◽  
T. Csengeri ◽  
M. Houde ◽  
F. Herpin ◽  
S. Bontemps
Keyword(s):  
Molecular Clouds ◽  
Ambipolar Diffusion ◽  
Diffusion Scale

scholarly journals Exploring the Dynamical Behavior of Information Diffusion in D2D Communication Environment

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Zufan Zhang ◽  
Anqi Liu ◽  
Yinxue Yi ◽  
Maobin Yang
Keyword(s):  
Information Diffusion ◽  
Dynamical Behavior ◽  
Minimum Cost ◽  
D2d Communication ◽  
Control Effect ◽  
Globally Asymptotically Stable ◽  
Communication Environment ◽  
Combined Impact ◽  
Theoretical Results ◽  
Diffusion Scale

This paper is dedicated to exploring the dynamical behavior of information diffusion in the Device-to-Device (D2D) communication environment for information security, so as to study how to accelerate the dissemination of beneficial information and curb the spread of malicious information. A mathematical model of information diffusion considering the combined impact of user awareness and social tie between users is proposed. The equilibrium of the model and its stability are fully analyzed. Very importantly, there is a unique (viral) equilibrium that is globally asymptotically stable without any preconditions. This means that the spread of malicious information in the D2D communication environment cannot be completely eliminated whatever measures are taken, but its diffusion scale can be controlled by adjusting the value of the equilibrium, and then the goal of pursuing the best control effect at the minimum cost can be achieved. In the same way, the dissemination scale of beneficial information can be expanded. Finally, the obtained main theoretical results are illustrated by some examples, and some suggestions are also given.

scholarly journals Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources

2021 ◽  
Author(s):  
Erhun Özkan
Keyword(s):  
Queueing Networks ◽  
Queueing Network ◽  
Optimal Scheduling ◽  
Shared Resources ◽  
Asymptotically Optimal ◽  
Scheduling Policy ◽  
Synchronization Constraints ◽  
Processing Network ◽  
Diffusion Scale ◽  
Processing Networks

A fork-join processing network is a queueing network in which tasks associated with a job can be processed simultaneously. Fork-join processing networks are prevalent in computer systems, healthcare, manufacturing, project management, justice systems, and so on. Unlike the conventional queueing networks, fork-join processing networks have synchronization constraints that arise because of the parallel processing of tasks and can cause significant job delays. We study scheduling in fork-join processing networks with multiple job types and parallel shared resources. Jobs arriving in the system fork into arbitrary number of tasks, then those tasks are processed in parallel, and then they join and leave the network. There are shared resources processing multiple job types. We study the scheduling problem for those shared resources (i.e., which type of job to prioritize at any given time) and propose an asymptotically optimal scheduling policy in diffusion scale.

Sign in / Sign up

Export Citation Format

Share Document