arXiv subjects
Publications and source records attributed to Patrick Naylor.
We study various constructions of spanning solids for knotted surfaces in the 4-sphere. In particular, we consider a 4-dimensional analogue of Murasugi sum, which we use to define a notion of arborescent knotted surfaces. We give a variety of examples and applications to broken surface diagrams, such as deciding which resolutions of the crossings in these diagrams yield spanning solids.
We introduce and study bridge decompositions for 3-manifolds embedded in the 5-sphere. These generalize both the classical notion of bridge position for knots in the 3-sphere and the bridge trisections of surfaces in the 4-sphere due to Meier and Zupan. Our main technical tool is the multisections of 5-manifolds introduced by Aribi, Courte, Golla, and Moussard. We prove that every embedded 3-manifold admits such a decomposition; in particular, any such embedding is encoded by four trivial tangle diagrams. We also present a range of explicit examples, including $S^2$-spun knots and ribbon 3-knots.
We construct infinitely many pairwise non-diffeomorphic smooth structures on a definite $4$-manifold with non-cyclic fundamental group $\mathbb{Z}/2\times \mathbb{Z}/2$.
Using a 5-dimensional perspective, we balance algebraic and geometric handle cancellation to show that doubles of Gluck twists of certain 2-spheres with two minima are standard. This includes all 2-spheres which are unions of ribbon discs, one of which has undisking number one. As an application, we produce new examples of Schoenflies balls not known to be standard.
We study trisections of smooth, compact non-orientable 4-manifolds, and introduce trisections of non-orientable 4-manifolds with boundary. In particular, we prove a non-orientable analogue of a classical theorem of Laudenbach-Po\'enaru. As a consequence, trisection diagrams and Kirby diagrams of closed non-orientable 4-manifolds exist. We discuss how the theory of trisections may be adapted to the setting of non-orientable 4-manifolds with many examples.
We introduce multisections of smooth, closed 4-manifolds, which generalize trisections to decompositions with more than three pieces. This decomposition describes an arbitrary smooth, closed 4-manifold as a sequence of cut systems on a surface. We show how to carry out many smooth cut and paste operations in terms of these cut systems. In particular, we show how to implement a cork twist, whereby we show that an arbitrary exotic pair of smooth 4-manifolds admit 4-sections differing only by one cut system. By carrying out fiber sums and log transforms, we also show that the elliptic fibrations $E(n)_{p,q}$ all admit genus 3 multisections, and draw explicit diagrams for these manifolds.
We show that the smooth homotopy 4-sphere obtained by Gluck twisting the m-twist n-roll spin of any unknotting number one knot is diffeomorphic to the standard 4-sphere, for any pair of integers (m,n). It follows as a corollary that an infinite collection of twisted doubles of Gompf's infinite order corks are standard.
The pseudo-periodicity of voiced speech can be exploited in several speech processing applications. This requires however that the precise locations of the Glottal Closure Instants (GCIs) are available. The focus of this paper is the evaluation of automatic methods for the detection of GCIs directly from the speech waveform. Five state-of-the-art GCI detection algorithms are compared using six different databases with contemporaneous electroglottographic recordings as ground truth, and containing many hours of speech by multiple speakers. The five techniques compared are the Hilbert Envelope-based detection (HE), the Zero Frequency Resonator-based method (ZFR), the Dynamic Programming Phase Slope Algorithm (DYPSA), the Speech Event Detection using the Residual Excitation And a Mean-based Signal (SEDREAMS) and the Yet Another GCI Algorithm (YAGA). The efficacy of these methods is first evaluated on clean speech, both in terms of reliabililty and accuracy. Their robustness to additive noise and to reverberation is also assessed. A further contribution of the paper is the evaluation of their performance on a concrete application of speech processing: the causal-anticausal decomposition of speech. It is shown that for clean speech, SEDREAMS and YAGA are the best performing techniques, both in terms of identification rate and accuracy. ZFR and SEDREAMS also show a superior robustness to additive noise and reverberation.
The ability to localize and track acoustic events is a fundamental prerequisite for equipping machines with the ability to be aware of and engage with humans in their surrounding environment. However, in realistic scenarios, audio signals are adversely affected by reverberation, noise, interference, and periods of speech inactivity. In dynamic scenarios, where the sources and microphone platforms may be moving, the signals are additionally affected by variations in the source-sensor geometries. In practice, approaches to sound source localization and tracking are often impeded by missing estimates of active sources, estimation errors, as well as false estimates. The aim of the LOCAlization and TrAcking (LOCATA) Challenge is an open-access framework for the objective evaluation and benchmarking of broad classes of algorithms for sound source localization and tracking. This article provides a review of relevant localization and tracking algorithms and, within the context of the existing literature, a detailed evaluation and dissemination of the LOCATA submissions. The evaluation highlights achievements in the field, open challenges, and identifies potential future directions.
A theorem of Katanaga, Saeki, Teragaito, and Yamada relates Gluck and Price twists of 4-manifolds. Using trisection diagrams, we give a purely diagrammatic proof of this theorem, and answer a question of Kim and Miller.
We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are 2977), previous theorems were only able to determine bi-orderability of 599 of the corresponding knot groups. With our methods we are able to deal with 191 more.
In this paper, we consider a distributed remote source coding problem, where a sequence of observations of source vectors is available at the encoder. The problem is to specify the optimal rate for encoding the observations subject to a covariance matrix distortion constraint and in the presence of side information at the decoder. For this problem, we derive lower and upper bounds on the rate-distortion function (RDF) for the Gaussian case, which in general do not coincide. We then provide some cases, where the RDF can be derived exactly. We also show that previous results on specific instances of this problem can be generalized using our results. We finally show that if the distortion measure is the mean squared error, or if it is replaced by a certain mutual information constraint, the optimal rate can be derived from our main result.
In this paper, we consider the problem of remote vector Gaussian source coding for a wireless acoustic sensor network. Each node receives messages from multiple nodes in the network and decodes these messages using its own measurement of the sound field as side information. The node's measurement and the estimates of the source resulting from decoding the received messages are then jointly encoded and transmitted to a neighboring node in the network. We show that for this distributed source coding scenario, one can encode a so-called conditional sufficient statistic of the sources instead of jointly encoding multiple sources. We focus on the case where node measurements are in form of noisy linearly mixed combinations of the sources and the acoustic channel mixing matrices are invertible. For this problem, we derive the rate-distortion function for vector Gaussian sources and under covariance distortion constraints.