Results 1  10
of
2,041
BRITE: An approach to universal topology generation,”
 in Proceedings of the IEEE Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems,
, 2001
"... Abstract Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the largescale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. U ..."
Abstract

Cited by 448 (12 self)
 Add to MetaCart
. Interoperability provides interfaces to widelyused simulation applications such as ns and SSF and visualization tools like otter. We call such a tool a universal topology generator.
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
climate. 9 II. Data Our first objective is to investigate how well the variables identified above explain observed changes in credit spreads. Here, we discuss the data used for estimating both credit spreads and proxies for the explanatory variables. Credit Spreads The corporate bond data are obtained
How Many Iterations in the Gibbs Sampler?
 In Bayesian Statistics 4
, 1992
"... When the Gibbs sampler is used to estimate posterior distributions (Gelfand and Smith, 1990), the question of how many iterations are required is central to its implementation. When interest focuses on quantiles of functionals of the posterior distribution, we describe an easilyimplemented metho ..."
Abstract

Cited by 159 (6 self)
 Add to MetaCart
When the Gibbs sampler is used to estimate posterior distributions (Gelfand and Smith, 1990), the question of how many iterations are required is central to its implementation. When interest focuses on quantiles of functionals of the posterior distribution, we describe an easily
Automatic Translation of FORTRAN Programs to Vector Form
 ACM Transactions on Programming Languages and Systems
, 1987
"... This paper discusses the theoretical concepts underlying a project at Rice University to develop an automatic translator, called PFC (for Parallel FORTRAN Converter), from FORTRAN to FORTRAN 8x. The Rice project, based initially upon the research of Kuck and others at the University of Illinois [6, ..."
Abstract

Cited by 329 (34 self)
 Add to MetaCart
This paper discusses the theoretical concepts underlying a project at Rice University to develop an automatic translator, called PFC (for Parallel FORTRAN Converter), from FORTRAN to FORTRAN 8x. The Rice project, based initially upon the research of Kuck and others at the University of Illinois [6
How to Generate and use Universal Parameters
"... We introduce the notion of universal parameters as a method for generating the trusted parameters for many schemes from just a single trusted setup. In such a scheme a trusted setup process will produce universal parameters U. These parameters can then be combined with the description, d(·) of any p ..."
Abstract
 Add to MetaCart
particular cryptographic setup algorithm to produce parameters pd that can be used by the cryptographic system associated with d. We give a solution in the random oracle model based on indistinguishability obfuscation. We demonstrate the versatility of universal parameters by showing how they give rise
Tachyon potentials, star products and universality
 JHEP 0109 (2001) 038 [arXiv:hepth/0006240
"... We develop an efficient recursive method to evaluate the tachyon potential using the relevant universal subalgebra of the open string star algebra. This method, using offshell versions of Virasoro Ward identities, avoids explicit computation of conformal transformations of operators and does not re ..."
Abstract

Cited by 179 (18 self)
 Add to MetaCart
We develop an efficient recursive method to evaluate the tachyon potential using the relevant universal subalgebra of the open string star algebra. This method, using offshell versions of Virasoro Ward identities, avoids explicit computation of conformal transformations of operators and does
Brite: Universal topology generation from a user’s perspective
, 2001
"... Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the largescale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunate ..."
Abstract

Cited by 137 (1 self)
 Add to MetaCart
. Interoperability provides interfaces to widelyused simulation and visualization applications such as ns and SSF. We call such a tool a universal topology generator. In this paper we discuss the design, implementation and usage of the BRITE universal topology generation tool that we have built. We also describe
Church: A language for generative models
 In UAI
, 2008
"... Formal languages for probabilistic modeling enable reuse, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal language for describing stochastic generative processes. Church is based on the Lisp model of lambda calculus, containing a pu ..."
Abstract

Cited by 141 (27 self)
 Add to MetaCart
Formal languages for probabilistic modeling enable reuse, modularity, and descriptive clarity, and can foster generic inference techniques. We introduce Church, a universal language for describing stochastic generative processes. Church is based on the Lisp model of lambda calculus, containing a
Critical Behavior in the Satisfiability of Random Boolean Formulae
 Science
, 1994
"... The satisfiability of randomly generated Boolean formulae with k variables per clause is a popular testbed for the performance of search algorithms in artificial intelligence and computer science. For k = 2, formulae are almost aways satisfiable when the ratio of clauses to variables is less than ..."
Abstract

Cited by 179 (11 self)
 Add to MetaCart
than 1; for ratios larger than 1, the formulae are almost never satisfiable. We present data showing a similar threshold behavior for higher values of k. We also show how finitesize scaling, a method from statistical physics, can be used to characterize size dependent effects near the threshold
Umacs: A Universal Markov Chain Sampler
, 2006
"... Umacs (Universal Markov chain sampler) is an R software package that facilitates the construction of the Gibbs sampler and Metropolis algorithm for Bayesian inference. Umacs is a practical tool to write samplers in R. This is sometimes necessary for large problems that cannot be fit using programs l ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Umacs (Universal Markov chain sampler) is an R software package that facilitates the construction of the Gibbs sampler and Metropolis algorithm for Bayesian inference. Umacs is a practical tool to write samplers in R. This is sometimes necessary for large problems that cannot be fit using programs
Results 1  10
of
2,041