The idea that somemedical procedures are unnecessary and can do more harm than good is as old as medicine itself. In Mesopotamia 38 centuries ago, Hammurabi proclaimed a law threatening overzealous surgeons with the loss of a hand or an eye. In 1915, at the height of a surgical vogue for prophylactic appendicectomy, Ernest Codman offended his Boston colleagues with a cartoon (figure⇓) mocking t...

The merging of optimization and simulation technologies has seen a rapid growth in recent years. A Google search on “Simulation Optimization” returns more than six thousand pages where this phrase appears. The content of these pages ranges from articles, conference presentations and books to software, sponsored work and consultancy. This is an area that has sparked as much interest in the acade...

Abstract This is a history of the creation book Fatal Years: Child Mortality in late-Nineteenth-Century America (1991) by authors. The data were sample households from 1900 United States Census manuscripts. primary method used was indirect estimation child mortality (approximately ages 0–4) using information on age and marriage duration women. Among findings overall lower than 1900/1902 Glover ...

the solar radiation received by earth surface is one of the most applicable parameter that is so important in hydrology, agriculture, meteorology and climatological modeling. because of very expensive instrument for measuring the radiation, researchers suggested many different experimental equations to estimate this parameter in different climate. seven models which are calibrated for semi-arid...

The class of problems known as quadratic zero-one (binary) unconstrained optimisation has provided access to a vast array of combinatorial optimisation problems, allowing them to be expressed within the setting of a single unifying model. A gap exists, however, in addressing polynomial problems of degree greater than 2. To bridge this gap, we provide methods for efficiently executing core searc...

We study the average-case running-time of single-source shortest-path (SSSP) algorithms assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0,1]. We give the first label-setting and label-correcting algorithms that run in linear time O(n+ m) on the average. In fact, the result for the label-setting version is even obtained for ...

The Quadratic Knapsack Problem can be formulated, using an idea of Glover, as a mixed 0-1 linear program with only 2n variables. We present a simple method for strengthening that formulation, which gives good results when the profit matrix is dense and non-negative.