  The goal of this paper is twofold. First, we present a unified way of
formulating numerical integration problems from both approximation theory and
discrepancy theory. Second, we show how techniques, developed in approximation
theory, work in proving lower bounds for recently developed new type of
discrepancy -- the smooth discrepancy.
