On Shifted Eisenstein Polynomials

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is needed given a shifted Eisenstein polynomial and also provide a lower bound on the density of shifted Eisenstein polynomials, which is strictly greater than the density of classical Eisenstein polynomials. We also show that the number of irreducible degree $n$ polynomials that are not shifted Eisenstein polynomials is infinite. We conclude with some numerical results on the densities of shifted Eisenstein polynomials

Counting irreducible binomials over finite fields

We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.Comment: 11 page

On the Number of Eisenstein Polynomials of Bounded Height

We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree $d$ and of height at most $H$, as $H\to \infty$. In particular, we give an explicit bound for the error term. We also obtain an asymptotic formula for arbitrary Eisenstein polynomials of height at most $H$

I Was Pleased a Moment Ago: How Pleasure Varies With Background and Foreground Reference Points

The pleasure of an outcome is often evaluated relative to salient reference points. In the background, increasing sequences of positive outcomes are more enjoy- able than decreasing sequences. In the foreground, outcomes that could have been worse are often more enjoyable than those that could have been better. How does pleasure vary when both background and foreground reference points are salient? Using a repeated gambling task in which participants make a choice, learn the outcome, watch their cumulative earnings change, and rate the pleasure of the out- come, we explore this question. Pleasure depends on background and foreground reference points, but the immediate events tend to dominate. The relatively narrow focus on the most recent reference points leads to myopic pleasure. We offer a modified version of decision affect theory to account for the results and explore the implications for consumer satisfaction

Effort for Payment

The standard model of labor is one in which individuals trade their time and energy in return for monetary rewards. Building on Fiske’s relational theory (1992), we propose that there are two types of markets that determine relationships between effort and payment: monetary and social. We hypothesize that monetary markets are highly sensitive to the magnitude of compensation, whereas social markets are not. This perspective can shed light on the well-established observation that people sometimes expend more effort in exchange for no payment (a social market) than they expend when they receive low payment (a monetary market). Three experiments support these ideas. The experimental evidence also demonstrates that mixed markets (markets that include aspects of both social and monetary markets) more closely resemble monetary than social markets

Method of remotely characterizing thermal properties of a sample

A sample in a wind tunnel is radiated from a thermal energy source outside of the wind tunnel. A thermal imager system, also located outside of the wind tunnel, reads surface radiations from the sample as a function of time. The produced thermal images are characteristic of the heat transferred from the sample to the flow across the sample. In turn, the measured rates of heat loss of the sample are characteristic of the flow and the sample

A respondent friendly method of ranking long lists

This article illustrates a respondent-friendly approach to preference elicitation over large choice sets, which overcomes limitations of rating, full-list ranking, conjoint and choice-based approaches. This approach, HLm, requires respondents to identify the top and bottom m items from an overall list. Across respondents, the number of times an item appears in participants’ L (low) list is subtracted from the number of times it appears in participants\u27 H (high) list. These net scores are then used to order the total list. We illustrate the approach in three experiments, demonstrating that it compares favourably to familiar methods, while being much less demanding on survey participants. Experiment 1 had participants alphabetise words, suggesting the HLm method is easier than full ranking but less accurate if m does not increase with increases in list length. The objective of experiment 2 was to order US states by population. In this domain, where knowledge was imperfect, HLm outperformed full ranking. Experiment 3 involved eliciting respondents’ personal tastes for fruit. HLm resulted in a final ranking that correlated highly with MaxDiff scaling. We argue that HLm is a viable method for obtaining aggregate order of preferences across large numbers of alternatives

Neural network identification of keystream generators

Applications such as stream ciphers and spread spectra require the generation of binary keystreams to implement, and the simulation of such keystreams to break. Most cryptanalytic attacks are of the known generator type, that is, they assume knowledge of the method used to generate the keystream. We show that a neural network can be used to identify the generator, and in some cases to simulate the keystream.http://archive.org/details/neuralnetworkide00leadApproved for public release; distribution is unlimited