The Annual Condition of Education Report, 2000

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act,

The Annual Condition of Education Report, 1998

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act,

The Annual Condition of Education Report, 1999

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act,

The Annual Condition of Education Report, 2006

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act.

The Annual Condition of Education Report, 2001

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act.

The Annual Condition of Education Report, 2004

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act.

The Annual Condition of Education Report, 2005

Statistics about public edcuation in the state of Iowa including graduation rates, No Child Left Behind Act.

Audit report on the Iowa Department of Education for the year ended June 30, 2006

Audit report on the Iowa Department of Education for the year ended June 30, 2006

The State Report Card for No Child Left Behind Iowa Department of Education, December 2006

The No Child Left Behind Act (NCLB) of 2001 requires each state to provide an annual report card to inform stakeholders and the public about the progress of students and schools on indicators of student achievement and other information that relates to student success. The State Report Card provides state level data to serve as a comparison for schools and districts as they consider and implement improvement efforts to increase the success for all Iowa students.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

A new compact linear programming formulation for choice network revenue management

The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.

The impact of investment in education on economic development: Spain in comparative perspective (1860-2000)

Throughout the 19th century and until the mid-20th century, in terms of long-terminvestment in human capital and, above all, in education, Spain lagged far behind theinternational standards and, more specifically, the levels attained by its neighbours inEurope. In 1900, only 55% of the population could read; in 1950, the figure was 93%.This no doubt contributed to a pattern of slower economic growth in which thephysical strength required for agricultural work, measured here through height, had alarger impact than education on economic growth. It was not until the 1970s, with thearrival of democracy, that the Spanish education system was modernized and theinfluence of education on economic growth increased.

IT Education News, Jan.-Feb., 2003

Bimonthly newsletter detailing the current computer classes offered by DAS-ITE.