Computational Geometric Aspects of Rhythm, Melody, and Voice-Leading
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Geometry of Musical Rhythm
The Geometry of Musical Rhythm Godfried Toussaint? School of Computer Science McGill University Montr´eal, Qu´ebec, Canada Dedicated to J´anos Pach on the occasion of his 50th birthday. Abstract. Musical rhythm is considered from the point of view of ge- ometry. The interaction between the two fields yields new insights into rhythm and music theory, as well as new problems for research in mathe- matics and computer science. Recent results are reviewed, and new open problems are proposed. 1 Introduction Imagine a clock which has 16 hours marked on its face instead of the usual 12. Assume that the hour and minute hands have been broken off so that only the second-hand remains. Furthermore assume that this clock is running fast so that the second-hand makes a full turn in about 2 seconds. Such a clock is illustrated in Figure 1. Now start the clock ticking at \noon" (16 O'clock) and let it keep running for ever. Finally, strike a bell at positions 16, 3, 6, 10 and 12, for a total of five strikes per clock cycle. These times are marked with a bell in Figure 1. The resulting pattern rings out a seductive rhythm which, in a short span of fifty years during the last half of the 20th century, has managed to conquer our planet. It is known around the world (mostly) as the Clave Son from Cuba. However, it is common in Africa, and probably travelled from Africa to Cuba with the slaves [65]. In Africa it is traditionally played with an iron bell. -
Multi-Armed Bandits with Applications to Markov Decision Processes and Scheduling Problems
SSStttooonnnyyy BBBrrrooooookkk UUUnnniiivvveeerrrsssiiitttyyy The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook University. ©©© AAAllllll RRRiiiggghhhtttsss RRReeessseeerrrvvveeeddd bbbyyy AAAuuuttthhhooorrr... Multi-Armed Bandits with Applications to Markov Decision Processes and Scheduling Problems A Dissertation Presented by Isa M. Muqattash to The Graduate School in Partial Ful¯llment of the Requirements for the Degree of Doctor of Philosophy in Applied Mathematics and Statistics (Operations Research) Stony Brook University December 2014 Stony Brook University The Graduate School Isa M. Muqattash We, the dissertation committee for the above candidate for the Doctor of Philosophy degree, hereby recommend acceptance of this dissertation. Jiaqiao Hu { Dissertation Advisor Associate Professor, Department of Applied Mathematics and Statistics Esther Arkin { Chairperson of Defense Professor, Department of Applied Mathematics and Statistics Yuefan Deng Professor, Department of Applied Mathematics and Statistics Luis E. Ortiz Assistant Professor Department of Computer Science, Stony Brook University This dissertation is accepted by the Graduate School. Charles Taber Dean of the Graduate School ii Abstract of the Dissertation Multi-Armed Bandits with Applications to Markov Decision Processes and Scheduling Problems by Isa M. Muqattash Doctor of Philosophy in Applied Mathematics and Statistics (Operations Research) Stony Brook University 2014 The focus of this work is on practical applications of stochastic multi-armed bandits (MABs) in two distinctive settings. First, we develop and present REGA, a novel adaptive sampling- based algorithm for control of ¯nite-horizon Markov decision pro- cesses (MDPs) with very large state spaces and small action spaces. We apply a variant of the ²-greedy multi-armed bandit algorithm to each stage of the MDP in a recursive manner, thus comput- ing an estimation of the \reward-to-go" value at each stage of the MDP. -
Stony Brook University
SSStttooonnnyyy BBBrrrooooookkk UUUnnniiivvveeerrrsssiiitttyyy The official electronic file of this thesis or dissertation is maintained by the University Libraries on behalf of The Graduate School at Stony Brook University. ©©© AAAllllll RRRiiiggghhhtttsss RRReeessseeerrrvvveeeddd bbbyyy AAAuuuttthhhooorrr... Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks A Dissertation presented by Jiemin Zeng to The Graduate School in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Computer Science Stony Brook University May 2016 Copyright by Jiemin Zeng 2016 Stony Brook University The Graduate School Jiemin Zeng We, the dissertation committee for the above candidate for the Doctor of Philosophy degree, hereby recommend acceptance of this dissertation Jie Gao - Dissertation Advisor Professor, Computer Science Department Joseph Mitchell - Chairperson of Defense Professor, Department of Applied Mathematics and Statistics Esther Arkin Professor, Department of Applied Mathematics and Statistics Matthew P. Johnson - External Member Assistant Professor Department of Mathematics and Computer Science at Lehman College PhD Program in Computer Science at The CUNY Graduate Center This dissertation is accepted by the Graduate School Charles Taber Dean of the Graduate School ii Abstract of the Dissertation Integrating Mobile Agents and Distributed Sensors in Wireless Sensor Networks by Jiemin Zeng Doctor of Philosophy in Computer Science Stony Brook University 2016 As computers become more ubiquitous in the prominent phenomenon of the In- ternet of Things, we encounter many unique challenges in the field of wireless sensor networks. A wireless sensor network is a group of small, low powered sensors with wireless capability to communicate with each other. The goal of these sensors, also called nodes, generally is to collect some information about their environment and report it back to a base station. -
2Majors and Minors.Qxd.KA
APPLIED MATHEMATICS AND STATISTICSSpring 2006: updates since Spring 2005 are in red Applied Mathematics and Statistics (AMS) Major and Minor in Applied Mathematics and Statistics Department of Applied Mathematics and Statistics, College of Engineering and Applied Sciences CHAIRPERSON: James Glimm UNDERGRADUATE PROGRAM DIRECTOR: Alan C. Tucker UNDERGRADUATE SECRETARY: Christine Rota OFFICE: P-139B Math Tower PHONE: (631) 632-8370 E-MAIL: [email protected] WEB ADDRESS: http://naples.cc.sunysb.edu/CEAS/amsweb.nsf Students majoring in Applied Mathematics and Statistics often double major in one of the following: Computer Science (CSE), Economics (ECO), Information Systems (ISE) Faculty Robert Rizzo, Assistant Professor, Ph.D., Yale he undergraduate program in University: Bioinformatics; drug design. Hongshik Ahn, Associate Professor, Ph.D., Applied Mathematics and Statistics University of Wisconsin: Biostatistics; survival David Sharp, Adjunct Professor, Ph.D., Taims to give mathematically ori- analysis. California Institute of Technology: Mathematical ented students a liberal education in quan- physics. Esther Arkin, Professor, Ph.D., Stanford titative problem solving. The courses in University: Computational geometry; combina- Ram P. Srivastav, Professor, D.Sc., University of this program survey a wide variety of torial optimization. Glasgow; Ph.D., University of Lucknow: Integral mathematical theories and techniques equations; numerical solutions. Edward J. Beltrami, Professor Emeritus, Ph.D., that are currently used by analysts and Adelphi University: Optimization; stochastic Michael Taksar, Professor Emeritus, Ph.D., researchers in government, industry, and models. Cornell University: Stochastic processes. science. Many of the applied mathematics Yung Ming Chen, Professor Emeritus, Ph.D., Reginald P. Tewarson, Professor Emeritus, courses give students the opportunity to New York University: Partial differential equa- Ph.D., Boston University: Numerical analysis; develop problem-solving techniques using biomathematics. -
Separating Point Sets in Polygonal Environments
Separating point sets in polygonal environments Erik D. Demaine Jeff Erickson MIT Laboratory Department of Computer Science for Computer Science U. of Illinois at Urbana-Champaign [email protected] jeff[email protected] Ferran Hurtado∗ John Iacono Departement de Matem`atica Aplicada II Dept. of Computer and Information Science Universitat Polit`ecnica de Catalunya Polytechnic University [email protected] [email protected] Stefan Langerman† Henk Meijer D´epartement d’Informatique School of Computing Universit´eLibre de Bruxelles Queen’s University [email protected] [email protected] Mark Overmars Sue Whitesides Institute of Information and Computing Sciences School of Computer Science Utrecht University McGill University [email protected] [email protected] ABSTRACT 1 Introduction We consider the separability of two point sets inside a poly- Let us consider the following basic question: given two point gon by means of chords or geodesic lines. Specifically, given sets R and B in the interior of a polygon (the red points and a set of red points and a set of blue points in the interior of the blue points, respectively), is there a chord separating R a polygon, we provide necessary and sufficient conditions for from B? This is the starting problem we study in this paper, the existence of a chord and for the existence of a geodesic where we also consider several related problems. path which separate the two sets; when they exist we also Problems on separability of point sets and other geomet- derive efficient algorithms for their obtention. We study as ric objects have generated a significant body of research in well the separation of the two sets using a minimum number computational geometry, and many kind of separators have of pairwise non-crossing chords. -
Algorithmica (2006) 46: 193–221 DOI: 10.1007/S00453-006-1206-1 Algorithmica © 2006 Springer Science+Business Media, Inc
Algorithmica (2006) 46: 193–221 DOI: 10.1007/s00453-006-1206-1 Algorithmica © 2006 Springer Science+Business Media, Inc. The Freeze-Tag Problem: How to Wake Up a Swarm of Robots1 Esther M. Arkin,2 Michael A. Bender,3 Sandor´ P. Fekete,4 Joseph S. B. Mitchell,2 and Martin Skutella5 Abstract. An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of “asleep” robots, by having an awakened robot move to their locations. Once a robot is awake, it can assist in awakening other slumbering robots. The objective is to have all robots awake as early as possible. While the FTP bears some resemblance to problems from areas in combinato- rial optimization such as routing, broadcasting, scheduling, and covering, its algorithmic characteristics are surprisingly different. We consider both scenarios on graphs and in geometric environments. In graphs, robots sleep at vertices and there is a length function on the edges. Awake robots travel along edges, with time depending on edge length. For most scenarios, we consider the offline version of the problem, in which each awake robot knows the position of all other robots. We prove that the problem is NP-hard, even for the special case of star graphs. We also establish hardness of approximation, showing that it is NP-hard to obtain an approximation factor 5 better than 3 , even for graphs of bounded degree. These lower bounds are complemented with several positive algorithmic results, including: We show that the natural greedy strategy on star graphs has a tight worst-case performance of 7 and give • 3 a polynomial-time approximation scheme (PTAS) for star graphs. -
The Freeze-Tag Problem: How to Wake up a Swarm of Robots
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots∗ Esther M. Arkin† Michael A. Bender‡ S´andor P. Fekete§ Joseph S. B. Mitchell† Martin Skutella¶ Abstract An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of “asleep” robots, by having an awakened robot move to their locations. Once a robot is awake, it can assist in awakening other slumbering robots. The objective is to have all robots awake as early as possible. While the FTP bears some resemblance to problems from areas in combinatorial optimization such as routing, broadcasting, scheduling, and covering, its algorithmic characteristics are surprisingly different. We consider both scenarios on graphs and in geometric environments. In graphs, robots sleep at vertices and there is a length function on the edges. Awake robots travel along edges, with time depending on edge length. For most scenarios, we consider the offline version of the problem, in which each awake robot knows the position of all other robots. We prove that the problem is NP-hard, even for the special case of star graphs. We also establish hardness of approximation, showing that it is NP-hard to obtain an approximation factor better than 5/3, even for graphs of bounded degree. These lower bounds are complemented with several positive algorithmic results, including: We show that the natural greedy strategy on star graphs has a tight worst-case performance of 7/3 • and give a polynomial-time approximation scheme (PTAS) for star graphs. We give a simple O(log ∆)-competitive online algorithm for graphs with maximum degree ∆ and • locally bounded edge weights. -
The Rhythm That Conquered the World: What Makes a “Good” Rhythm Good?
The Rhythm that Conquered the World: What Makes a “Good” Rhythm Good? (to appear in Percussive Notes.) By Godfried T. Toussaint Radcliffe Institute for Advanced Study Harvard University Dedicated to the memory of Bo Diddley. THE BO DIDDLEY BEAT Much of the world’s traditional and contemporary music makes use of characteristic rhythms called timelines. A timeline is a distinguished rhythmic ostinato, a rhythm that repeats throughout a piece of music with no variation, that gives the particular flavor of movement of the piece that incorporates it, and that acts as a timekeeper and structuring device for the musicians. Timelines may be played with any musical instrument, although a percussion instrument is usually preferred. Timelines may be clapped with the hands, as in the flamenco music of Southern Spain, they may be slapped on the thighs as was done by Buddy Holly’s drummer Jerry Allison in the hit song “Everyday”, or they may just be felt rather than sounded. In Sub-Saharan African music, timelines are usually played using an iron bell such as the gankogui or with two metal blades. Perhaps the most quintessential timeline is what most people familiar with rockabilly music dub the Bo Diddley Beat, and salsa dancers call the clave son, which they attribute to much other Cuban and Latin American music. This rhythm is illustrated in box notation in Figure 1. Each box represents a pulse, and the duration between any two adjacent pulses is one unit of time. There are a total of sixteen pulses, the first pulse occurs at time zero and the sixteenth at time 15. -
Network Optimization on Partitioned Pairs of Points
Network Optimization on Partitioned Pairs of Points Esther M. Arkin1, Aritra Banik2, Paz Carmi2, Gui Citovsky3, Su Jia1, Matthew J. Katz2, Tyler Mayer1, and Joseph S. B. Mitchell1 1Dept. of Applied Mathematics and Statistics, Stony Brook University, Stony Brook USA., esther.arkin, su.jia, tyler.mayer, joseph.mitchellf @stonybrook.edu 2Dept. of Computer Science, Ben-Guriong University, Beersheba Israel., aritrabanik,carmip @gmail.com, [email protected] f3Google, Manhattan USA.,g [email protected] Abstract Given n pairs of points, = p1; q1 ; p2; q2 ;:::; pn; qn , in some metric space, we studyS the problemff g off two-coloringg f the pointsgg within each pair, red and blue, to optimize the cost of a pair of node- disjoint networks, one over the red points and one over the blue points. In this paper we consider our network structures to be spanning trees, traveling salesman tours or matchings. We consider several different weight functions computed over the network structures induced, as well as several different objective functions. We show that some of these problems are NP-hard, and provide constant factor approximation al- gorithms in all cases. arXiv:1710.00876v1 [cs.CG] 2 Oct 2017 1 Introduction We study a class of network optimization problems on pairs of sites in a metric space. Our goal is to determine how to split each pair, into a \red" site and a \blue" site, in order to optimize both a network on the red sites and a network on the blue sites. In more detail, given n pairs of points, = p1; q1 ; p2; q2 ;:::; pn; qn , in the Euclidean plane or in a general S ff g f g f gg Sn metric space, we define a feasible coloring of the points in S = pi; qi i=1f g to be a coloring, S = R B, such that pi R if and only if qi B. -
Curriculum Vitae
Curriculum Vitae Omrit Filtser December 2020 Personal Details Address: Department of Applied Mathematics and Statistics, Stony Brook University, NY E-mail: [email protected] Website: omrit.filtser.com Date of Birth: 24.12.1987 Marital status: Married, two children. Education and Research Experience 2019-now: Postdoc at Stony Brook University, hosted by Prof. Joseph S.B. Mitchell. 2014-2019: PhD student in Computer Science, Ben-Gurion University of the Negev. Advisor: Matthew J. Katz. Title: The Discrete Fréchet Distance and Applications. 2012-2014: MSc in Computer Science, Ben-Gurion University of the Negev. Advisor: Matthew J. Katz. Title: The Discrete Fréchet Distance and Applications. Graduated Summa cum Laude (final score 97.9/100). 2009-2012: BSc in Computer Science, Ben-Gurion University of the Negev. Graduated Summa cum Laude (average 95.65/100). During Bachelor's: • 2009-2012: Participated in the excellence program of Microsoft Israel, which includes unique technological courses in the forefront of research in the R&D center. • 2012: Participated in “Dkalim” scholarship program for outstanding students applying to Master studies in computer science. As part of the program I participated in research seminars and worked in collaboration with researchers from the university. Honors and Awards • The Israeli Council for Higher Education fellowship for postdoctoral women fellows, 2019. • BGU scholarship for postdoctoral women fellows abroad, 2019. • Eric and Wendy Schmidt Postdoctoral Award for Women in Mathematical and Computing Sciences, 2019-2020. • Philippe Chaim Zabey Award for excellent Master Thesis, 2017. • The Israeli Ministry of Science & Technology Scholarship for women in science (PhD students), 2015. • Friedman Award for outstanding achievements in research, 2015. -
Proceedings in a Single
Schedule of Talks 27th Annual Fall Workshop on Computational Geometry November 3–4, 2017 Stony Brook University Stony Brook, NY Sponsored by the National Science Foundation and the Department of Applied Mathematics and Statistics and the Department of Computer Science, College of Engineering and Applied Sciences, Stony Brook University Program Committee: GregAloupis(Tufts) PeterBrass(CCNY) WilliamRandolphFranklin(RPI) JieGao(co-chair,StonyBrook) MayankGoswami(QueensCollege) MatthewP.Johnson(Lehman College) Joseph S. B. Mitchell (co-chair, Stony Brook) Don Sheehy (University of Connecticut) Jinhui Xu (University at Buffalo) Friday, November 3, 2017: Computer Science (NCS), Room 120 9:20 Opening remarks Contributed Session 1 Chair: Joe Mitchell 9:30–9:45 “Sampling Conditions for Clipping-free Voronoi Meshing by the VoroCrust Algorithm”, Scott Mitchell, Ahmed Abdelkader, Ahmad Rushdi, Mohamed Ebeida, Ahmed Mahmoud, John Owens and Chandrajit Bajaj 9:45–10:00 “Quasi-centroidal Simplicial Meshes for Optimal Variational Methods”, Xiangmin Jiao 10:00–10:15 “A Parallel Approach for Computing Discrete Gradients on Mulfiltrations”, Federico Iuricich, Sara Scaramuccia, Claudia Landi and Leila De Floriani 10:15–10:30 “Parallel Intersection Detection in Massive Sets of Cubes”, W. Randolph Franklin and Salles V.G. Magalh˜aes 10:30–11:00 Break. Contributed Session 2 Chair: Jie Gao 11:00–11:15 “Dynamic Orthogonal Range Searching on the RAM, Revisited”, Timothy M. Chan and Konstantinos Tsakalidis 11:15–11:30 “Faster Algorithm for Truth Discovery via Range -
Network Optimization on Partitioned Pairs of Points∗†
Network Optimization on Partitioned Pairs of Points∗† Esther M. Arkin‡1, Aritra Banik2, Paz Carmi3, Gui Citovsky4, Su Jia5, Matthew J. Katz§6, Tyler Mayer¶7, and Joseph S. B. Mitchell‖8 1 Dept. of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA [email protected] 2 Dept. of Computer Science, Ben-Gurion University, Beersheba, Israel [email protected] 3 Dept. of Computer Science, Ben-Gurion University, Beersheba, Israel [email protected] 4 Google, Manhattan, USA [email protected] 5 Dept. of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA [email protected] 6 Dept. of Computer Science, Ben-Gurion University, Beersheba, Israel. [email protected] 7 Dept. of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA [email protected] 8 Dept. of Applied Mathematics and Statistics, Stony Brook University, Stony Brook, USA. [email protected] Abstract Given n pairs of points, S = {{p1, q1}, {p2, q2},..., {pn, qn}}, in some metric space, we study the problem of two-coloring the points within each pair, red and blue, to optimize the cost of a pair of node-disjoint networks, one over the red points and one over the blue points. In this paper we consider our network structures to be spanning trees, traveling salesman tours or matchings. We consider several different weight functions computed over the network structures induced, as well as several different objective functions. We show that some of these problems are NP-hard, and provide constant factor approximation algorithms in all cases. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems Keywords and phrases Spanning Tree, Traveling Salesman Tour, Matching, Pairs, NP-hard Digital Object Identifier 10.4230/LIPIcs.ISAAC.2017.6 ∗ We acknowledge support from the US-Israel Binational Science Foundation (Projects 2010074, 2016116).