Regional adjustments in grain production : a linear programming analysis /

"U.S. Dept. of Agriculture, in cooperation with Iowa Agriculture and Home Economics Experiment Station Center for agricultural and economic adjustment."

Regional analysis of production adjustments in the major field crops : historical and prospective : an application of spatial linear programming /

Literature cited and selected references: p. 38-41.

Planning, programming, budgeting : hearings ... Ninetieth Congress, first session.

Hearings held Aug. 23, 1967-July 4, 1968.

Proceedings of the symposium in linear programming.

Sponsored by Office of Scientific Research of the Air Research and Development Command and held jointly by National Bureau of Standards and the Directorate of Management Analysis, DCS/Comptroller, USAF.

The English, Scotch and Irish historical libraries. Giving a short view and character of most of our historians, either in print or manuscript. With an account of our records, lawbooks, coins, &c. by W. Nicolson, late bishop of Carlisle. To which is added, A letter to the Reverend White Kennet, D. D., in defence of the English historical library, &c.

The letter to Kennett is a reply to Francis Atterbury.

The arts build communities : a training handbook on arts programming and public housing /

Shipping list no.: 97-0031-P.

The Formation and Circulation of Early Yanzi Lore, Fourth Century B.C. - Third Century A.D.

Thesis (Ph.D.)--University of Washington, 2016-06

Obstacles to a totally functional programming style

"Totally functional programming" (TFP) advocates the complete replacement of symbolic representations for data by functions. TFP is motivated by observations from practice in language extensibility and functional programming. Its technical essence extends the role of "fold" functions in structuring functional programs to include methods that make comparisons on elements of data structures. The obstacles that currently prevent the immediate uptake of TFP as a style within functional programming equally indicate future research directions in the areas of theoretical foundations, supporting technical infrastructure, demonstrated practical applicability, and relationship to OOP.

Heuristic algorithm for computing reversal distance with multigene families via binary integer programming

Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum number of reversals required for rearranging a genome to another when gene duplication is nonexisting. In this paper, we show how to extend the Hannenhalli-Pevzner approach to genomes with multigene families. We propose a new heuristic algorithm to compute the reversal distance between two genomes with multigene families via the concept of binary integer programming without removing gene duplicates. The experimental results on simulated and real biological data demonstrate that the proposed algorithm is able to find the reversal distance accurately. ©2005 IEEE