Almost sure waiting time results for weak and very weak Bernoulli processes

2002 ◽  
Author(s):  
K. Marton ◽  
P. Shields
Keyword(s):  
Waiting Time ◽  
Bernoulli Processes

scholarly journals Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits

2019 ◽  
Vol 31 (12) ◽  
pp. 2523-2561 ◽  
Author(s):  
Lili Su ◽  
Chia-Jung Chang ◽  
Nancy Lynch
Keyword(s):  
Lower Bound ◽  
Waiting Time ◽  
Success Probability ◽  
Spike Trains ◽  
Decision Time ◽  
Text Input ◽  
Bernoulli Processes ◽  
Winner Take All ◽  
Input Spike ◽  
Take All

Winner-take-all (WTA) refers to the neural operation that selects a (typically small) group of neurons from a large neuron pool. It is conjectured to underlie many of the brain's fundamental computational abilities. However, not much is known about the robustness of a spike-based WTA network to the inherent randomness of the input spike trains. In this work, we consider a spike-based [Formula: see text]–WTA model wherein [Formula: see text] randomly generated input spike trains compete with each other based on their underlying firing rates and [Formula: see text] winners are supposed to be selected. We slot the time evenly with each time slot of length 1 ms and model the [Formula: see text] input spike trains as [Formula: see text] independent Bernoulli processes. We analytically characterize the minimum waiting time needed so that a target minimax decision accuracy (success probability) can be reached. We first derive an information-theoretic lower bound on the waiting time. We show that to guarantee a (minimax) decision error [Formula: see text] (where [Formula: see text]), the waiting time of any WTA circuit is at least [Formula: see text]where [Formula: see text] is a finite set of rates and [Formula: see text] is a difficulty parameter of a WTA task with respect to set [Formula: see text] for independent input spike trains. Additionally, [Formula: see text] is independent of [Formula: see text], [Formula: see text], and [Formula: see text]. We then design a simple WTA circuit whose waiting time is [Formula: see text]provided that the local memory of each output neuron is sufficiently long. It turns out that for any fixed [Formula: see text], this decision time is order-optimal (i.e., it matches the above lower bound up to a multiplicative constant factor) in terms of its scaling in [Formula: see text], [Formula: see text], and [Formula: see text].

Almost-sure waiting time results for weak and very weak Bernoulli processes

1995 ◽  
Vol 15 (5) ◽  
pp. 951-960 ◽  
Author(s):  
Katalin Marton ◽  
Paul C. Shields
Keyword(s):  
Waiting Time ◽  
Initial Segment ◽  
Sample Path ◽  
Almost Sure Convergence ◽  
Approximate Match ◽  
Joint Distributions ◽  
Blowing Up ◽  
Bernoulli Processes

AbstractAlmost-sure convergence of (l/k) log Wk(x, y) to entropy for weak Bernoulli processes is proved, where Wk (x, y) is the waiting time until an initial segment of length k of a sample path x is seen in an independently chosen sample path y. Analogous almost-sure results are obtained in the approximate match case for very weak Bernoulli processes. The weak Bernoulli proof uses recent results obtained by the authors about the estimation of joint distributions, while the very weak Bernoulli result utilizes a new characterization of such processes in terms of a blowing-up property.

Predictors of waiting time for liver TX: A three-year experience

2001 ◽  
Vol 120 (5) ◽  
pp. A370-A370
Author(s):  
C BOBROWSKI ◽  
H GHADIMPOOR ◽  
M STENECK ◽  
X ROGIERS ◽  
C BROELSCH ◽  
...  
Keyword(s):  
Waiting Time

A two unit standby redundant system with standby failure and repair waiting time

Optimization ◽  
1973 ◽  
Vol 4 (6) ◽  
pp. 453-462
Author(s):  
L. Cunningham ◽  
N. Singh
Keyword(s):  
Waiting Time ◽  
Redundant System

Effects of Waiting Time on Treatment Engagement

2014 ◽  
Author(s):  
A.M.L. Westin ◽  
C.L. Barksdale ◽  
S.H. Stephan
Keyword(s):  
Waiting Time ◽  
Treatment Engagement

Superfast TB test slashes waiting time

Nature ◽  
2010 ◽  
Author(s):  
Apoorva Mandavilli
Keyword(s):  
Waiting Time

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document