We analyse optimal rejection strategies for classifiers with input space partitioning, e.g. prototype-based classifiers, support vector machines or decision trees using certainty measures such as the distance to the closest decision border. We provide new theoretical results: we link this problem to the multiple choice knapsack problem and devise an exact polynomial-time dynamic programming (DP...

The mixing set with a knapsack constraint arises in deterministic equivalent of chance-constrained programming problems with finite discrete distributions. We first consider the case that the chance-constrained program has equal probabilities for each scenario. We study the resulting mixing set with a cardinality constraint and propose facet-defining inequalities that subsume known explicit ine...

We show that the hierarchical level of detail optimization problem is equivalent to a constrained version of the Multiple Choice Knapsack Problem, and present a new algorithm whose solution to it is at least half as good as the optimal one. The advantage of the hierarchical algorithm is that it allows the use of hierarchical level of detail descriptions in which shared representations may be pr...

We present the Utility Model | a mathematicalmodel to incorporatethe dynamics of adaptive multimedia systems (AMSs). It is based on the concepts of quality pro-le, quality-resource mapping, session and system utility, and of system resource constraints. The main problem in a multi-session AMS is to nd an operating quality for each session such that the overall system utility is maximized under ...

Randomization is described by Fisher (1935) as the reasoned basis for inference about the effectiveness of treatments. Fisher advocated both using randomization in designing experiments and using “randomization inference” to analyze experiments that have been randomized. Randomization inference is inference that assumes only the physical act of randomization for its validity. It provides exact,...

This paper considers Web content adaptation with a bandwidth constraint for server-based adaptive Web systems. The problem can be stated as follows: Given a Web page P consisting of n component items d1, d2, . . . ,dn and each of the component items di having Ji versions di1 ; di2 ; . . . ; diJi , for each component item di select one of its versions to compose the Web page such that the fideli...

At SAC '97, Itoh, Okamoto and Mambo presented a fast public key cryptosystem. After analyzing several attacks including lattice-reduction attacks, they claimed that its security was high, although the cryptosystem had some resemblances with the former knapsack cryp-tosystems, since decryption could be viewed as a multiplicative knapsack problem. In this paper, we show how to recover the private...

The Multiple-choice Multi-dimensional Knapsack Problem (MMKP) is a problem which can be encountered in real-world applications, such as service level agreement, model of allocation resources, or as a dynamic adaptation of system of resources for multimedia multi-sessions. In this paper, we investigate the use of a new model-based Lagrangian relaxation for optimally solving the MMKP. In order to...

The paper addresses design/building frameworks for some kinds of tree-like and hierarchical structures of systems. The following approaches are examined: (1) expert-based procedure, (2) hierarchical clustering; (3) spanning problems (e.g., minimum spanning tree, minimum Steiner tree, maximum leaf spanning tree problem; (4) design of organizational " optimal " hierarchies; (5) design of multi-la...

The most recent trend in the Information and Communication Technology world is toward an ever growing demand of mobile heterogeneous services that imply the management of different quality of service requirements and priorities among different type of users. The long-term evolution (LTE)/LTE-advanced standards have been introduced aiming to cope with this challenge. In particular, the resource ...