نتایج جستجو برای: bisection method

تعداد نتایج: 1632081  

2007
Luciano Gamberini Bruno Seraglia Konstantinos Priftis

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...

2017
Ripon Saha Milos Gligoric

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...

Journal: :Behavioural processes 2010
Sylvie Droit-Volet

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...

2017
Manuel Ninaus Korbinian Moeller Liane Kaufmann Martin H. Fischer Hans-Christoph Nuerk Guilherme Wood

There is accumulating evidence suggesting an association of numbers with physical space. However, the origin of such spatial-numerical associations (SNAs) is still debated. In the present study we investigated the development of two SNAs in a cross-sectional study involving children, young and middle-aged adults as well as the elderly: (1) the SNARC (spatial-numerical association of response co...

Journal: :Inf. Process. Lett. 2003
Uriel Feige Orly Yahalom

A bisection of an n-vertex graph is a partition of its vertices into two sets S and T , each of size n/2. The bisection cost is the number of edges connecting the two sets. In directed graphs, the cost is the number of arcs going from S to T . Finding a minimum cost bisection is NP-hard for both undirected and directed graphs. For the undirected case, an approximation of ratio O(log n) is known...

Journal: :Psychophysiology 2010
Kyle Nash Ian McGregor Michael Inzlicht

Approach motivation has been reliably associated with relative left prefrontal brain activity as measured with electroencephalography (EEG). Motivation researchers have increasingly used the line bisection task, a behavioral measure of relative cerebral asymmetry, as a neural index of approach motivation-related processes. Despite its wide adoption, however, the line bisection task has not been...

Journal: :Acta psychologica 2007
Sylvie Droit-Volet Anne-Claire Rattat

Experiment 1 compared the temporal performance of 5-year-olds, 8-year-olds and adults in a bisection task with and without referent durations (similarity vs. partition). The results showed that temporal sensitivity was lower in the partition than in the similarity condition in children, whereas it was similar in these two conditions in the adults. In addition, the 5-year-olds produced a higher ...

Journal: :Mathematics 2022

In this paper, we are concerned with approach solutions for Sturm–Liouville problems (SLP) using variational problem (VP) formulation of regular SLP. The minimization (MP) is also set forth, and the connection between solution each then proved. Variational estimations (the equation associated through Euler–Lagrange principle Nehari’s method, shooting method bisection method) iterative methods (...

2009
David Hyon Berrios

Calculating critical points in 3D vector fields is computationally expensive, and requires parameter adjustments to maximize the number and type of critical points found in a particular 3D vector field. This paper details the modifications required to execute Greene’s bisection method directly on graphics hardware, and compares the performance of the CPU+GPU versions to the CPU only versions.

1996
Christoph Helmberg Franz Rendl Robert J. Vanderbei Henry Wolkowicz

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semideenite matrices. We show that the approach is very eecient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید