Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
36
An extension of Lucas’ theorem
- Proc. Amer. Math. Soc
"... Abstract. Let p be a prime. A famous theorem of Lucas states that ( mp+s) ≡ ( np+t m) ( s) (mod p) ifm, n, s, t are nonnegative integers with s, t < p. Inthispaper n t we aim to prove a similar result for generalized binomial coefficients defined in terms of second order recurrent sequences with ..."
Abstract
-
Cited by 26 (16 self)
- Add to MetaCart
Abstract. Let p be a prime. A famous theorem of Lucas states that ( mp+s) ≡ ( np+t m) ( s) (mod p) ifm, n, s, t are nonnegative integers with s, t < p. Inthispaper n t we aim to prove a similar result for generalized binomial coefficients defined in terms of second order recurrent sequences
Multicasting in the Hypercube, Chord and Binomial Graphs
, 2009
"... We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the sp-multicast (shortest path) and Steiner tree problems for the n-cube, Chord and the BNG network are NP-Complete ..."
Abstract
- Add to MetaCart
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish that the sp-multicast (shortest path) and Steiner tree problems for the n-cube, Chord and the BNG network are NP
The Extreme Light Infrastructure Nuclear Physics (ELI-NP) facility
, 2013
"... which is being built at Bucharest–Magurele aims at utilizing extreme elec-tromagnetic fields for nuclear physics and quantum electrodynamics stud-ies. Two ten pentawatt high-power laser systems and a brilliant γ beam are the main research tools of the facility. Here, we present the current status an ..."
Abstract
- Add to MetaCart
and the perspectives for experiments with intense γ rays at ELI-NP. DOI:10.5506/APhysPolB.45.483 PACS numbers: 07.85.Fv, 29.20.Ej, 25.20.–x
18.443 Statistics for Applications
"... First, here is some notation for binomial probabilities. Let X be the number of successes in n independent trials with probability p of success on each trial. Let q ≡ 1−p. Then we know that EX = np, the variance of X is npq where q = 1 − p, and so the ..."
Abstract
- Add to MetaCart
First, here is some notation for binomial probabilities. Let X be the number of successes in n independent trials with probability p of success on each trial. Let q ≡ 1−p. Then we know that EX = np, the variance of X is npq where q = 1 − p, and so the
The All-Ones Problem for Binomial Trees, Butterfly and Benes Networks
"... The all-ones problem is an NP-complete problem introduced by Sutner [11], with wide applica-tions in linear cellular automata. In this paper, we solve the all-ones problem for some of the widely studied architectures like binomial trees, butterfly, and benes networks. ..."
Abstract
- Add to MetaCart
The all-ones problem is an NP-complete problem introduced by Sutner [11], with wide applica-tions in linear cellular automata. In this paper, we solve the all-ones problem for some of the widely studied architectures like binomial trees, butterfly, and benes networks.
The Effects of an Arcsin Square Root Transform on a Binomial Distributed Quantity
"... This document provides proofs of the following: • The binomial distribution can be approximated with a Gaussian distribution at large values of N. • The arcsin square-root transform is the variance stabilising transform for the binomial distribution. • The Gaussian approximation for the binomial dis ..."
Abstract
- Add to MetaCart
and Poisson distributions. 1 Gaussian Approximation to the Binomial Distribution The binomial distribution P (n|N) = N! n!(N − n)!p nq(N−n) (1) gives the probability of obtaining n successes out of N Bernoulli trials, where p is the probability of success and q = 1 − p is the probability of failure
Abstract Multicast Session Membership Size Estimation
, 1998
"... The problem of estimating the number of members in a multicast session through probabilistic polling corresponds to that of estimating the parameter n of the Binomial np, distribution. This allows an interval estimator for n to be derived. The tradeoff between the relative dispersion of this estimat ..."
Abstract
- Add to MetaCart
The problem of estimating the number of members in a multicast session through probabilistic polling corresponds to that of estimating the parameter n of the Binomial np, distribution. This allows an interval estimator for n to be derived. The tradeoff between the relative dispersion
a Life Course Importation Model of Inmate Behavior
"... The importation model is a venerable theoretical explanation for inmate misconduct but it has not been extended in nearly 50 years. The current study advances a life course importation model of inmate behavior where life events in childhood cascade to predict antisocial behavior during adolescence a ..."
Abstract
- Add to MetaCart
and misconduct occurring during periods of confinement. Based on data from 2,520 institutionalized male delinquents, ordinary least squares, logistic, and negative binomial regression models indicated that family background variables were largely predictive of multiple facets of delinquent careers. Negative
Xerox Site Report: Four TREC-4 Tracks
- The Fourth Text REtrieval Conference (TREC-4
, 1996
"... this document sample than one would expect by chance. The terms are selected according to a binomial likelihood ratio test [10], comparing their occurrence in the first 20 documents to their occurrence in the rest of the collection. The selected terms are then weighted in proportion to the signific ..."
Abstract
-
Cited by 12 (2 self)
- Add to MetaCart
this document sample than one would expect by chance. The terms are selected according to a binomial likelihood ratio test [10], comparing their occurrence in the first 20 documents to their occurrence in the rest of the collection. The selected terms are then weighted in proportion
Local resilience and Hamiltonicity Maker-Breaker games in random regular graphs
- Combinatorics, Probability, and Computing
"... For an increasing monotone graph property P the local resilience of a graph G with respect to P is the minimal r for which there exists of a subgraph H ⊆ G with all degrees at most r such that the removal of the edges of H from G creates a graph that does not possesses P. This notion, which was impl ..."
Abstract
-
Cited by 13 (5 self)
- Add to MetaCart
is at least (1−ε)d/6. We also prove that for the Binomial random graph model G(n, p), for every positive ε> 0 and large enough values of K, if p> K ln n n then with high probability the local resilience of G(n, p) with respect to being Hamiltonian is at least (1 − ε)np/6. Finally, we apply similar
Results 1 - 10
of
36
