Handbook of American Indian languages. Part 2 / by Franz Boas ; with illustrative sketches by Edward Sapir, Leo J. Frachtenberg, and Waldemar Bogoras

Collection : Bulletin - Smithsonian institution. Bureau of American ethnology ; 40

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.

On the throughput-WIP trade-off in queueing systems, diminishing returns and the threshold property: A linear programming approach

We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Efectos de la presencia social de las lenguas escolares en el desarrollo lingüístico del alumnado extranjero. Un estudio empírico en Cataluña = The Social Presence of School Languages and Their Effects on the Development of Immigrant Students’ Linguistic Proficiency. An Empirical Study in Catalonia

El estudio de las variables relacionadas con la adquisición de las lenguas escolares en contextos bilingües y multilingües ha resurgido a raíz de la incorporación de alumnado extranjero al sistema educativo español. En este sentido, y gracias a su peculiar situación sociolingüística, Cataluña se ha convertido en un observatorio perfecto para estudiar el proceso de adquisición de lenguas del alumnado extranjero. En este artículo presentamos una parte de los datos obtenidos en la evaluación del conocimiento de catalán y del castellano de 668 alumnos extranjeros de sexto de Primaria escolarizados en 57 centros de Cataluña. Con ello pretendemos estudiar los efectos de la presencia y del uso social de las lenguas escolares en el conocimiento lingüístico de este alumnado. La hipótesis principal es que el desarrollo de buenos niveles de conocimiento escrito de las lenguas escolares por parte de los alumnos extranjeros depende, en buena medida, de las oportunidades que haya en el entorno social para que ellos puedan utilizar estas lenguas en los intercambios comunicativos informales con sus compañeros o con otros adultos. Las conclusiones del trabajo señalan las relaciones existentes entre el desarrollo de habilidades lingüísticas conversacionales y el de habilidades lingüísticas cognitivo-académicas (Cummins, 1979b), en el sentido de que tanto el conocimiento escrito de catalán como el de castellano que tiene el alumnado extranjero están condicionados por el nivel de desarrollo conversacional previo en ambas lenguas. Además, apuntan a que la transferencia de habilidades lingüísticas cognitivo-académicas no se produce directamente entre el catalán y el castellano, sino que depende fundamentalmente de la presencia social que tengan estas lenguas y de sus usos informales. Así, en la medida en que un buen número de estudiantes extranjeros no desarrolla suficiente competencia lingüística conversacional ni en catalán ni en castellano, el proceso de adquisición de las lenguas escolares se alarga más allá de los seis años

A citation analysis of Catalan literary studies (1974-2003): towards a bibliometrics of humanities studies in minority languages

A citation analysis was carried out on the most important research journals in the field of Catalan literature between 1974 and 2003. The indicators and qualitative parameters obtained show the value of performing citation analysis in cultural and linguistic areas that are poorly covered by the A&HCI. Catalan literature shows a similar pattern to that of humanities in general, but it could still be in a stage of consolidation because too little work has as yet been published.

Report to the Governor and General Assembly on the Status of Out-of School Arts Programming for Youth, December 2006

In the 2006 Iowa General Assembly, House File 2797 called for a study on the status of afterschool arts programs and appropriated $5,000 for the study. In accordance with the legislation, the Iowa Arts Council, who received the charge, contracted with the Iowa Afterschool Alliance to form a Resource Group of out-of-school arts providers and experts to develop and oversee the study, review its results, and make recommendations for the expansion of arts programs that operate outside the normal school day. As a part of its charge in HF 2797, the Iowa Arts Council also documented a sampling of out-of-school arts programs statewide. Five are featured in this report.

Improving Offender Programming, Data Download, Iowa Department of Corrections, June 2012

In 2008, the Iowa Department of Corrections embarked on a comprehensive audit of all institutional andcommunity corrections offender programs that receive corrections funding. The audit focused on the degree towhich each program adheres to evidence-based practices principles (what works best). The audit areas are listedbelow along with some examples of the questions asked about each program:

New Violence Risk Assessment Aids Parole and Offender Programming Decisions, Data Download, Department of Corrections

In recent years, the Department of Corrections has made major strides in assessing offenders’ risk to reoffend, particularly in measuring changes in that risk over time. Earlier this year, the DOC worked with the Board of Parole to develop a risk assessment that focuses on assessing offenders’ risk to commit violent crimes.