There is no documented study to indicate the role of prolonged packing of renal fossa (24 to 48 hours) to control bleeding in life threating haemorrhage following open pyelolithotomy without compromise in the renal functions. On the contrary emergency nephrectomy was performed for intractable bleeding during renal stone surgery in peripheral hospitals. Several studies have shown the usefulness ...

We study a variant of the classical bin-packing problem, the ordered open-end bin-packing problem, where first a bin can be filled to a level above 1 as long as the removal of the last piece brings the bin’s level back to below 1 and second, the last piece is the largest-indexed piece among all pieces in the bin. We conduct both worst-case and average-case analyses for the problem. In the worst...

In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (MFFD) as a su...

In this paper, the effects of container size on the porosity of random loose packing of mono size particles have been investigated using an Event Dynamics (ED) based model. Simultaneous effects of square container walls on particles packing and their order are also investigated. Our simulation results indicate higher container size will increase the total packing factor and high density regions...

In a packing problem, the goal is to put some small objects disjointly into a large container, while optimizing some objective function. The packing problem is very general, and a rich variety of objects and containers are possible. One major split in the taxonomy of packing concerns whether the objects to be packed are allowed to be different or are all identical. In the case of identical pack...