A recent study has shown that congenitally blind adults, who have never had visual experience, are impaired on an auditory spatial bisection task (Gori, Sandini, Martinoli, & Burr, 2014). In this study we investigated how thresholds for auditory spatial bisection and auditory discrimination develop with age in sighted and congenitally blind children (9 to 14 years old). Children performed 2 spa...

The number bisection tasks, whereby participants estimate the midpoint of a given number interval, is frequently used to explore the idea that numbers are spatially represented within the brain across a 'mental number line'. Some neuropsychological research supports the argument that number bisection is a spatial task, recruiting parietal brain regions, whereas other data suggest that number bi...

In this paper we consider the problem of solving geometric reconstruction problems with the L∞-norm. Previous work has shown that globally optimal solutions can be computed reliably for a series of such problems. The methods for computing the solutions have relied on the property of quasiconvexity. For quasiconvex problems, checking if there exists a solution below a certain objective value can...

Although the concept of utility is fundamental to many economic theories, up to now a generally accepted method determining a subject’s utility function is not available. We investigated two methods that are used in economic sciences for describing utility functions by using response-locked event-related potentials in order to assess their neural underpinnings. For defining the certainty equiva...

Although the concept of utility is fundamental to many economic theories, up to now a generally accepted method determining a subject's utility function is not available. We investigated two methods that are used in economic sciences for describing utility functions by using response-locked event-related potentials in order to assess their neural underpinnings. For determining the certainty equ...

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider this problem for trees and prove that the minimum bisection width of every tree T on n vertices satisfies MinBis(T ) ≤ 8n∆(T )/ diam(T ). Second, we general...

In roving-referent bisection, three duration values are presented sequentially on each trial, two referents and then a probe, and the observer is instructed to indicate whether the probe is more similar to the duration of the first or second trial referent. Data from three experiments are reported which consistently indicate that human observers do not compare the probe to the trial referents i...

A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists 2-vertex-colouring of (not necessarily proper) such that: (i) the colour classes same cardinality, and (ii) monochromatic components are either an isolated vertex or edge. In 2016, Ban Linial conjectured that every graph, apart from well-known Petersen admits 2-bisection. paper it was shown Class I bisection. The II grap...

Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...

Indefinite approximations of positive semidefinite matrices arise in many data analysis applications involving covariance matrices and correlation matrices. We propose a method for restoring positive semidefiniteness of an indefinite matrix M0 that constructs a convex linear combination S(α) = αM1 + (1− α)M0 of M0 and a positive semidefinite target matrix M1. In statistics, this construction fo...