scholarly journals Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes

2020 ◽  
Vol 48 (1) ◽  
pp. 35-36
Author(s):  
Ziv Scully ◽  
Lucas van Kreveld ◽  
Onno Boxma ◽  
Jan-Pieter Dorsman ◽  
Adam Wierman
Keyword(s):  
Response Time ◽  
Optimal Response ◽  
Heavy Tailed

scholarly journals Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes

2020 ◽  
Vol 4 (2) ◽  
pp. 1-33 ◽  
Author(s):  
Ziv Scully ◽  
Lucas van Kreveld ◽  
Onno Boxma ◽  
Jan-Pieter Dorsman ◽  
Adam Wierman
Keyword(s):  
Response Time ◽  
Optimal Response ◽  
Heavy Tailed

scholarly journals Understanding the Structure of Cognitive Noise

2021 ◽  
Author(s):  
Jian-Qiao Zhu ◽  
Pablo Leon-Villagra ◽  
Nick Chater ◽  
Adam N Sanborn
Keyword(s):  
Response Time ◽  
Response Times ◽  
Functional Adaptation ◽  
Human Cognition ◽  
Statistical Sampling ◽  
Patchy Environments ◽  
Heavy Tailed Distributions ◽  
Separate Line ◽  
Heavy Tailed ◽  
Response Time Distributions

Human cognition is fundamentally noisy. While routinely regarded as a nuisance in experimental investigation, the few studies investigating properties of cognitive noise have found surprising structure. A first line of research has shown that inter-response-time distributions are heavy-tailed. That is, response times between subsequent trials usually change only a small amount, but with occasional large changes. A second, separate, line of research has found that participants’ estimates and response times both exhibit long-range autocorrelations (i.e., 1/f noise). Thus, each judgment and response time not only depends on its immediate predecessor but also on many previous responses. These two lines of research use different tasks and have distinct theoretical explanations: models that account for heavy-tailed response times do not predict 1/f autocorrelations and vice versa. Here, we find that 1/f noise and heavy-tailed response distributions co-occur in both types of tasks. We also show that a statistical sampling algorithm, developed to deal with patchy environments, generates both heavy-tailed distributions and 1/f noise, suggesting that cognitive noise may be a functional adaptation to dealing with a complex world.

AN OPTIMAL SYSTOLIC DICTIONARY

1995 ◽  
Vol 05 (03) ◽  
pp. 451-460
Author(s):  
I. W. CHAN ◽  
F. CHOI
Keyword(s):  
Response Time ◽  
System Throughput ◽  
Optimal Response ◽  
Vlsi Technology ◽  
Systolic Algorithm ◽  
Average Latency ◽  
High System

We present a simple systolic algorithm for implementing dictionary machine based on the VLSI technology. Our design makes use of a dynamic. global tree rebalancing scheme to attain high system throughput. Our scheme is simple to implement and requires low sophistication in the design of processing nodes. Results from analysis and simulation show that our algorithm has optimal response time and achieves an average latency close to 1. This represents a significant improvement over many of the previous designs. Unlike most parallel dictionary machines reported in the literature, our approach requires no compression operations.

scholarly journals Response Time Threshold for Predicting Outcomes of Patients with Out-of-Hospital Cardiac Arrest

2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Ling Hsuan Huang ◽  
Yu-Ni Ho ◽  
Ming-Ta Tsai ◽  
Wei-Ting Wu ◽  
Fu-Jen Cheng
Keyword(s):  
Cardiac Arrest ◽  
Response Time ◽  
Hospital Discharge ◽  
Youden Index ◽  
Roc Curve Analysis ◽  
Optimal Response ◽  
Time Threshold ◽  
Bystander Cpr ◽  
The Impact ◽  
Hospital Cardiac Arrest

Ambulance response time is a prognostic factor for out-of-hospital cardiac arrest (OHCA), but the impact of ambulance response time under different situations remains unclear. We evaluated the threshold of ambulance response time for predicting survival to hospital discharge for patients with OHCA. A retrospective observational analysis was conducted using the emergency medical service (EMS) database (January 2015 to December 2019). Prehospital factors, underlying diseases, and OHCA outcomes were assessed. Receiver operating characteristic (ROC) curve analysis with Youden Index was performed to calculate optimal cut-off values for ambulance response time that predicted survival to hospital discharge. In all, 6742 cases of adult OHCA were analyzed. After adjustment for confounding factors, age (odds ratio [OR] = 0.983, 95% confidence interval [CI]: 0.975–0.992, p < 0.001 ), witness (OR = 3.022, 95% CI: 2.014–4.534, p < 0.001 ), public location (OR = 2.797, 95% CI: 2.062–3.793, p < 0.001 ), bystander cardiopulmonary resuscitation (CPR, OR = 1.363, 95% CI: 1.009–1.841, p = 0.044 ), EMT-paramedic response (EMT-P, OR = 1.713, 95% CI: 1.282–2.290, p < 0.001 ), and prehospital defibrillation using an automated external defibrillator ([AED] OR = 3.984, 95% CI: 2.920–5.435, p < 0.001 ) were statistically and significantly associated with survival to hospital discharge. The cut-off value was 6.2 min. If the location of OHCA was a public place or bystander CPR was provided, the threshold was prolonged to 7.2 min and 6.3 min, respectively. In the absence of a witness, EMT-P, or AED, the threshold was reduced to 4.2, 5, and 5 min, respectively. The adjusted OR of EMS response time for survival to hospital discharge was 1.217 (per minute shorter, CI: 1.140–1299, p < 0.001 ) and 1.992 (<6.2 min, 95% CI: 1.496–2.653, p < 0.001 ). The optimal response time threshold for survival to hospital discharge was 6.2 min. In the case of OHCA in public areas or with bystander CPR, the threshold was prolonged, and without witness, the optimal response time threshold was shortened.

scholarly journals Extended Adaptive Join Operator with Bind-Bloom Join for Federated SPARQL Queries

2017 ◽  
Vol 13 (3) ◽  
pp. 47-72
Author(s):  
Damla Oguz ◽  
Shaoyi Yin ◽  
Belgin Ergenç ◽  
Abdelkader Hameurlain ◽  
Oguz Dikenelli
Keyword(s):  
Response Time ◽  
Query Optimization ◽  
Linked Data ◽  
Completion Time ◽  
Optimal Response ◽  
Time Performance ◽  
Communication Time ◽  
Extended Operator ◽  
Adaptation Ability ◽  
Hash Join

The goal of query optimization in query federation over linked data is to minimize the response time and the completion time. Communication time has the highest impact on them both. Static query optimization can end up with inefficient execution plans due to unpredictable data arrival rates and missing statistics. This study is an extension of adaptive join operator which always begins with symmetric hash join to minimize the response time, and can change the join method to bind join to minimize the completion time. The authors extend adaptive join operator with bind-bloom join to further reduce the communication time and, consequently, to minimize the completion time. They compare the new operator with symmetric hash join, bind join, bind-bloom join, and adaptive join operator with respect to the response time and the completion time. Performance evaluation shows that the extended operator provides optimal response time and further reduces the completion time. Moreover, it has the adaptation ability to different data arrival rates.

Sign in / Sign up

Export Citation Format

Share Document