This paper introduces the bisection debugging model. The key idea is to use a debugger to identify the semantic differences between two versions of the same program. The debugger leads the user (programmer) to the region of the source code that is different between the versions and effects erroneous behavior. To implement bisection debugging, a debugger must insert checkpoints around regions of...

The aim of the paper is to propose a bounded-error quantum polynomial time (BQP) algorithm for the max-bisection and the min-bisection problems. The max-bisection and the min-bisection problems are fundamental NP-hard problems. Given a graph with even number of vertices, the aim of the max-bisection problem is to divide the vertices into two subsets of the same size to maximize the number of ed...

In patients with right brain damage and left visual neglect, attention tends to be captured by right-sided objects and cannot easily disengage from them. While these phenomena can account for several clinical and experimental patterns of performance such as biased visual search, its role is more controversial for other neglect-related signs, such as the typical rightward shifts in horizontal li...

The dissociation between peripersonal (within reaching) and extrapersonal space (beyond reaching) has been reported using the line bisection task in left neglect patients and in healthy participants. Furthermore, this dissociation can be modulated by tool use. We conducted two experiments to compare line bisection in peripersonal (i.e., 30, 60 cm) and extrapersonal space (i.e., 90, 120 cm). Hea...

We study whether bisection in visual grasp space (the region over which eye and hand can work together to grasp or touch objects) depends on fixation or on the method of judgment employed (the task). We determined observer bias and sensitivity for bisection judgments (in a fronto-parallel plane as well as along contours slanted in depth). Significant biases were found that varied across observe...

Bisection debugging, which is based on binary search over software version history, is widely used in practice to identify the bug introducing commit. However, this process can be expensive because it requires costly compilation and test execution at many commits. We introduce a novel technique—selective bisection (consisting of test selection and commit selection)—to reduce the number of bisec...

The present study investigated the effect of a click train on the bisection of time, number and length when each modality was presented sequentially and non-sequentially. For the bisection of time, the results showed that the clicks shifted the bisection function toward the left and decreased the bisection point (point of subjective equality), thus suggesting that the stimulus duration was judg...

The Lagrangian-doubly nonnegative (DNN) relaxation has recently been shown to provide effective lower bounds for a large class of nonconvex quadratic optimization problems (QOPs) using the bisection method combined with first-order methods by Kim, Kojima and Toh in 2016. While the bisection method has demonstrated the computational efficiency, determining the validity of a computed lower bound ...