Competition Between Novelty and Cocaine Conditioned Reward Is Sensitive to Drug Dose and Retention Interval

The conditioned rewarding effects of novelty compete with those of cocaine for control over choice behavior using a place conditioning task. The purpose of the present study was to use multiple doses of cocaine to determine the extent of this competition and to determine whether novelty’s impact on cocaine reward was maintained over an abstinence period. In Experiment 1, rats were conditioned with cocaine (7.5, 20, or 30 mg/kg ip) to prefer one side of an unbiased place conditioning apparatus relative to the other. In a subsequent phase, all rats received alternating daily confinements to the previously cocaine paired and unpaired sides of the apparatus. During this phase, half the rats had access to a novel object on their initially unpaired side; the remaining rats did not receive objects. The ability of novelty to compete with cocaine in a drug free and cocaine challenge test was sensitive to cocaine dose. In Experiment 2, a place preference was established with 10 mg/kg cocaine and testing occurred after 1, 14, or 28 day retention intervals. Findings indicate that choice behaviors mediated by cocaine conditioning are reduced with the passing of time. Taken together, competition between cocaine and novelty conditioned rewards are sensitive to drug dose and retention interval.

A New Birth-Interval Approach to Estimating Demographic Parameters of Humpback Whales

A demographic model is developed based on interbirth intervals and is applied to estimate the population growth rate of humpback whales (Megaptera novaeangliae) in the Gulf of Maine. Fecundity rates in this model are based on the probabilities of giving birth at time t after a previous birth and on the probabilities of giving birth first at age x. Maximum likelihood methods are used to estimate these probabilities using sighting data collected for individually identified whales. Female survival rates are estimated from these same sighting data using a modified Jolly–Seber method. The youngest age at first parturition is 5 yr, the estimated mean birth interval is 2.38 yr (SE = 0.10 yr), the estimated noncalf survival rate is 0.960 (SE = 0.008), and the estimated calf survival rate is 0.875 (SE = 0.047). The population growth rate (l) is estimated to be 1.065; its standard error is estimated as 0.012 using a Monte Carlo approach, which simulated sampling from a hypothetical population of whales. The simulation is also used to investigate the bias in estimating birth intervals by previous methods. The approach developed here is applicable to studies of other populations for which individual interbirth intervals can be measured.

Applications of Linear Programming to Coding Theory

Maximum-likelihood decoding is often the optimal decoding rule one can use, but it is very costly to implement in a general setting. Much effort has therefore been dedicated to find efficient decoding algorithms that either achieve or approximate the error-correcting performance of the maximum-likelihood decoder. This dissertation examines two approaches to this problem. In 2003 Feldman and his collaborators defined the linear programming decoder, which operates by solving a linear programming relaxation of the maximum-likelihood decoding problem. As with many modern decoding algorithms, is possible for the linear programming decoder to output vectors that do not correspond to codewords; such vectors are known as pseudocodewords. In this work, we completely classify the set of linear programming pseudocodewords for the family of cycle codes. For the case of the binary symmetric channel, another approximation of maximum-likelihood decoding was introduced by Omura in 1972. This decoder employs an iterative algorithm whose behavior closely mimics that of the simplex algorithm. We generalize Omura's decoder to operate on any binary-input memoryless channel, thus obtaining a soft-decision decoding algorithm. Further, we prove that the probability of the generalized algorithm returning the maximum-likelihood codeword approaches 1 as the number of iterations goes to infinity.