Virtually all current theories of choice under risk or uncertainty are cognitive and consequentialist. They assume that people assess the desirability and likelihood of possible outcomes of choice alternatives and integrate this information through some type of expectation-based calculus to arrive

(MD), which has been widely used in the past for studying simple liquids and solids, has more recently been applied to molecular systems with internal degrees of freedom such as N, [l], H,O [2] and even C,H,, [3]. In applying the MD method three problems arise: (a) the choice of a suitable mechanical

traditional choices and explore radically different design points. The file system has successfully met our storage needs. It is widely deployed within Google as the storage platform for the generation and processing of data used by our service as well as research and development efforts that require large

penalized likelihood functions. The proposed ideas are widely applicable. They are readily applied to a variety of parametric models such as generalized linear models and robust regression models. They can also be applied easily to nonparametric modeling by using wavelets and splines. Rates of convergence

error). Two widely used statistical tests are shown to have high probability of type I error in certain situations and should never be used: a test for the difference of two proportions and a paired-differences t test based on taking several random train-test splits. A third test, a paired

bringing about a dramatic increase in bandwidth efficiency. Since the choice of which modulation scheme to use depends on the current state of the transmission channel, newer wireless devices often support multiple modulation schemes, and hence multiple data rates, with mechanisms to switch between them

A wide variety of distortion functions are used for clustering, e.g., squared Euclidean distance, Mahalanobis distance and relative entropy. In this paper, we propose and analyze parametric hard and soft clustering algorithms based on a large class of distortion functions known as Bregman

gains from simultaneous multithreading can be achieved without extensive changes to a conventional wide-issue superscalar, either in hardware structures or sizes. We present an architecture for simultaneous multithreading that achieves three goals: (1) it minimizes the architectural impact

Random Fields (MRF’s), the resulting energy minimization problems were widely viewed as intractable. Recently, algorithms such as graph cuts and loopy belief propagation (LBP) have proven to be very powerful: for example, such methods form the basis for almost all the top-performing stereo methods

Theories of electoral behaviour are typically elaborated to explain features of particular political systems. Most theories are focused in the US (made by US scholars) having presidential elections in mind. In turn, most of their European counterparts focus on national Parliament elections. National politics pre-eminence has lead to a national outlook over all other types of elections. Thus, it might not sound strange that a common research question in local, regional and supranational elections is how much dependent are these “other ” elections on the national ones. To our view, there are two main types of answer corresponding to two groups of theories on electoral change across different types of elections. First is what we will call dependency theories. These theories seek to explain two common features, notably a fall in turnout from one election to the other and a loss of support by incumbent. The “midterm ” weakness of US presidential parties has been explained by “surge and decline ” (Campbell 1960) and “referendum ” theories (Tufte 1975), and each has two or more versions. Both bodies of theory influenced the development of the “second-order” elections scheme (Reif and Schmitt 1980) which-inspired by lower turnout at European