Learn More
We estimate a bargaining model of competition between hospitals and managed care organizations (MCOs) and use the estimates to evaluate the effects of hospital mergers. We find that MCO bargaining restrains hospital prices significantly. The model demonstrates the potential impact of coinsurance rates, which allow MCOs to partly steer patients towards(More)
Weakness of the hip abductors after total hip arthroplasty may result in pain and/or functional limitation. Non-weight-bearing (NWB) exercises are often performed to target the hip abductors; however, muscle activation of NWB exercises has not been compared to weight-bearing (WB) exercises. Our purpose was to evaluate gluteus medius activation during 2 WB(More)
What are the real security issues for a wireless sensor network (WSN) intended to monitor the structural health of a suspension bridge, a subway tunnel or a water distribution pipe? Could an attack on the sensor network cause the structure to collapse? How easy is it for civil engineers or other domain experts to build a secure WSN using commercially(More)
Many software model checkers only detect counterexamples with deep loops after exploring numerous spurious and increasingly longer counterexamples. We propose a technique that aims at eliminating this weakness by constructing auxiliary paths that represent the effect of a range of loop iterations. Unlike acceleration, which captures the exact effect of(More)
Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for(More)
Loop under-approximation is a technique that enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up the detection of bugs significantly, it introduces redundant execution traces which may complicate the verification of the program. This holds particularly true for(More)
Static analysers search for overapproximating proofs of safety commonly known as safety invariants. Fundamentally, such analysers summarise traces into sets of states, thus trading the ability to distinguish traces for computational tractability. Conversely, static bug finders (e.g. Bounded Model Checking) give evidence for the failure of an assertion in(More)