To level up the application of wireless sensor network in cotton field soil monitoring, wireless sensor network technology has been studied deeply. Some difficulties, including the design of soil moisture sensor, covering problem in wireless sensor network and diagnosis algorithm for wireless sensor networks and node, are been proposed and discussed. Combined with cotton field soil moisture mon...

In this paper we prowide lower bounds on the complexity of the DNF exception problem for short exception lists and hypercube covering problem. The method proposed is based on the relaxation of the initial problem to a certain linear programming problem. Some explicit bounds are provided for the case when exception list size is bounded above by a logarithm of dimension. The bound provided in thi...

Consider a 0/1 integer program min{c T x : Ax ≥ b, x ∈ {0, 1} n } where A is nonnegative. We show that if the number of minimal covers of Ax ≥ b is polynomially bounded, then there is a polynomially large lift-and-project relaxation whose value is arbitrarily close to being at least as good as that given by the rank ≤ q cuts, for any fixed q. A special case of this result is that given by set-c...

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using curves with d degrees of freedom. Another generalization is the Hyperplane Cover problem where points in d-dimensional space are to be covered by hyperplanes. Al...

In this paper we carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the Test Cover problem we are given a set [n] = {1,. .. , n} of items together with a collection, T , of distinct subsets of these items called tests. We assume that T is a test cover, i.e., for each pair of items there is a test...

Let H = (H; V) be a hypergraph with edge set H and vertex set V. Then H is invertible ii there exists a permutation of V such that for all E 2 H, (E) \ E = ;. H is invertibility critical if H is not invertible but every hypergraph obtained by removing an edge from H is invertible. The degree of H is d if fE 2 Hjx 2 Eg d for each x 2 V. Let i(d) be the maximum number of edges of an invertibility...

When designing a product that needs to fit the human shape, designers often use a small set of 3D models, called design models, either in physical or digital form, as representative shapes to cover the shape variabilities of the population for which the products are designed. Until recently, the process of creating these models has been an art involving manual interaction and empirical guesswor...

In this paper a new criterion is introduced for the discrete covering problem. In this criterion the a priori information represented by a possibility measure and a misbelief distribution on alternatives are condensed by aggregation instruments. Using the Dempster-Shafer belief structure and representations of a possibility measure through associated probabilities, a new criterion for discrete ...

Available online 24 December 2008

We present an improved inductive learning method to derive classification rules that correctly describe most of the examples belonging to a class and do not describe most of the examples not belonging to this class. The problem is represented as a modification of the set covering problems solved by a genetic algorithm. Its is employed to medical data on coronary disease, and the results seem to...