The Pathologic Copepod Phrixocephalus cincinnatus (Copepoda: Pennellidae) in the Eye of Arrowtooth Flounder, Atherestes stomias, and Rex Sole, Glyptocephalus zachirus, from British Columbia

We report Phrixocephalus cincinnatus, a pennellid copepod infecting the eyes of flatfishes, from a single specimen of rex sole, Glyptocephalus zachirus, for the first time. In the typical host, the arrowtooth flounder, Atherestes stomias, the parasite occurred commonly in sampled populations from the Broughton Archipelago in British Columbia, infected primarily the right eye of the flounder, and on only one occasion presented more than two parasites per eye. The copepod attached to the choroid layer and ramified throughout the posterior compartment of the eye, resulting in the disruption of the retina and probably impairing host vision. Inflammation and hyperplasia progressed to necrosis and proliferation of connective tissue, resulting in the total destruction of the eye.

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.

Friends of the Maxwell Arboretum Tree Planting

"Each generation takes the earth as trustees," J. Sterling Morton, founder of Arbor Day, once said, adding, "We ought to bequeath to posterity as many forests and orchards as we have exhausted and consumed."

2007 East Campus Arbor Day Celebration

As we celebrate Arbor Day, it seems fitting to begin with a J. Sterling Morton quote. "The cultivation of trees is the cultivation of the good, the beautiful, and the ennobling in man,” Morton once said, adding, "and for one, I wish to see it become universal."