6,332 research outputs found
On the Asymptotic Worst Case Behavior of Harmonic Fit
In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1/r in a minimal number of unit-capacity bins. Among the approximation algorithms, the class of Harmonic Fit algorithms (HFM) plays an important role. Lee and Lee (J. Assoc. Comput. Mach. 32 (1985), 562-572) and Galambos (Ann. Univ. Sci. Budapest Sect. Comput. 9 (1988), 121-126) provide upper bounds for the asymptotic worst case ratio of HFM and show tightness for certain values of the parameter M. In this paper we provide worst case examples that meet the known upper bound for additional values of M, and we show that for remaining values of M the known upper bound is not tight. For the classical bin packing problem (r = 1), we prove an asymptotic worst case ratio of 12/7 for the case M = 4 and 1.7 for the case M = 5. We give improved lower bounds for some interesting cases that are left open
Photon up-conversion in water by encapsulation of sensitizer and emitter units in single chain polymeric nanoparticles
Pan-European backcasting exercise, enriched with regional perspective, and including a list of short-term policy options
This deliverable reports on the results of the third and final pan-European stakeholder meeting and secondly, on the enrichment with a Pilot Area and regional perspective. The main emphasis is on backcasting as a means to arrive at long-term strategies and short-term (policy) actions
Scaling Up Student Assessment: Issues and Solutions
Online courses permit the enrollment of large numbers of students, which forces instructors to address the problem of providing valid and reliable assessments of student performance on a large scale. This paper examines two broad approaches for scaling up student assessment and feedback in higher education: automated assessment techniques and distributed assessment methods
Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms
In this paper we discuss lower bounds for the asymptotic worst case ratio of on-line algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1-dimensional bin packing problem. Following their ideas, we present a general technique that can be used to derive lower bounds for other bin packing problems as well. We apply this technique to prove new lower bounds for the 2-dimensional (1.802...) and 3-dimensional (1.974...) bin packing problem
Climate change impact on the leaching of a heavy metal contamination in a small lowland catchment
The objective of this study was to assess the potential effects of climate change on the transport of pre-existing spatially-extensive trace metal contamination to a small lowland catchment in the south of the Netherlands. The area surrounding the Keersop has been contaminated with heavy metals by the atmospheric emissions of four zinc ore smelters. This heavy metal contamination, e.g. with Cd and Zn, has accumulated in the topsoil and leaches towards surface water system, especially during high groundwater levels and high discharge rates. Simulated projections of future climate predict increased precipitation in winter, less precipitation in summer, and higher air temperatures throughout the year. These climate change scenarios projected lower groundwater levels and lower discharge rates. As a result of lower groundwater levels, transport of Cd and Zn towards surface water is also projected to decrease in the future climate. These results indicate a positive effect of climate change on a limited aspect of surface water quality
- …