This book describes the new generation of discrete choice meth-ods, focusing on the many advances that are made possible by simulation. Researchers use these statistical methods to examine the choices that consumers, households, firms, and other agents make. Each of the major models is covered

versions of the simpler LARS algorithm. (3) A simple approximation for the degrees of freedom of a LARS estimate is available, from which we derive a Cp estimate of prediction error; this allows a principled choice among the range of possible LARS estimates. LARS and its variants are computationally

-length secret key. 1 AParameterized Family of Encryption Algorithms RC5 is word-oriented: all of the primitive operations work on w-bit words as their basic unit of information. Here we assume w = 32, although the formal speci cation of RC5 admits variants for other word lengths, such asw = 64 bits. RC5 has two

ABSTRACT This article provides an overview of recent developments in historical institutionalism. First, it reviews some distinctions that are commonly drawn between the "historical" and the "rational choice" variants of institutionalism and shows that there are more points

This paper presents a statistical approachto collaborative filtering and investigates the use of latent class models for predicting individual choices and preferences based on observed preference behavior. Two models are discussed and compared: the aspect model, a probabilistic latent space model

of difference cover. This view leads to a generalized algorithm, DC, that allows a space-efficient implementation and, moreover, supports the choice of a space–time tradeoff. For any v ∈ [1, √ n], it runs in O(vn) time using O(n / √ v) space in addition to the input string and the suffix array. We also

and generation. Chapter 4, the first in the part dealing with the lexical-semantic component, is to a large extent a variant of Dorr (1993a). It describes the interlingual representation of UNITRAN. The chosen interlingua is an extended version of LCS, used also as a representation of lexical entries. Dorr

We develop new methods for conducting a finite sample, likelihood-based analysis of the multinomial probit model. Using a variant of the Gibbs sampler, an algorithm is developed to draw from the exact posterior of the multinomial probit model with correlated errors. This approach avoids direct

-based prediction algorithm. Many variations of similarity metrics, weighting approaches, combination measures, and rating normalization have appeared in each implementation. For these parameters and others, there is no consensus as to which choice of technique is most appropriate for what situations, nor how

careful choice of either temporal or spatial filters, the subunits can themselves become quite similar or equivalent to the whole ERD; with suitably chosen filters, the ERD is equivalent to an elaborated version of a motion detector proposed by Watson and Ahumada [NASA Tech. Memo. 84352 (1983