Results 11  20
of
36,327
Complexity and Expressive Power of Logic Programming
, 1997
"... This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results ..."
Abstract

Cited by 360 (57 self)
 Add to MetaCart
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.
Homomorphic evaluation of the AES circuit
 In CRYPTO
, 2012
"... We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES128 circuit in three different ways. One variant takes under over 36 hours to evaluate an entire AES encryption operation, using NTL (over GMP) as our underlying software platform ..."
Abstract

Cited by 63 (6 self)
 Add to MetaCart
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES128 circuit in three different ways. One variant takes under over 36 hours to evaluate an entire AES encryption operation, using NTL (over GMP) as our underlying software
Algebraic Decision Diagrams and their Applications
, 1993
"... In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and ..."
Abstract

Cited by 316 (17 self)
 Add to MetaCart
In this paper we present theory and experiments on the Algebraic Decision Diagrams (ADD's). These diagrams extend BDD's by allowing values from an arbitrary finite domain to be associated with the terminal nodes. We present a treatment founded in boolean algebras and discuss algorithms and results in applications like matrix multiplication and shortest path algorithms. Furthermore, we outline possible applications of ADD's to logic synthesis, formal verification, and testing of digital systems.
Functional Phonology  Formalizing the interactions between articulatory and perceptual drives
, 1998
"... ..."
3D Sound for Virtual Reality and Multimedia
, 2000
"... This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound ..."
Abstract

Cited by 282 (5 self)
 Add to MetaCart
This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound applications intended for many users, we want might want to use HRTFs that represent the common features of a number of individuals. But another approach might be to use the features of a person who has desirable HRTFs, based on some criteria. (One can sense a future 3D sound system where the pinnae of various famous musicians are simulated.) A set of HRTFs from a good localizer (discussed in Chapter 2) could be used if the criterion were localization performance. If the localization ability of the person is relatively accurate or more accurate than average, it might be reasonable to use these HRTF measurements for other individuals. The Convolvotron 3D audio system (Wenzel, Wightman, and Foster, 1988) has used such sets particularly because elevation accuracy is affected negatively when listening through a bad localizers ears (see Wenzel, et al., 1988). It is best when any single nonindividualized HRTF set is psychoacoustically validated using a 113 statistical sample of the intended user population, as shown in Chapter 2. Otherwise, the use of one HRTF set over another is a purely subjective judgment based on criteria other than localization performance. The technique used by Wightman and Kistler (1989a) exemplifies a laboratorybased HRTF measurement procedure where accuracy and replicability of results were deemed crucial. A comparison of their techniques with those described in Blauert (1983), Shaw (1974), Mehrgardt and Mellert (1977), Middlebrooks, Makous, and Gree...
Users' Guide for the HarwellBoeing Sparse Matrix Collection (Release I)
, 1992
"... We describe the complete set of matrices in the HarwellBoeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may ..."
Abstract

Cited by 273 (25 self)
 Add to MetaCart
We describe the complete set of matrices in the HarwellBoeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may be obtained. Keywords: sparse matrices, test matrices, matrix collection AMS(MOS) subject classifications: 65F50, 65F05, 65F15, 65F20. 1 Current reports available by anonymous ftp from matisa.cc.rl.ac.uk in the directory "pub/reports". This report is in file duglRAL92086.ps.gz. Also published as Technical Report TR/PA/92/86 from CERFACS, 42 Ave G Coriolis, 31057 Toulouse Cedex, France. 2 isd@rl.ac.uk 3 john.g.lewis@boeing.com and roger.g.grimes@boeing.com. Research and Technology Division, Boeing Computer Services, Mail Stop 7L21, P. O. Box 24236, Seattle, WA 981240346, USA. Supported in part by AFOSR grant F4962087C0037. Central Computing Department Atlas Centre Rutherford Applet...
Biobehavioral responses to stress in females: Tendandbefriend, not fightorflight
 PSYCHOLOGICAL REVIEW
, 2000
"... ..."
Routing and Wavelength Assignment in AllOptical Networks
 IEEE/ACM Transactions on Networking
, 1995
"... This paper considers the problem of routing connections in a reconfigurable optical network using wavelength division multiplexing, where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths sha ..."
Abstract

Cited by 264 (9 self)
 Add to MetaCart
This paper considers the problem of routing connections in a reconfigurable optical network using wavelength division multiplexing, where each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. We derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network. The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm. Although computationally intensive, our bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size. We illustrate this by comparing the performance of a simple shortestpath RWA (SPRWA) algorithm via...
The Value of a Statistical Life: A Critical Review of Market Estimates Throughout the World
 Journal of Risk and Uncertainty
, 2003
"... A substantial literature over the past thirty years has evaluated tradeoffs between money and fatality risks. These values in turn serve as estimates of the value of a statistical life. This article reviews more than 60 studies of mortality risk premiums from ten countries and approximately 40 studi ..."
Abstract

Cited by 266 (25 self)
 Add to MetaCart
A substantial literature over the past thirty years has evaluated tradeoffs between money and fatality risks. These values in turn serve as estimates of the value of a statistical life. This article reviews more than 60 studies of mortality risk premiums from ten countries and approximately 40 studies that present estimates of injury risk premiums. This critical review examines a variety of econometric issues, the role of unionization in risk premiums, and the effects of age on the value of a statistical life. Our metaanalysis indicates an income elasticity of the value of a statistical life from about 0.5 to 0.6. The paper also presents a detailed discussion of policy applications of these value of a statistical life estimates and related issues, including riskrisk analysis.
Algebraic Algorithms for Sampling from Conditional Distributions
 Annals of Statistics
, 1995
"... We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include generating tables with fixed row and column sums and higher dimensional analogs. The algorithms involve finding bases for associated polynomial ideals and so a ..."
Abstract

Cited by 264 (20 self)
 Add to MetaCart
We construct Markov chain algorithms for sampling from discrete exponential families conditional on a sufficient statistic. Examples include generating tables with fixed row and column sums and higher dimensional analogs. The algorithms involve finding bases for associated polynomial ideals and so an excursion into computational algebraic geometry.
Results 11  20
of
36,327