Presently, the process of extraction and dissemination of data subsets for research from clinical data warehouses is cumbersome and error prone. Furthermore, large-scale research projects often involve multiple users of the same data extract; each of these users may be authorized to access different data elements and specific subsets of the data extract. Once initial data extraction has been do...

An unsatisfiable set of constraints is minimal if all its (strict) subsets are satisfiable. The task of type error diagnosis requires finding all minimal unsatisfiable subsets of a given set of constraints (representing an error), in order to generate the best explanation of the error. Similarly circuit error diagnosis requires finding all minimal unsatisfiable subsets in order to make minimal ...

Feature selection for various applications has been carried out for many years in many different research areas. However, there is a trade-off between finding feature subsets with minimum length and increasing the classification accuracy. In this paper, a filter-wrapper feature selection approach based on fuzzy-rough gain ratio is proposed to tackle this problem. As a search strategy, a modifie...

Diverting large quantities of goods from authorized distribution channels to unauthorized or “gray market” channels, albeit legal, significantly affects both firms and consumers due to effects on price, revenue, service and warranty availability, and product availability. In this paper we consider mechanisms by which the uncertainty surrounding inventory ordering decisions drives gray markets. ...

Secure keyword search in shared infrastructures prevents stored documents from leaking sensitive information to unauthorized users. A shared index provides confidentiality if it is exclusively used by users authorized to search all the indexed documents. We introduce the Lethe indexing workflow to improve query and update efficiency in secure keyword search. The Lethe workflow clusters together...

Secret sharing is a cryptographic primitive, which is used to distribute a secret among participants in such a way that an authorized subset of participants can uniquely reconstruct the secret and an unauthorized subset can get no information about the secret. It is a fundamental method used in secure multiparty computations, where various distrusted participants cooperate and conduct computati...

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasipolynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected edge subsets of a given graph can be generated in incremental polynomial time.

The aim of a secret sharing scheme is to share a secret among a group of participants in such a way that while authorized subsets of participants are able to recover the secret, non-authorized subsets of them obtain no information about it. Multi-secret sharing is the natural generalization of secret sharing for situations in which the simultaneous protection of more than one secret is required...