We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and exper...

We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is ...

The main goals of this paper are to show the impact of the basic assumptions for the cover channel characteristics as well as the impact of different training/testing set generation strategies on the statistical detectability of exemplary chosen audio hiding approaches known from steganography and watermarking. Here we have selected exemplary five steganography algorithms and four watermarking ...

An Audio Secret Sharing (ASS) scheme is a special type of secret sharing scheme [3], which the shares of embedded messages use music as cover sound. Desmedt et al. firstly introduced the (2, 2) ASS scheme with one cover sound and also the generalized (2, n) ASS scheme with log2n different cover sounds. No only will more cover sounds overburden the human hearing system but also may become diff...

We investigate the algorithmic and implementation issues related to the e ective and e cient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for integer programming We have tried various strategies on several test problems and we identify the best ones for use in practice

Software testing research has resulted in effective white-box test generation techniques that can produce unit test suites achieving high code coverage. However, research prototypes usually only cover subsets of the basic programming language features, thus inhibiting practical use and evaluation. One feature commonly omitted are Java’s generics, which have been present in the language since 20...

Redundant test set is one of focuses in recent bioinformatics research. The author investigates the phenomenon of ”differentiation repetition” of (redundant) test set and utilizes derandomization method to give deeper approximability results of redundant test set conditionally better than directly derived from set cover. Set cover greedy algorithm (SGA for short) is a common used algorithm for ...

Redundant test set is one of focuses in recent bioinformatics research. The author investigates the phenomenon of ”differentiation repetition” of (redundant) test set and utilizes derandomization method to give deeper approximability results of redundant test set conditionally better than directly derived from set cover. Set cover greedy algorithm (SGA for short) is a common used algorithm for ...

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...