Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
343
On a class of distributions stable under random summation
- J. Appl. Prob
, 2012
"... Abstract We investigate a family of distributions having a property of stability-underaddition, provided that the number ν of added-up random variables in the random sum is also a random variable. We call the corresponding property a ν-stability and investigate the situation with the semigroup gene ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract We investigate a family of distributions having a property of stability-underaddition, provided that the number ν of added-up random variables in the random sum is also a random variable. We call the corresponding property a ν-stability and investigate the situation with the semigroup
AN INEQUALITY FOR THE ASYMMETRY OF DISTRIBUTIONS AND A BERRY-ESSEEN THEOREM FOR RANDOM SUMMATION
- JOURNAL OF INEQUALITIES IN PURE AND APPLIED MATHEMATICS
, 2006
"... ..."
RANDOM SUMMATION AND ITS APPLICATION TO THE PERFORMANCE MODELLING OF COMPUTER SYSTEM
"... Abstract. This paper presents some views on the problem of application-specific systems (ASCS) performance modelling based on statistical measurement during a program's run time. The probabilistic model considered in this paper defines a performance measure relative to a given domain of applic ..."
Abstract
- Add to MetaCart
of application tasks, and it may be used as a base for performance verification. This measure follows a random sum of random summands, corresponding to various runtime component execution times. We consider theoretically whether the current state-of-the-art of random sums' theory can be used as the basis
A scheme of random summation of an empirical Green’s function to estimate ground motions from future large earthquakes
, 1995
"... Abstract We present a scheme for random summation of an empirical Green's function to synthesize ground motions from future large events. This scheme obeys the 092 scaling law at all frequencies and produces time histories whose envelopes are realistic. Assuming that the source parameters of th ..."
Abstract
-
Cited by 10 (2 self)
- Add to MetaCart
Abstract We present a scheme for random summation of an empirical Green's function to synthesize ground motions from future large events. This scheme obeys the 092 scaling law at all frequencies and produces time histories whose envelopes are realistic. Assuming that the source parameters
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
- IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract
-
Cited by 255 (0 self)
- Add to MetaCart
the summation of upward and downward rank values for prioritizing tasks. Another difference is in the processor selection phase, which schedules the critical tasks onto the processor that minimizes the total execution time of the critical tasks. In order to provide a robust and unbiased comparison
Preservation of log-concavity on summation
- ESAIM Probability and Statistics
"... We extend Hoggar’s theorem that the sum of two independent discrete-valued log-concave random variables is itself log-concave. We introduce conditions under which the result still holds for dependent variables. We argue that these conditions are natural by giving some applications. Firstly, we use o ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
We extend Hoggar’s theorem that the sum of two independent discrete-valued log-concave random variables is itself log-concave. We introduce conditions under which the result still holds for dependent variables. We argue that these conditions are natural by giving some applications. Firstly, we use
RANDOM SAMPLING FOR ESTIMATING THE PERFORMANCE OF FAST SUMMATIONS
"... Summation of functions of N source points evaluated at M target points occurs commonly in many applications. To scale these approaches for large datasets, many fast algorithms have been proposed. In this technical report, we propose a Chernoff bound based efficient approach to test the performance o ..."
Abstract
- Add to MetaCart
Summation of functions of N source points evaluated at M target points occurs commonly in many applications. To scale these approaches for large datasets, many fast algorithms have been proposed. In this technical report, we propose a Chernoff bound based efficient approach to test the performance
1 Random Sampling Using Shannon Interpolation and Poisson Summation Formulae
"... Abstract: This report mainly focused on the basic concepts and the recovery methods for the random sampling. The recovery methods involve the orthogonal matching pursuit algorithm and the gradient-based total variation strategy. In particular, a fast and efficient observation matrix filling techniq ..."
Abstract
- Add to MetaCart
Abstract: This report mainly focused on the basic concepts and the recovery methods for the random sampling. The recovery methods involve the orthogonal matching pursuit algorithm and the gradient-based total variation strategy. In particular, a fast and efficient observation matrix filling
Stochastic summation of empirical Green's functions
- Bull. Seism. Soc. Am
, 1990
"... Two simple strategies are presented that use random delay times for repeat-edly summing the record of a relatively small earthquake to simulate the effects of a larger earthquake. The simulations do not assume any fault plane geometry or rupture dynamics, but rely only on the ~-2 spectral model of a ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
. The moment rate function resulting from the single-stage simulation is quite simple and hence is probably not realistic for high-frequency (>1 Hz) ground motion of events larger than ML ~ 4.5 to 5, The second strategy is a two-stage summation that simulates source complexity with a few random subevent
Network Adiabatic Theorem: An Efficient Randomized Protocol for Contention Resolution
"... The popularity of Aloha(-like) algorithms for resolution of contention between multiple entities accessing common resources is due to their extreme simplicity and distributed nature. Example applications of such algorithms include Ethernet and recently emerging wireless multi-access networks. Despit ..."
Abstract
-
Cited by 88 (10 self)
- Add to MetaCart
is modeled through independent-set constraints over the network graph. The work by Tassiulas and Ephremides (1992) suggests that an algorithm that schedules queues so that the summation of “weight ” of scheduled queues is maximized, subject to constraints, is efficient. However, implementing
Results 1 - 10
of
343
