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

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

Journal: :Journal of the Optical Society of America. A, Optics and image science 1987
S A Klein D M Levi

Position acuity was measured over a wide range of eccentricities, from 3 min to 10 deg in the horizontal meridian, by using both a three-dot bisection task and a three-dot vernier task. A foveal fixation dot appeared for 1 sec before an outer pair of test dots was flashed for 200 msec. Bisection and vernier tasks were used to measure position acuity in the radial and tangential directions, resp...

Journal: :Journal of neurology, neurosurgery, and psychiatry 1998
V W Mark K M Heilman

OBJECTIVE To determine whether stroke patients with diagonal neglect on cancellation may show diagonal neglect on line bisection, and hence to indicate whether diagonal neglect may be related solely to the type of test used or whether instead it may reflect a fundamental spatial disorder. METHODS Nine patients with subacute right hemispheric stroke who neglected targets primarily in the near ...

2013
Matteo Sozzi Michela Balconi Luigi Pisani Claudio Mariani

Aim of this study is to explore behavioral responses and eye movements of unilateral neglect patients in a virtual bisection task. Space to be bisected was included between two endpoint, segment length together with segment spatial dislocation were varied in order to test the presence of a “gradient effect” in both bisection behavior and visual exploration. Ten right neglect patients took part ...

2015
Adrien Le Coënt Florian De Vuyst Christian Rey Ludovic Chamoin Laurent Fribourg

This paper considers discrete-time linear systems controlled by a quantized law, i.e., a piecewise constant time function taking a finite set of values. We show how to generate the control by, first, applying model reduction to the original system, then using a “state-space bisection” method for synthesizing a control at the reduced-order level, and finally computing an upper bound to the devia...

1988
William J. Dally

VLSI communication networks are wire limited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-...

1995
Govindan Ravindran Michael Stumm

Ring-based hierarchical networks are interesting alternatives to popular direct networks such as 2D meshes or tori. They allow for simple router designs, wider communications paths, and faster networks than their direct network counterparts. However, they have a constant bisection bandwidth, regardless of system size. In this paper, we present the results of a simulation study to determine how ...

Journal: :Neuroreport 2011
Carine Michel Samuel Bidot François Bonnetblanc Patrick Quercia

This study compared the visuospatial asymmetries in children with dyslexia and healthy children by using the manual line bisection task, and investigated the processing of spatial context with a 'local' cueing paradigm consisting of geometric symbols placed on the extremities of the lines. The performance between healthy children (leftward bias) and children with dyslexia (rightward bias) was s...

2007
Yefim Dinitz Zeev Nutov

A bisection of a set U is a partition of U into two nonempty parts. Two bisections are parallel if they collectively partition U into three parts. A natural model for a family of pairwise parallel bisections is a tree. Given a bisection family F and a family T of pairwise parallel bisections, we suggest decomposition/composition tools for modeling F based on T . We introduce plant models result...

Alain Rouault, Brigitte Chauvin,

We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.

Journal: :J. Comb. Theory, Ser. B 2013
Choongbum Lee Po-Shen Loh Benny Sudakov

A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. In this paper, motivated by several questions and conjectures of Bollobás and Scott, we study maximum bisections of graphs. First, we extend the classical Edwards bound on maximum cuts to bisections. A ...

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

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