DOCSLIB.ORG

Proceedings in a Single

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

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 Cover”, Ziyun Huang, Hu Ding and Jinhui Xu 11:30–11:45 “An Efficient Sum Query Algorithm for Distance-based Locally Dominating Func- tions”, Ziyun Huang and Jinhui Xu 11:45–12:00 “Approximate Convex Hull of Data Streams”, Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang and Lin Yang 12:00–1:00 Lunch (provided) 1:00–2:00 Invited Talk: “The geometry of data structures”, John Iacono (NYU Tandon School of Engineering and UniversitLibre´ de Bruxelles) Abstract: A technique has been developed to study and analyze data structures called the geometric view. Several examples of the use of this view will be presented including, rotation- based binary search tree data structure, cache-oblivious persistence, and disjoint sets. In all of these examples the main theme is that by moving to the geometric view, details of the data structure that seem cumbersome and hard to approach are abstracted in such a way that allows a simple, yet equivalent, view. Contributed Session 3 Chair: Jinhui Xu 2:00–2:15 “Online Unit Covering in L2”, Anirban Ghosh 2:15–2:30 “An O(n log n)-Time Algorithm for the k-Center Problem in Trees”, Haitao Wang and Jingru Zhang 2:30–2:45 “Compact Data Structures for Abstract Order Types and Optimal Encodings for SUM Problems”, Jean Cardinal, Timothy Chan, John Iacono, Stefan Langerman and Aur´elien Ooms 2:45–3:00 “Lightweight Sketches for Mining Trajectory Data”, Maria Astefanoaei, Panagiota Kat- sikouli, Mayank Goswami and Rik Sarkar 3:00–3:30 Break Contributed Session 4 Chair: Don Sheehy 3:30–3:45 “Calculating the Dominant Guard Set of a Simple Polygon”, Eyup Serdar Ayaz and Alper Ungor 3:45–4:00 “Perfect Polygons”, Hugo A. Akitaya, Erik D. Demaine, Martin L. Demaine, Adam Hesterberg, Joseph S.B. Mitchell and David Stalfa 4:00–4:15 “Efficient Approximations for the Online Dispersion Problem”, Jing Chen, Bo Li and Yingkai Li 4:15–4:30 “Edge Conflicts Can Increase Along Minimal Rotation-Distance Paths”, Sean Cleary and Roland Maio 4:30–4:45 “Optimal Safety Patrol Scheduling Using Randomized Traveling Salesman Tour”, Hao- Tsung Yang, Shih-Yu Tsai, Jie Gao and Shan Lin 5:00–6:00 Open Problem Session Saturday, November 4, 2017: Computer Science (NCS), Room 120 Contributed Session 5 Chair: Jie Gao 9:30–9:45 “On the Density of Triangles with Periodic Billiard Paths”, Ramona Charlton 9:45–10:00 “Nearest Neighbor Condensation with Guarantees”, Alejandro Flores Velazco and David Mount 10:00–10:15 “On the Complexity of Random Semi Voronoi Diagrams”, Chenglin Fan and Ben- jamin Raichel 10:15–10:30 “Efficient Algorithms for Computing a Minimal Homology Basis”, Tamal K. Dey, Tianqi Li and Yusu Wang 10:30–11:00 Break Contributed Session 6 Chair: Matt Johnson 11:00–11:15 “Cardiac Trabeculae Segmentation: an Application of Computational Topology”, Chao Chen, Dimitris Metaxas, Yusu Wang, Pengxiang Wu and Changhe Yuan 11:15–11:30 “Topological and Geometric Reconstruction of Metric Graphs in Rn”, Brittany Fasy, Rafal Komendarc´zyk, Sushovan Majhi and Carola Wenk 11:30–11:45 “Randomized Incremental Construction of Net-Trees”, Mahmoodreza Jahanseir and Donald Sheehy 11:45–12:00 “On Computing a Timescale Invariant Bottleneck Distance”, Nicholas J. Cavanna, Oliver Kisielius and Donald R. Sheehy 12:00–1:00 Lunch (provided) 1:00–2:00 Invited Talk: “Sublinear algorithms for outsourced data analysis”, Suresh Venkatasub- ramanian (University of Utah) Abstract: In the era of outsourcing, communication has replaced computation as an expensive resource. Researchers have proposed numerous models for communication-efficient computing that draw on classical ideas of interactive proofs, updated for our more “sublinear” world. I’ll talk about the model of streaming interactive proofs and how we can solve classic problems in data analysis like near neighbor search, minimum enclosing balls, and range searching in general with sublinear communication. Contributed Session 7 Chair: Mayank Goswami 2:00–2:15 “Improved Results for Minimum Constraint Removal”, Eduard Eiben, Jonathan Gem- mell, Iyad Kanj and Andrew Youngdahl 2:15–2:30 “Algorithm for Optimal Chance Constrained Knapsack with Applications to Multi- robot Teaming”, Fan Yang and Nilanjan Chakraborty 2:30–2:45 “Freeze Tag Awakening in 2D is NP-hard”, Hugo Akitaya, Jingjin Yu and Zachary Abel 2:45–3:00 “Freeze Tag is Hard in 3D”, Erik D. Demaine and Mikhail Rudoy; Matthew P. Johnson (“Easier Hardness for 3D Freeze-Tag”) 3:00–3:30 Break Contributed Session 8 Chair: W. Randolph Franklin 3:30–3:45 “Declarative vs Rule-based Control for Flocking Dynamics”, Usama Mehmood, Nicola Paoletti, Dung Phan, Radu Grosu, Shan Lin, Scott Stoller, Ashish Tiwari, Junxing Yang and Scott Smolka 3:45–4:00 “Realizing Minimum Spanning Trees from Random Embeddings”, Saad Quader, Alexan- der Russell and Ion Mandoiu 4:00–4:15 “The Minimum Road Trips Problem”, Samuel Micka and Brendan Mumey 4:15–4:30 “Harder Hardness of Approximation for 2D r-Gather”, Matthew P. Johnson Sampling Conditions for Clipping-free Voronoi Meshing by the VoroCrust Algorithm Scott Mitchell1, Ahmed Abdelkader2, Ahmad Rushdi1;3, Mohamed Ebeida1, Ahmed Mahmoud3, John Owens3 and Chandrajit Bajaj4 1 Sandia National Laboratories 2 University of Maryland, College Park 3 University of California, Davis 4 University of Texas, Austin For presentation at the Fall Workshop on Computational Geometry (FWCG 2017) Abstract Decomposing the volume bounded by a closed surface using simple cells is a key step in many applications. Although tetrahedral meshing is well-established with many successful implementations, many research questions remain open for polyhedral meshing, which promises significant advantages in some contexts. Unfortunately, current approaches to polyhedral meshing often resort to clipping cells near the boundary, which results in certain defects. In this talk, we present an analysis of the VoroCrust algorithm, which leverages ideas from α-shapes and the power crust algorithm to produce conforming Voronoi cells on both sides of the surface. We derive sufficient conditions for a weighted sampling to produce a topologically-correct and geometrically-accurate reconstruction, using the -sampling paradigm with a standard sparsity condition. The resulting surface reconstruction consists of weighted Delaunay triangles, except inside tetrahedra with a negative weighted circumradius where a Steiner vertex is generated close to the surface. Generating quality meshes is an important problem in computer graphics and geometric modeling. Polyhedral meshing offers higher degrees of freedom per element than tetrahedral or hex-dominant meshing, and is more efficient in filling a space, because it produces fewer elements for the same number of nodes. Within the class of polyhedral mesh elements, Voronoi cells are particularly useful in numerical simulations for their geometric properties, e.g., planar facets and positive Jacobians. A conforming mesh exhibits two desirable properties simultaneously: 1) a decomposition of the enclosed volume, and 2) a reconstruction of the bounding surface. A common technique for producing boundary-conforming decomposition from Voronoi cells relies on clipping, i.e., intersecting and truncating, each cell by the bounding surface [3]. An alternative to clipping is to locally mirror the Voronoi generators on either side of the surface [2]. VoroCrust can be viewed as a principled mirroring technique. Similar to the power crust [1], the reconstruction is composed of the facets shared by cells on the inside and outside of the manifold. However, VoroCrust uses pairs of unweighted generators tightly hugging the surface, which allows further decomposition of the interior without disrupting the surface reconstruction. VoroCrust can also be viewed as a special case of the weighted α-shape [4]. A description of the abstract VoroCrust algorithm we analyze is provided next. Figure1 illustrates the basic concepts in 2D. 1 The Abstract VoroCrust Algorithm 1. Take as input a weighted point sampling P = f(pi; wi)g of a closed 2-manifold M. p 2. Use weights to define a ball Bi of radius ri = wi centered at each sample pi. 3. Find intersecting triplet of balls to obtain one corner point on either side of M. 4. Collect the Voronoi generators G as the set of corner points outside all sample balls. 5. Optionally, include in G more generators far-inside M to further decompose its interior. 6. Output the Voronoi diagram of G as the desired decomposition, and the facets separating the inside and outside generators as the reconstructed surface M^ .
Recommended publications
  • A General Geometric Construction of Coordinates in a Convex Simplicial Polytope

    A General Geometric Construction of Coordinates in a Convex Simplicial Polytope

    A general geometric construction of coordinates in a convex simplicial polytope ∗ Tao Ju a, Peter Liepa b Joe Warren c aWashington University, St. Louis, USA bAutodesk, Toronto, Canada cRice University, Houston, USA Abstract Barycentric coordinates are a fundamental concept in computer graphics and ge- ometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to a general form that is capable of constructing a family of coor- dinates in a convex 2D polygon, 3D triangular polyhedron, or a higher-dimensional simplicial polytope. This family unifies previously known coordinates, including Wachspress coordinates, mean value coordinates and discrete harmonic coordinates, in a simple geometric framework. Using the construction, we are able to create a new set of coordinates in 3D and higher dimensions and study its relation with known coordinates. We show that our general construction is complete, that is, the resulting family includes all possible coordinates in any convex simplicial polytope. Key words: Barycentric coordinates, convex simplicial polytopes 1 Introduction In computer graphics and geometric modelling, we often wish to express a point x as an affine combination of a given point set vΣ = {v1,...,vi,...}, x = bivi, where bi =1. (1) i∈Σ i∈Σ Here bΣ = {b1,...,bi,...} are called the coordinates of x with respect to vΣ (we shall use subscript Σ hereafter to denote a set). In particular, bΣ are called barycentric coordinates if they are non-negative. ∗ [email protected] Preprint submitted to Elsevier Science 3 December 2006 v1 v1 x x v4 v2 v2 v3 v3 (a) (b) Fig.
  • Fitting Tractable Convex Sets to Support Function Evaluations

    Fitting Tractable Convex Sets to Support Function Evaluations

    Fitting Tractable Convex Sets to Support Function Evaluations Yong Sheng Sohy and Venkat Chandrasekaranz ∗ y Institute of High Performance Computing 1 Fusionopolis Way #16-16 Connexis Singapore 138632 z Department of Computing and Mathematical Sciences Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125, USA March 11, 2019 Abstract The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional ap- proaches typically rely on estimators that minimize the error over all possible compact convex sets; in particular, these methods do not allow for the incorporation of prior structural informa- tion about the underlying set and the resulting estimates become increasingly more complicated to describe as the number of measurements available grows. We address both of these short- comings by describing a framework for estimating tractably specified convex sets from support function evaluations. Building on the literature in convex optimization, our approach is based on estimators that minimize the error over structured families of convex sets that are specified as linear images of concisely described sets { such as the simplex or the free spectrahedron { in a higher-dimensional space that is not much larger than the ambient space. Convex sets parametrized in this manner are significant from a computational perspective as one can opti- mize linear functionals over such sets efficiently; they serve a different purpose in the inferential context of the present paper, namely, that of incorporating regularization in the reconstruction while still offering considerable expressive power. We provide a geometric characterization of the asymptotic behavior of our estimators, and our analysis relies on the property that certain sets which admit semialgebraic descriptions are Vapnik-Chervonenkis (VC) classes.
  • Configurations of Points and Lines

    Configurations of Points and Lines

    Configurations of Points and Lines "RANKO'RüNBAUM 'RADUATE3TUDIES IN-ATHEMATICS 6OLUME !MERICAN-ATHEMATICAL3OCIETY http://dx.doi.org/10.1090/gsm/103 Configurations of Points and Lines Configurations of Points and Lines Branko Grünbaum Graduate Studies in Mathematics Volume 103 American Mathematical Society Providence, Rhode Island Editorial Board David Cox (Chair) Steven G. Krantz Rafe Mazzeo Martin Scharlemann 2000 Mathematics Subject Classification. Primary 01A55, 01A60, 05–03, 05B30, 05C62, 51–03, 51A20, 51A45, 51E30, 52C30. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-103 Library of Congress Cataloging-in-Publication Data Gr¨unbaum, Branko. Configurations of points and lines / Branko Gr¨unbaum. p. cm. — (Graduate studies in mathematics ; v. 103) Includes bibliographical references and index. ISBN 978-0-8218-4308-6 (alk. paper) 1. Configurations. I. Title. QA607.G875 2009 516.15—dc22 2009000303 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904-2294, USA. Requests can also be made by e-mail to [email protected]. c 2009 by the American Mathematical Society.
  • Multi-Armed Bandits with Applications to Markov Decision Processes and Scheduling Problems

    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.
  • Chapter 7 Block Designs

    Chapter 7 Block Designs

    Chapter 7 Block Designs One simile that solitary shines In the dry desert of a thousand lines. Epilogue to the Satires, ALEXANDER POPE The collection of all subsets of cardinality k of a set with v elements (k < v) has the ³ ´ v¡t property that any subset of t elements, with 0 · t · k, is contained in precisely k¡t subsets of size k. The subsets of size k provide therefore a nice covering for the subsets of a lesser cardinality. Observe that the number of subsets of size k that contain a subset of size t depends only on v; k; and t and not on the specific subset of size t in question. This is the essential defining feature of the structures that we wish to study. The example we just described inspires general interest in producing similar coverings ³ ´ v without using all the k subsets of size k but rather as small a number of them as possi- 1 2 CHAPTER 7. BLOCK DESIGNS ble. The coverings that result are often elegant geometrical configurations, of which the projective and affine planes are examples. These latter configurations form nice coverings only for the subsets of cardinality 2, that is, any two elements are in the same number of these special subsets of size k which we call blocks (or, in certain instances, lines). A collection of subsets of cardinality k, called blocks, with the property that every subset of size t (t · k) is contained in the same number (say ¸) of blocks is called a t-design. We supply the reader with constructions for t-designs with t as high as 5.
  • Polytopes with Special Simplices 3

    Polytopes with Special Simplices 3

    POLYTOPES WITH SPECIAL SIMPLICES TIMO DE WOLFF Abstract. For a polytope P a simplex Σ with vertex set V(Σ) is called a special simplex if every facet of P contains all but exactly one vertex of Σ. For such polytopes P with face complex F(P ) containing a special simplex the sub- complex F(P )\V(Σ) of all faces not containing vertices of Σ is the boundary of a polytope Q — the basis polytope of P . If additionally the dimension of the affine basis space of F(P )\V(Σ) equals dim(Q), we call P meek; otherwise we call P wild. We give a full combinatorial classification and techniques for geometric construction of the class of meek polytopes with special simplices. We show that every wild polytope P ′ with special simplex can be constructed out of a particular meek one P by intersecting P with particular hyperplanes. It is non–trivial to find all these hyperplanes for an arbitrary basis polytope; we give an exact description for 2–basis polytopes. Furthermore we show that the f–vector of each wild polytope with special simplex is componentwise bounded above by the f–vector of a particular meek one which can be computed explicitly. Finally, we discuss the n–cube as a non–trivial example of a wild polytope with special simplex and prove that its basis polytope is the zonotope given by the Minkowski sum of the (n − 1)–cube and vector (1,..., 1). Polytopes with special simplex have applications on Ehrhart theory, toric rings and were just used by Francisco Santos to construct a counter–example disproving the Hirsch conjecture.
  • Homology Inference from Point Cloud Data

    Homology Inference from Point Cloud Data

    Homology Inference from Point Cloud Data Yusu Wang Abstract. In this paper, we survey a common framework of estimating topo- logical information from point cloud data (PCD) that has been developed in the field of computational topology in the past twenty years. Specifically, we focus on the inference of homological information. We briefly explain the main ingredients involved, and present some basic results. This chapter is part of the AMS short course on Geometry and Topology in Statistical Inference. It aims to introduce the general mathematical audience to the problem of topol- ogy inference, but is not meant to be a comprehensive review of the field in general. 1. Introduction The past two decades have witnessed tremendous development in the field of computational and applied topology. Much progress has been made not only in the theoretical and computational fronts, but also in the application of topological methods / ideas for data analysis. For example, on the theoretical front, there has been elegant work on the so-called persistent homology, originally proposed in [52] 1, and further developed in [15, 16, 19, 22, 33, 94] etc. On the application front, topological methods have been successfully used in fields such as computer graphics e.g, [67, 82, 42], visualization e.g, [10, 77, 76], geometric reconstruction and meshing e.g, [2, 41, 90], sensor network e.g, [38, 39, 61, 88, 91], high dimensional data analysis e.g, [59, 60, 84, 89] and so on. Indeed, topological data analysis (TDA) has become a vibrant field attracting researchers from mathematics, computer science and statistics.
  • On the Levi Graph of Point-Line Configurations 895

    On the Levi Graph of Point-Line Configurations 895

    inv lve a journal of mathematics On the Levi graph of point-line configurations Jessica Hauschild, Jazmin Ortiz and Oscar Vega msp 2015 vol. 8, no. 5 INVOLVE 8:5 (2015) msp dx.doi.org/10.2140/involve.2015.8.893 On the Levi graph of point-line configurations Jessica Hauschild, Jazmin Ortiz and Oscar Vega (Communicated by Joseph A. Gallian) We prove that the well-covered dimension of the Levi graph of a point-line configuration with v points, b lines, r lines incident with each point, and every line containing k points is equal to 0, whenever r > 2. 1. Introduction The concept of the well-covered space of a graph was first introduced by Caro, Ellingham, Ramey, and Yuster[Caro et al. 1998; Caro and Yuster 1999] as an effort to generalize the study of well-covered graphs. Brown and Nowakowski [2005] continued the study of this object and, among other things, provided several examples of graphs featuring odd behaviors regarding their well-covered spaces. One of these special situations occurs when the well-covered space of the graph is trivial, i.e., when the graph is anti-well-covered. In this work, we prove that almost all Levi graphs of configurations in the family of the so-called .vr ; bk/- configurations (see Definition 3) are anti-well-covered. We start our exposition by providing the following definitions and previously known results. Any introductory concepts we do not present here may be found in the books by Bondy and Murty[1976] and Grünbaum[2009]. We consider only simple and undirected graphs.
  • Stony Brook University

    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.
  • Self-Dual Configurations and Regular Graphs

    Self-Dual Configurations and Regular Graphs

    SELF-DUAL CONFIGURATIONS AND REGULAR GRAPHS H. S. M. COXETER 1. Introduction. A configuration (mci ni) is a set of m points and n lines in a plane, with d of the points on each line and c of the lines through each point; thus cm = dn. Those permutations which pre­ serve incidences form a group, "the group of the configuration." If m — n, and consequently c = d, the group may include not only sym­ metries which permute the points among themselves but also reci­ procities which interchange points and lines in accordance with the principle of duality. The configuration is then "self-dual," and its symbol («<*, n<j) is conveniently abbreviated to na. We shall use the same symbol for the analogous concept of a configuration in three dimensions, consisting of n points lying by d's in n planes, d through each point. With any configuration we can associate a diagram called the Menger graph [13, p. 28],x in which the points are represented by dots or "nodes," two of which are joined by an arc or "branch" when­ ever the corresponding two points are on a line of the configuration. Unfortunately, however, it often happens that two different con­ figurations have the same Menger graph. The present address is concerned with another kind of diagram, which represents the con­ figuration uniquely. In this Levi graph [32, p. 5], we represent the points and lines (or planes) of the configuration by dots of two colors, say "red nodes" and "blue nodes," with the rule that two nodes differently colored are joined whenever the corresponding elements of the configuration are incident.
  • 15 BASIC PROPERTIES of CONVEX POLYTOPES Martin Henk, J¨Urgenrichter-Gebert, and G¨Unterm

    15 BASIC PROPERTIES of CONVEX POLYTOPES Martin Henk, J¨Urgenrichter-Gebert, and G¨Unterm

    15 BASIC PROPERTIES OF CONVEX POLYTOPES Martin Henk, J¨urgenRichter-Gebert, and G¨unterM. Ziegler INTRODUCTION Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their im- portance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry to linear and combinatorial optimiza- tion. In this chapter we try to give a short introduction, provide a sketch of \what polytopes look like" and \how they behave," with many explicit examples, and briefly state some main results (where further details are given in subsequent chap- ters of this Handbook). We concentrate on two main topics: • Combinatorial properties: faces (vertices, edges, . , facets) of polytopes and their relations, with special treatments of the classes of low-dimensional poly- topes and of polytopes \with few vertices;" • Geometric properties: volume and surface area, mixed volumes, and quer- massintegrals, including explicit formulas for the cases of the regular simplices, cubes, and cross-polytopes. We refer to Gr¨unbaum [Gr¨u67]for a comprehensive view of polytope theory, and to Ziegler [Zie95] respectively to Gruber [Gru07] and Schneider [Sch14] for detailed treatments of the combinatorial and of the convex geometric aspects of polytope theory. 15.1 COMBINATORIAL STRUCTURE GLOSSARY d V-polytope: The convex hull of a finite set X = fx1; : : : ; xng of points in R , n n X i X P = conv(X) := λix λ1; : : : ; λn ≥ 0; λi = 1 : i=1 i=1 H-polytope: The solution set of a finite system of linear inequalities, d T P = P (A; b) := x 2 R j ai x ≤ bi for 1 ≤ i ≤ m ; with the extra condition that the set of solutions is bounded, that is, such that m×d there is a constant N such that jjxjj ≤ N holds for all x 2 P .
  • Evolutionary Homology on Coupled Dynamical Systems

    Evolutionary Homology on Coupled Dynamical Systems

    Evolutionary homology on coupled dynamical systems Zixuan Cang1, Elizabeth Munch1;2 and Guo-Wei Wei1;3;4 ∗ 1 Department of Mathematics 2Department of Computational Mathematics, Science and Engineering 3 Department of Biochemistry and Molecular Biology 4 Department of Electrical and Computer Engineering Michigan State University, MI 48824, USA February 14, 2018 Abstract Time dependence is a universal phenomenon in nature, and a variety of mathematical models in terms of dynamical systems have been developed to understand the time-dependent behavior of real-world problems. Originally constructed to analyze the topological persistence over spatial scales, persistent homology has rarely been devised for time evolution. We propose the use of a new filtration function for persistent homology which takes as input the adjacent oscillator trajecto- ries of coupled dynamical systems. We also regulate the dynamical system by a weighted graph Laplacian matrix derived from the network of interest, which embeds the topological connectivity of the network into the dynamical system. The resulting topological signatures, which we call evolution- ary homology (EH) barcodes, reveal the topology-function relationship of the network and thus give rise to the quantitative analysis of nodal properties. The proposed EH is applied to protein residue networks for protein thermal fluctuation analysis, rendering the most accurate B-factor prediction of a set of 364 proteins. This work extends the utility of dynamical systems to the quantitative modeling and analysis of realistic physical systems. Contents 1 Introduction 2 2 Methods 4 2.1 Coupled dynamical systems . .4 arXiv:1802.04677v1 [math.AT] 13 Feb 2018 2.1.1 Systems configuration .