When testing software, testers rarely use only one technique to generate tests that, they hope, will fulfill their testing criteria. Malaiya showed that testers switch strategies when testing yield saturates. We present and evaluate a stopping rule that can be used to determine when it is time to switch to a different testing technique, because the current one is not likely to increase criteria...

Linked faults are very important for memory testing because they reduce the fault coverage of the tests. Their analysis has proven to be a source for new memory tests, characterized by an increased fault coverage for a given test time. This paper presents an analysis of linked faults, based on the concept of fault primitives, such that the whole space of linked faults is investigated, accounted...

Among other things, the modern game of football is characterised by pronounced group and team-oriented tactical abilities. Of particular importance is thereby zone defence or zone coverage, which is used by almost all teams playing at an elevated level of performance. In contrast to man-marking, this more efficient form of organisation is very difficult to convey, as attention must at any given...

Modern orthopedic surgery can improve the musculoskeletal problems of people with hemophilia. The most commonly affected joints are the knees, the ankles and the elbows. The most common orthopedic procedures that PWH undergo are the following: RS, arthroscopic synovectomy, arthroscopic joint debridement, ankle arthrodesis, total joint arthroplasty and removal of pseudotumors. Every surgical pro...

We consider the problem of covering a domain by mobile sensors and the design of an efficient schedule that reduces unnecessary sensor overlap and energy consumption. The problem is motivated by emerging participatory sensing applications as well as other coverage problems involving mobile nodes. The problem of minimizing the total energy consumption while maintaining the same level of coverage...

Let Sn be the set of all permutations on [n] := {1, 2, . . . , n}. We denote by κn the smallest cardinality of a subset A of Sn+1 that “covers” Sn, in the sense that each π ∈ Sn may be found as an order-isomorphic subsequence of some π′ in A. What are general upper bounds on κn? If we randomly select νn elements of Sn+1, when does the probability that they cover Sn transition from 0 to 1? Can w...

Recent initiatives that overstate health insurance coverage for well-being conflict with the recognized antagonistic facts identified by the determinants of health that identify health care as an intermediate factor. By using a network of controlled interdependences among multiple social resources including health insurance, which we reconstructed from survey data of the U.S. and Bayesian netwo...

We address the problem of optimal node placement for ensuring connected coverage in sensor networks. We consider two different practical scenarios. In the first scenario, a certain region (or a set of regions) are to be provided connected coverage, while in the second case, a given set of n points are to be covered and connected. For the first case, we provide solutions that are within a small ...