Report of the Ice Arena Facility Revenue Note Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Ice Arena Facility Revenue Note Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Indoor Multipurpose Use and Training Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Indoor Multipurpose Use and Training Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Regulated Materials Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Regulated Materials Facility Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Memorial Union Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Memorial Union Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Athletic Facilities Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Report of the Athletic Facilities Revenue Bond Funds of Iowa State University of Science and Technology as of and for the year ended June 30, 2008

Differential Recognition of Old World and New World Arenavirus Envelope Glycoproteins by Subtilisin Kexin Isozyme 1 (SKI-1)/Site 1 Protease (S1P).

The arenaviruses are an important family of emerging viruses that includes several causative agents of severe hemorrhagic fevers in humans that represent serious public health problems. A crucial step of the arenavirus life cycle is maturation of the envelope glycoprotein precursor (GPC) by the cellular subtilisin kexin isozyme 1 (SKI-1)/site 1 protease (S1P). Comparison of the currently known sequences of arenavirus GPCs revealed the presence of a highly conserved aromatic residue at position P7 relative to the SKI-1/S1P cleavage side in Old World and clade C New World arenaviruses but not in New World viruses of clades A and B or cellular substrates of SKI-1/S1P. Using a combination of molecular modeling and structure-function analysis, we found that residueY285 of SKI-1/S1P, distal from the catalytic triad, is implicated in the molecular recognition of the aromatic "signature residue" at P7 in the GPC of Old World Lassa virus. Using a quantitative biochemical approach, we show that Y285 of SKI-1/S1P is crucial for the efficient processing of peptides derived from Old World and clade C New World arenavirus GPCs but not of those from clade A and B New World arenavirus GPCs. The data suggest that during coevolution with their mammalian hosts, GPCs of Old World and clade C New World viruses expanded the molecular contacts with SKI-1/S1P beyond the classical four-amino-acid recognition sequences and currently occupy an extended binding pocket.

Iowa Department of Revenue Performance Plan, FY 2009

Agency Performance Plan, Iowa Department of Revenue

Iowa Workforce Development Revenue Performance Plan, FY 2009

Agency Performance Plan, Iowa Workforce Development

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

An enhanced concave program relaxation for choice network revenue management

The network choice revenue management problem models customers as choosing from an offer-set, andthe firm decides the best subset to offer at any given moment to maximize expected revenue. The resultingdynamic program for the firm is intractable and approximated by a deterministic linear programcalled the CDLP which has an exponential number of columns. However, under the choice-set paradigmwhen the segment consideration sets overlap, the CDLP is difficult to solve. Column generation has beenproposed but finding an entering column has been shown to be NP-hard. In this paper, starting with aconcave program formulation based on segment-level consideration sets called SDCP, we add a class ofconstraints called product constraints, that project onto subsets of intersections. In addition we proposea natural direct tightening of the SDCP called ?SDCP, and compare the performance of both methodson the benchmark data sets in the literature. Both the product constraints and the ?SDCP method arevery simple and easy to implement and are applicable to the case of overlapping segment considerationsets. In our computational testing on the benchmark data sets in the literature, SDCP with productconstraints achieves the CDLP value at a fraction of the CPU time taken by column generation and webelieve is a very promising approach for quickly approximating CDLP when segment consideration setsoverlap and the consideration sets themselves are relatively small.

Iowa Department of Revenue, Strategic Plan, 2007-2010

This report outlines the strategic plan for Iowa Department of Revenue, goals and mission.

A finite-population revenue management model and a risk-ratio procedure for the joint estimation of population size and parameters

Many dynamic revenue management models divide the sale period into a finite number of periods T and assume, invoking a fine-enough grid of time, that each period sees at most one booking request. These Poisson-type assumptions restrict the variability of the demand in the model, but researchers and practitioners were willing to overlook this for the benefit of tractability of the models. In this paper, we criticize this model from another angle. Estimating the discrete finite-period model poses problems of indeterminacy and non-robustness: Arbitrarily fixing T leads to arbitrary control values and on the other hand estimating T from data adds an additional layer of indeterminacy. To counter this, we first propose an alternate finite-population model that avoids this problem of fixing T and allows a wider range of demand distributions, while retaining the useful marginal-value properties of the finite-period model. The finite-population model still requires jointly estimating market size and the parameters of the customer purchase model without observing no-purchases. Estimation of market-size when no-purchases are unobservable has rarely been attempted in the marketing or revenue management literature. Indeed, we point out that it is akin to the classical statistical problem of estimating the parameters of a binomial distribution with unknown population size and success probability, and hence likely to be challenging. However, when the purchase probabilities are given by a functional form such as a multinomial-logit model, we propose an estimation heuristic that exploits the specification of the functional form, the variety of the offer sets in a typical RM setting, and qualitative knowledge of arrival rates. Finally we perform simulations to show that the estimator is very promising in obtaining unbiased estimates of population size and the model parameters.

Annual Report of the Iowa Department of Revenue FY2008

Annual Report of the Iowa Department of Revenue FY2008

Addendum to Annual Report of the Iowa Department of Revenue FY2008

Addendum to Annual Report of the Iowa Department of Revenue FY2008

Molecular characterization of HLA-C incompatibilities in HLA-ABDR-matched unrelated bone marrow donor-recipient pairs. Sequence of two new Cw alleles (Cw*02023 and Cw*0707) and recognition by cytotoxic T lymphocytes.

While the influence of HLA-AB and -DRB1 matching on the outcome of bone marrow transplantation (BMT) with unrelated donors is clear, the evaluation of HLA-C has been hampered by its poor serological definition. Because the low resolution of standard HLA-C typing could explain the significant number of positive cytotoxic T lymphocyte precursor frequency (CTLpf) tests found among HLA-AB-subtype, DRB1/B3/B5-subtype matched patient/donor pairs, we have identified by sequencing the incompatibilities recognized by CD8+ CTL clones obtained from such positive CTLpf tests. In most cases the target molecules were HLA-C antigens that had escaped detection by serology (e.g. Cw*1601, 1502 or 0702). Direct recognition of HLA-C by a CTL clone was demonstrated by lysis of the HLA class I-negative 721.221 cell line transfected with Cw*1601 cDNA. Because of the functional importance of Cw polymorphism, a PCR-SSO oligotyping procedure was set up allowing the resolution of 29 Cw alleles. Oligotyping of a panel of 382 individuals (including 101 patients and their 272 potential unrelated donors, 5 related donors and 4 platelet donors) allowed to determine HLA-C and HLA A-B-Cw-DRB1 allelic frequencies, as well as a number of A-Cw, B-Cw, and DRB1-Cw associations. Two new HLA-Cw alleles (Cw*02023 and Cw*0707) were identified by DNA sequencing of PCR-amplified exon 2-intron 2-exon 3 amplicons. Furthermore, we determined the degree of HLA-C compatibility in 287 matched pairs that could be formed from 73 patients and their 184 potential unrelated donors compatible for HLA-AB by serology and for HLA-DRB1/ B3/B5 by oligotyping. Cw mismatches were identified in 42.1% of these pairs, and AB-subtype oligotyping showed that 30% of these Cw-incompatible pairs were also mismatched for A or B-locus subtype. The degree of HLA-C incompatibility was strongly influenced by the linkage with B alleles and by the ABDR haplotypes. Cw alleles linked with B*4403, B*5101, B18, and B62 haplotypes were frequently mismatched. Apparently high resolution DNA typing for HLA-AB does not result in full matching at locus C. Since HLA-C polymorphism is recognized by alloreactive CTLs, such incompatibilities might be as relevant as AB-subtype mismatches in clinical transplantation.