We present several e cient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly-optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all bandwidths for other versions of UMH ...

CASE SHOWING THE CONTAGIOUSNESS OF PHTHISIS. A man of thirty-four had been sick with phthisis about four years; gradually grew from bad to worse, until the usual end was reached. It was not until the last three or four months of his life that he was confined to his bed. He was fond of pets, and during these three or four mouths, it was hia fancy to have his dog in the room nearly all the time. ...

the optimal allocation of the chahnimeh water resources among different sectors, viz. domestic, agricultural and environmental consumptions, was determined using the goal programming method in gams, based on the present condition in the area. results showed an increase of 15.4, 44.5 and 230% in allocation of water to domestic, agriculture and environment sectors, respectively, in this method as...

In this paper, we propose methods for solving broadly applicable integer multicommodity flow problems. We focus in particular on the problem of routing and wavelength assignment (RWA), which is critically important for increasing the efficiency of wavelength-routed all-optical networks. Our methodology can be applied as a special case to the problem of routing in a circuit-switched network. We ...

the objective of this study was to determine the optimum replacement strategy using dynamic programming for dairy herds in fars province. a dairy cow is kept several lactations for milk production in the herd. after spending several lactations, milk production gradually begins to decline, while animal health problems rises simultaneously. so one of the most important management decisions of dai...

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.