Schema mappings have been extensively studied in database research over the past decade – notably in the areas of data exchange and data integration. Recently, the notion of an information transfer order on schema mappings has been introduced to compare the amount of source information that is actually transferred by two mappings. In this paper, we present two new operators: the union and inter...

We prove that Thompson's group F is not minimally almost convex with respect to any generating set which is a subset of the standard infinite generating set for F and which contains x1. We use this to show that F is not almost convex with respect to any generating set which is a subset of the standard infinite generating set, generalizing results in [HST].

We describe an asynchronous parallel derivative-free algorithm for linearly constrained optimization. Generating set search (GSS) is the basis of our method. At each iteration, a GSS algorithm computes a set of search directions and corresponding trial points and then evaluates the objective function value at each trial point. Asynchronous versions of the algorithm have been developed in the un...

We provide a new framework for generating multiple good quality partitions (clusterings) of a single data set. Our approach decomposes this problem into two components, generating many high-quality partitions, and then grouping these partitions to obtain k representatives. The decomposition makes the approach extremely modular and allows us to optimize various criteria that control the choice o...

In this paper, a necessary and sufficient condition on which a set of implications is complete is proposed with the help of the notion of model from logic. Besides, using the closure of an attribute subset to a set of implications, we present a formal method to remove the redundant implications from a complete set. Subsequently, we provide an algorithm to generate a complete set of implications...

This paper presents an effective approach to generate a set of small textures from an input texture that can be tiled together to synthesize large textures. Such a small set can be useful in texturing any large area realistically and efficiently while consuming only a small amount of texture memory. Our approach is advantageous in its ability to generate a smaller number of tiles that can embed...

We propose an approach to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent finite state machine for testing reactive and embedded software. Test cases are expressed as a sequence of messages to be exchanged among various system entities. We use scenario activation conditions and state assignments to generate only the feasible states and ...

We consider a direct search approach for solving nonsmooth minimization problems where the objective function is locally Lipschitz continuous and piecewise continuously differentiable on a finite family of polyhedra. A generating set search method is proposed, which is named structured because the structure of the set of nondifferentiability near the current iterate is exploited to define the s...

We introduce a new facet-generating procedure for the stable set polytope, based on replacing (k− 1)-cliques with certain k-partite graphs, which subsumes previous procedures based on replacing vertices with stars, and thus also many others in the literature. It can be used to generate new classes of facet-defining inequalities.

Generating synthetic data set which is realistic as well as sufficiently large has been a cumbersome task for researchers in the past. Several models have been proposed previously, all adopting heterogeneous approaches, in this work the emphasis is on speeding up the compute time of the data set distribution. Here, Uniform, Poisson and Zipf distributions have been studied and approaches with pa...