Pitch is one of the most fundamental percepts in the auditory system and can be extracted using either spectral or temporal information in an acoustic signal. Although pitch perception has been extensively studied in human subjects, it is far less clear how nonhuman primates perceive pitch. We have addressed this question in a series of behavioral studies in which marmosets, a vocal nonhuman pr...

A coupling of two distributions PX and PY is a joint distribution PXY with marginal distributions equal to PX and PY . Given marginals PX and PY and a real-valued function f(PXY ) of the joint distribution PXY , what is its minimum over all couplings PXY of PX and PY ? We study the asymptotics of such coupling problems with different f ’s. These include the maximal coupling, minimum distance co...

Harmonic complex tones elicit a pitch sensation at their fundamental frequency (F0), even when their spectrum contains no energy at F0, a phenomenon known as "pitch of the missing fundamental." The strength of this pitch percept depends upon the degree to which individual harmonics are spaced sufficiently apart to be "resolved" by the mechanical frequency analysis in the cochlea. We investigate...

Harmonic complex tones elicit a pitch sensation at their fundamental frequency (F0), even when their spectrum contains no energy at F0, a phenomenon known as " pitch of the missing fundamental ". The strength of this pitch percept depends upon the degree to which individual harmonics are spaced sufficiently apart to be " resolved " by the mechanical frequency analysis in the cochlea. We investi...

Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that – under some sy...

In this paper, we consider the NP-hard problem of finding minimum connected resolving set graphs. A vertex B a graph G resolves if every is uniquely identified by its vector distances to vertices in B. subgraph induced nontrivial G. The cardinality minimal metric dimension and solved heuristically binary version an enhanced Harris Hawk Optimization (BEHHO) algorithm. This first attempt determin...

We define a new type of Golomb ruler, which we term resolvable ruler. These are rulers that satisfy an additional “resolvability” condition allows them to generate symmetric configurations. The resulting configurations give rise progressive dinner parties. In this paper, investigate existence results for and their application the construction particular, determine or nonexistence all possible p...