An equivalence graph is a vertex disjoint union of complete graphs. For a graph G, let eq(G) be the irdnimum number of equivalence subgraphs of G needed to cover all edges of G. Similarly, let cc(G) be the minimum number of complete subgraphs of G needed to cover all its edges. Let H be a graph on n vertices with ma,'dmal degree _~d (and minimal degree --~ 1), and let G=I~ be its complement. We...

Introduction Conclusions References Tables Figures ◭ ◮ ◭ ◮ Back Close Full Screen / Esc Abstract Introduction Conclusions References

Composable safety certification envisions reuse of safety case argument-fragments together with safety-relevant components in order to reduce the cost and time needed to achieve certification. The argumentfragments could cover safety aspects relevant for different contexts in which the component can be used. Creating argument-fragments for the out-of-context components is time-consuming and cur...

Set cover greedy algorithm is a natural approximation algorithm for test set problem. This paper gives a precise and tighter analysis of approximation ratio of this algorithm. The author improves the approximation ratio 2 lnn directly derived from set cover to 1.14 lnn by applying potential function technique of derandomization method. In addition, the author gives a nontrivial lower bound (1+α...

We develop a polynomial time 3-2-approximation algorithm to solve the vertex cover problem on a class of graphs satisfying a property called “active edge hypothesis”. The algorithm also guarantees an optimal solution on specially structured graphs. Further, we give an extended algorithm which guarantees a vertex cover S1 on an arbitrary graph such that |S1| ≤ 32 |S*| + ξ where S* is an optimal ...

Most predictions about species responses to climate change ignore species interactions. Helland and colleagues (2011) test whether this assumption is valid by evaluating whether ice cover affects competition between brown trout [Salmo trutta (L.)] and Arctic charr [Salvelinus alpines (L.)]. They show that increasing ice cover correlates with lower trout biomass when Arctic charr co-occur, but n...

The goal of steganography is to hide the existence of secret communication between the two parties. The message to be transmitted has no relationship to the cover image and the only role the cover image plays is that of a foreign message carrier. The content of the cover image has no value to the sender or the decoder. Non-native data embedding always introduces distortion. Ideally the distorti...

Land cover of Finnish Lapland was classified to 16 land cover classes using optical IRS LISS, Spot XS and MODIS satellite images, ancillary GIS data and decision tree classifier. The aim of this study was to test decision tree classifier for land cover classification and study the effects of its parameters to classification result. In the best case, the overall accuracy was about 68% for all 16...