DOCSLIB.ORG

December 1983 Table of Contents

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
December 1983 Table of Contents Notices of the American Mathematical Society Special Issue Assistantships and Fellowships in the Mathematical Sciences 1984-1985 December 1983, Issue 230 Volume 30, Number 8, Pages 841-936 Providence, Rhode Island USA ISSN 0002-9920 INSTITUT HENRI POINCARE NONLINEAR ANALYSIS Nonlinear analysis, as a discipline, has lately reached maturity and this development now justifies the publication of a specialized jour­ nal. Papers devoted to theory as well as applications are welcome, providing they bring a significant contribution to nonlinear analysis. The highest scientific standards will be sought so that the most impor­ tant results reach a broad international audience in the shortest possi­ ble time. Editor-in-chief : I. Ekeland (Paris-Dauphine) Centre de Recherches de Mathematiques de Ia Decision Universite de Paris 9 Dauphine 75775 Paris Cedex 16 - France Contents - Issue N° 1, vol. 1 : • P.H. Rabinowitz : "A rapid convergence method for a singular perturbation problem" • I. Eke/and : "Une theorie de Morse pour les systemes hamiltoniens con vexes" First issue available in January 1984 - 6 issues per year Subscription rate : 610 FF (France) - 795 FF (Export) Subscriptions and sample copies are available from : CDR -Centrale des Revues 11, rue Gossin - 92543 Montrouge Cedex - France Notices of the American Mathematical Society EDITORIAL COMMITTEE Volume 30, Number 8, December 1983 Ralph P. Boas, Ed Dubinsky Richard j. Griego, Susan Montgomery Mary Ellen Rudin, Bertram Walsh Special Issue Everett Pitcher (Chairman) Assistantships and Fellowships MANAGING EDITOR in the Mathematical Sciences 1984-1985 Lincoln K. Durst ASSOCIATE EDITORS Hans Samelson, Queries 842 Committee on Employment and Educational Ronald L. Graham, Special Articles Policy, Statement on Employment Prospects SUBSCRIPTION INFORMATION Subscription prices for Volume 31 (1984) 842 Assistantships and Fellowships are $50 list; $25 member. (The subscrip· in the Mathematical Sciences in 1984-1985 tion price for members is included in the annual dues.) A late charge of 1 O% of the 913 Critical, Historical or Expository Theses subscription price will be imposed upon 915 Stipends for Study and Travel orders received from nonmembers after january 1 of the subscription year. Sub· Graduate Support, 915 scribers outside the United States and Postdoctoral Support, 918 India must pay a postage surcharge of Travel and Study Abroad, 926 $5; subscribers in India must pay a postage surcharge of $15. Subscrip- Study in the U.S. for Foreign Nationals, 929 tions and orders for AMS publications Sources of Fellowship Information, 930 should be addressed to the American Mathematical Society, P.O. Box 1571, 933 Annual Index, Volume 30 Annex Station, Providence, Rl 02901. All orders must be prepaid. ADVERTISING & INQUIRIES The Notices publishes situations wanted and classified advertising, and display advertising for publishers and academic or scientific organiza­ tions. Requests for information: Advertising: Wahlene Siconio Change of address or subscriptions: Eileen Linnane Book Order number 800-556-7774. Copyright © 1983 by the American Mathematical Society, Printed in the United States of America. Subscribers' changes of address should be reported well in advance to avoid disruption of service: address labels are prepared four to six weeks in advance of the date of mailing. Requests for a change of address should always include the member or subscriber code and preferably a copy of the entire mailing label. Members are reminded that U. S. Postal Service change-of­ address forms are not adequate for this purpose, since they make no provision for several important items of information which are essential for the AMS records. Suitable forms are published from time to time in the Notices (e.g. June 1980, page 378). Send change of address notices to the Society at Post Office Box 6248, Providence, RI 02940. [Notices is published eight times a year (January, February, April, Jurie, August, October, November, December) by the American Mathematical Society at 201 Charles Street, Providence, RI 02904. Second class postage paid at Providence, RI and additional mailing offices. POSTMASTER: Send address change notices to Membership and Sales Department, American Mathematical Society, Post Office Box 6248, Providence, Rl 02940.] Publication here of the Society's street address, and the other information in brackets above, is a technical requirement of the U. S. Postal Service. The street address should never be used by correspondents, unless they plan to deliver their messages by hand. Members are strongly urged to notify the Society themselves of address changes (in the manner described above), since (as explained above) reliance on the postal service change-of-address forms is liable to cause delays in processing such requests in the AMS office. Statement by AMS Committee on Employment and Educational Policy Current and prospective graduate students in mathematics and their advisors should be informed of employment prospects in the profession. Information on employment in mathematics can be found in the following articles: 26th Annual AMS Survey, First Report, November 1982 Notices, pages 630-653, Second Report, February 1983 Notices, pages 160-165; 27th Annual AMS Survey, First Report, November 1983 Notices, pages 720-747. The 24th Annual Survey includes a Report on the 1980 AMS Nonacademic Salary Survey which may be found on pages 610-614 of the November 1980 issue of the Notices. Committee on Employment and Educational Policy (December 1989) Lida K. Barrett Robert W. McKelvey Lisl Novak Gaal Donald C. Rung, chairman Irwin Kra Barnet M. Weinstock Data Subcommittee Short Course Subcommittee Lida K. Barrett Arthur P. Mattuck Stefan A. Burr, Cathleen S. Morawetz Susan J. Devlin Donald C. Rung, chairman Barbara L. Osofsky Lincoln K. Durst chairman Lis! Novak Gaal Philip D. Straffin, Jr. Wendell H. Fleming Robert W. McKelvey Employment Concerns Subcommittee Charlotte Lin Barnet M. Weinstock, Audrey Terras chairman Robert J. Thompson The list of assistantships and fellowships on the following pages at universities includes 399 departments of mathematics, applied mathematics, statistics, computer science, and related math­ ematical disciplines; these represent 281 colleges and universities. Institutions in the United States are listed alphabetically by state, followed by Canadian institutions. The number following "Faculty" is the number of faculty members in the department who are full time employees in the institution and at least half-time in the department; the number following "Published" is the number of those who have published a technical paper or book in the last three years. The section on "Graduate Students" refers to the number of graduate students in the department who are full-time (including teaching assistants), full-time first year, and part-time. Unreported information in any of these categories is indicated by a dash. Under the DEGREES AWARDED column the following terms have been used: Bachelor's by inst. Number of bachelor's degrees awarded by the institution Bachelor's by dept. Number of bachelor's degrees awarded by the department Master's by dept. Number of master's degrees awarded by the department Ph.D. (80/83) ..... Doctoral degrees awarded during the last three years (1980-1981, 1981-1982 and 1982-1983) Abbreviations used ANT Algebra or Number Theory S . Statistics AFA Analysis or Functional Analysis CS . Computer Science GT . Geometry or Topology OR . Operations Research L Logic AM . Applied Mathematics P . Probability ME . Mathematics Education Under the SERVICE REQUIRED column, hours per week section, "c" denotes contact hours. 842 Mathematical Sciences Assistantships and Fellowships for Graduate Study at Universities in 1984-1985 TYPE OF ASSISTANCE STIPEND FEES SERVICE REQUIRED DEGREES AWARDED (number anticipated paid to student paid by hours type Academic year 1g84-1g85) dollars months student ($) per week of service 1g82-1g83 Alabama Aubum University, Aubum University 36849 MATHEMATICS Applications due: 3/10/84 Bachelor's by inst. 317g Jack B. Brown, Head Faculty 47; Published 3g Bachelor's by dept. 14 Graduate Students: full-time 23; full-time first year 5; part-time 1 Master's by dept. 4 Teaching Assistantship (40) 6030-10260* g 1080 5-10' Teaching Ph. D. (80/83) ANT 7, GT 3. *1g93-94 stipend. Total: 10 University of Alabama in Birmingham 35294 BIOSTATISTICS AND BIOMATHEMATICS Applications due: 4/30/84 Bachelor's by inst. 1325 Alfred A. Bartolucci, Chairman Faculty 12; Published 3 Graduate Students: full-time 8; full-time first year 4; part-time 11 Fellowship (4) 5500 12 1056 Ph. D. (80/83) S 3, AM 2. Total: 5 MATHEMATICS Applications due: 6/1/84 Bachelor's by inst. 1325 Louis Dale, Chairman Faculty 21; Published 14 Bachelor's by dept. 17 Graduate Students: full-time 4; full-time first year 2; part-time 3 Fellowship (2) 5500-a500 12 1380 Research Teaching Fellowship (2) 5500-a500 12 1380 Teaching University of Alabama in Huntsville 35899 COMPUTER SCIENCE Applications due: Open Bachelor's by inst. 571 Sajjan Shiva, Chairman Faculty gi Published 5 Bachelor's by dept. 2 Graduate Students: full-time 15; full-time first year 12; part-time 340 Master's by dept. 7 Teaching Assistantship (6) 6000--8000 g Waived 20 Teaching, grading Research Assistantship (3) 6000--8000 g Waived 20 Research MATHEMATICS Applications due: 3/1/84 Bachelor's by inst. 571 F. Lee Cook, Chairman Faculty 18; Published 14 Bachelor's by dept. 13 Graduate Students: full-time 4; full-time first year 2; part-time 1g Master's by dept. 2 Teaching Assistantship (5) 5000-5500 g 4' Grading, teaching Graduate Ce>-op Program* *Several available. University of Alabama, Tuscaloosa 35486 MANAGEMENT SCIENCE AND STATISTICS Applications due: 5/31/84 Bachelor's by inst. 2000 F. H. Barron, Head Faculty 13; Published 10 Bachelor's by dept. 30 Graduate Students: full-time 30; ful~time first year 10; part-time - Master's by dept. 2 Fellowship (2) 6000 g Ph. D. (80/83) S 2, OR 3. Teaching Assistantship (14) 4500-gooo g 0-275 10 Teaching Total: 5 Alaska University of Alaska, Fairbanks 99701 MATHEMATICAL SCIENCES Applications due: 7/15/84 Bachelor's by inst.
Load more

Recommended publications
  • SETL for Internet Data Processing
    SETL for Internet Data Processing by David Bacon A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Computer Science New York University January, 2000 Jacob T. Schwartz (Dissertation Advisor) c David Bacon, 1999 Permission to reproduce this work in whole or in part for non-commercial purposes is hereby granted, provided that this notice and the reference http://www.cs.nyu.edu/bacon/phd-thesis/ remain prominently attached to the copied text. Excerpts less than one PostScript page long may be quoted without the requirement to include this notice, but must attach a bibliographic citation that mentions the author’s name, the title and year of this disser- tation, and New York University. For my children ii Acknowledgments First of all, I would like to thank my advisor, Jack Schwartz, for his support and encour- agement. I am also grateful to Ed Schonberg and Robert Dewar for many interesting and helpful discussions, particularly during my early days at NYU. Terry Boult (of Lehigh University) and Richard Wallace have contributed materially to my later work on SETL through grants from the NSF and from ARPA. Finally, I am indebted to my parents, who gave me the strength and will to bring this labor of love to what I hope will be a propitious beginning. iii Preface Colin Broughton, a colleague in Edmonton, Canada, first made me aware of SETL in 1980, when he saw the heavy use I was making of associative tables in SPITBOL for data processing in a protein X-ray crystallography laboratory.
    [Show full text]
  • Bibliography
    Bibliography [1] P. Agarwal, S. Har-Peled, M. Sharir, and Y. Wang. Hausdorff distance under translation for points, disks, and balls. Manuscript, 2002. [2] P. Agarwal and M. Sharir. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions. Discrete Comput. Geom., 24:645–685, 2000. [3] P. K. Agarwal, O. Schwarzkopf, and Micha Sharir. The overlay of lower envelopes and its applications. Discrete Comput. Geom., 15:1–13, 1996. [4] Pankaj K. Agarwal. Efficient techniques in geometric optimization: An overview, 1999. slides. [5] Pankaj K. Agarwal and Micha Sharir. Motion planning of a ball amid segments in three dimensions. In Proc. 10th ACM-SIAM Sympos. Discrete Algorithms, pages 21–30, 1999. [6] Pankaj K. Agarwal and Micha Sharir. Pipes, cigars, and kreplach: The union of Minkowski sums in three dimensions. In Proc. 15th Annu. ACM Sympos. Comput. Geom., pages 143–153, 1999. [7] Pankaj K. Agarwal, Micha Sharir, and Sivan Toledo. Applications of parametric searching in geometric optimization. Journal of Algorithms, 17:292–318, 1994. [8] Pankaj Kumar Agarwal and Micha Sharir. Arrangements and their applications. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 49–120. Elsevier, 1999. [9] H. Alt, O. Aichholzer, and G¨unter Rote. Matching shapes with a reference point. Inter- nat. J. Comput. Geom. Appl., 7:349–363, 1997. [10] H. Alt and M. Godau. Computing the Fr´echet distance between two polygonal curves. Internat. J. Comput. Geom. Appl., 5:75–91, 1995. [11] H. Alt, K. Mehlhorn, H. Wagener, and Emo Welzl. Congruence, similarity and symme- tries of geometric objects.
    [Show full text]
  • CFA2: Pushdown Flow Analysis for Higher-Order Languages
    CFA2: Pushdown Flow Analysis for Higher-Order Languages A dissertation presented by Dimitrios Vardoulakis to the Faculty of the Graduate School of the College of Computer and Information Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy Northeastern University Boston, Massachusetts August 20, 2012 Abstract In a higher-order language, the dominant control-flow mechanism is func- tion call and return. Most higher-order flow analyses do not handle call and return well: they remember only a bounded number of pending calls because they approximate programs as finite-state machines. Call/return mismatch introduces precision-degrading spurious execution paths and in- creases the analysis time. We present flow analyses that provide unbounded call/return matching in a general setting: our analyses apply to typed and untyped languages, with first-class functions, side effects, tail calls and first-class control. This is made possible by several individual techniques. We generalize Sharir and Pnueli’s summarization technique to handle expressive control constructs, such as tail calls and first-class continuations. We propose a syntactic classi- fication of variable references that allows precise lookups for non-escaping references and falls back to a conservative approximation for references cap- tured in closures. We show how to structure a flow analysis like a traditional interpreter based on big-step semantics. With this formulation, expressions use the analysis results of their subexpressions directly, which minimizes caching and makes the analysis faster. We present experimental results from two implementations for Scheme and JavaScript, which show that our anal- yses are precise and fast in practice.
    [Show full text]
  • Prof. Micha Sharir – CV
    Prof. Micha Sharir – CV June 2018 Micha Sharir is a professor of computer science at Tel Aviv University, and the incumbent of the Isaias and Alicia Nizri Chair in Computational Geometry and Robotics. He has also been a visiting research professor at New York University, and has served (twice) as the Chair of the Computer Science Department, and also as the Head of the School of mathematical Sciences. He received his degrees (B.Sc., M.Sc., and Ph.D.) in Mathematics from Tel Aviv University. He is also a co-founder of the Minerva Minkowski Center in Geometry. His research areas are in computational and combinatorial geometry, and in the past also in robotics, as well as their numerous applications. With Jack Schwartz of NYU, in a series of works on “the piano movers’ problem”, he founded the area of algorithmic motion planning in robotics, and has made many fundamental contributions to this area. His extensive work in computational and combinatorial geometry includes the study of Davenport-Schinzel sequences and their numerous geometric applications, the development of the theory of geometric arrangements and their diverse applications, the study of basic problems in geometric optimization, including efficient algorithms for linear programming and so-called LP-type problems, and the study of various basic problems in combinatorial geometry, including incidences between points and lines, curves, or surfaces. In the past decade he has worked on the applications of algebraic techniques to problems in combinatorial geometry, where he co-authored several of the recent major ground-breaking results. Prof. Sharir has published about 350 papers, and also about 250 papers in conference proceedings.
    [Show full text]
  • Emissary Mathematical Sciences Research Institute
    Spring/Fall 2003 Emissary Mathematical Sciences Research Institute www.msri.org Notes from the Director David Eisenbud One of the pleasures of any University is the renewal that takes place every fall — all those bright, expectant youngsters. With MSRI’s ever-changing scientific hori- zons we have the same thing, but more so; the analogue might be a University where even the faculty changes! Of course some stability is necessary — that’s the func- tion of our Advisory Committees and Directorate. The model has worked well. As we go into our twenty-first fall, I feel the pleasure and excitement once again. Our new programs are Differential Geometry and Discrete and Computational Geometry — matters classical and modern, “pure” and “applied” intimately mixed. We have a mix of interdisciplinary workshops coming up too, with Genetics of Complex Diseases and Mathemat- ical Neuroscience in the Spring. As usual, you can find more information on our web site. I returned last July from my semi-sabbatical year. I had lots of fun being a member at MSRI, taking part in the David Eisenbud, William R. Hearst and project architect Bill Glass Commutative Algebra year, while involved in fundrais- Building Campaign Predicts Success ing for the building extension (see on the right). Michael Singer held the fort as Acting Director, with Bob Meg- Three significant commitments from individuals to MSRI’s $7.3 million cam- ginson as Deputy. Many people told me that I wouldn’t paign will help the Institute announce Campaign success soon. In addition be able to enjoy a sabbatical unless I left town, and ap- to a generous early grant from founding director Shiing-Shen Chern, major parently they also told Michael that he would have a grants have also been received from MSRI trustee and campaign co-chair hard time with me hanging around in the house.
    [Show full text]
  • Dagrep-V003-I003-Complete.Pdf (4
    Volume 3, Issue 3, March 2013 Computational Geometry (Dagstuhl Seminar 13101) Otfried Cheong, Kurt Mehlhorn, and Monique Teillaud ........................... 1 Scheduling (Dagstuhl Seminar 13111) Susanne Albers, Onno J. Boxma, and Kirk Pruhs ................................ 24 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos ............................................................ 51 Future Internet (Dagstuhl Seminar 13131) Jon Crowcroft, Markus Fidler, Klara Nahrstedt, and Ralf Steinmetz . 75 DagstuhlReports,Vol.3,Issue3 ISSN2192-5283 ISSN 2192-5283 Published online and open access by Aims and Scope Schloss Dagstuhl – Leibniz-Zentrum für Informatik The periodical Dagstuhl Reports documents the GmbH, Dagstuhl Publishing, Saarbrücken/Wadern, program and the results of Dagstuhl Seminars and Germany. Dagstuhl Perspectives Workshops. Online available at http://www.dagstuhl.de/dagrep In principal, for each Dagstuhl Seminar or Dagstuhl Perspectives Workshop a report is published that Publication date contains the following: July, 2013 an executive summary of the seminar program and the fundamental results, Bibliographic information published by the Deutsche an overview of the talks given during the seminar Nationalbibliothek (summarized as talk abstracts), and The Deutsche Nationalbibliothek lists this publica- summaries from working groups (if applicable). tion in the Deutsche Nationalbibliografie; detailed This basic
    [Show full text]
  • Combinatorial Geometry and Its Algorithmic Applications the Alcalá Lectures
    Mathematical Surveys and Monographs Volume 152 Combinatorial Geometry and Its Algorithmic Applications The Alcalá Lectures János Pach Micha Sharir American Mathematical Society http://dx.doi.org/10.1090/surv/152 Combinatorial Geometry and Its Algorithmic Applications The Alcalá Lectures Mathematical Surveys and Monographs Volume 152 Combinatorial Geometry and Its Algorithmic Applications The Alcalá Lectures János Pach Micha Sharir American Mathematical Society Providence, Rhode Island EDITORIAL COMMITTEE Jerry L. Bona Michael G. Eastwood Ralph L. Cohen J. T. Stafford, Chair Benjamin Sudakov 2000 Mathematics Subject Classification. Primary 05C35, 05C62, 52C10, 52C30, 52C35, 52C45, 68Q25, 68R05, 68W05, 68W20. For additional information and updates on this book, visit www.ams.org/bookpages/surv-152 Library of Congress Cataloging-in-Publication Data Pach, Janos. Combinatorial geometry and its algorithmic applications : The Alcala lectures / Janos Pach, Micha Sharir. p. cm. — (Mathematical surveys and monographs ; v. 152) Includes bibliographical references and index. ISBN 978-0-8218-4691-9 (alk. paper) 1. Combinatorial geometry. 2. Algorithms. I. Sharir, Micha. II. Title. QA167.p332 2009 516.13–dc22 2008038876 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.
    [Show full text]
  • Acta Informatica
    A Complete Bibliography of Publications in Acta Informatica Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 14 May 2021 Version 1.41 Title word cross-reference #SAT [1268]. (n; k) [370]. (N − 1) [1203]. + [1117, 903]. 0 [349, 852]. 1 [32, 939, 293, 778, 516, 916, 607, 563, 548, 946, 231, 852, 578]. 1; 1 [488]. 2 [1234, 1246, 737, 714, 715, 313, 788, 92, 166, 202]. 2:5n [535]. 3 ∗ ∗ [1234, 313, 92, 202]. 7 [1141]. [466]. α − β [235]. α2 [1355]. B [515]. B [442]. B+ [680]. mod5 [1141]. P [1090]. QH [1090]. D [1209, 401, 136, 1078, 1017, 1185]. DTIMEF(F) =?DSPACEF(F) [1014]. 8 [832]. K [305, 401, 130, 1445, 467, 1078, 618, 252, 1343, 1187, 851, 1293, 157, 326, 338, 972, 961, 1043, 280, 359, 852]. Ks;t [1201]. L [820, 875]. LR [318]. X LU [659]. M [1021, 41, 561]. M [1521]. MTL0;1 [1406]. µ [731, 885]. N 2 [1203, 467, 140, 12, 852]. : [832]. ν2 [1355]. O(1) [669]. O(n) [136]. O(n ) [1486]. O(V 5=3E2=3) [321]. P [1183, 1184, 1226, 1379, 1146]. P = NP [399, 399]. P5 [1276]. π [1580, 1206, 1001, 1210, 1299, 912, 1198]. q [1442]. 1 2 R(1) [1390]. S [892]. Sometime = always + recursionalways [596].
    [Show full text]
  • Contents U U U
    Contents u u u ACM Awards Reception and Banquet, June 2018 .................................................. 2 Introduction ......................................................................................................................... 3 A.M. Turing Award .............................................................................................................. 4 ACM Prize in Computing ................................................................................................. 5 ACM Charles P. “Chuck” Thacker Breakthrough in Computing Award ............. 6 ACM – AAAI Allen Newell Award .................................................................................. 7 Software System Award ................................................................................................... 8 Grace Murray Hopper Award ......................................................................................... 9 Paris Kanellakis Theory and Practice Award ...........................................................10 Karl V. Karlstrom Outstanding Educator Award .....................................................11 Eugene L. Lawler Award for Humanitarian Contributions within Computer Science and Informatics ..........................................................12 Distinguished Service Award .......................................................................................13 ACM Athena Lecturer Award ........................................................................................14 Outstanding Contribution
    [Show full text]
  • Annual Report 02-03.Indb
    Contents A Word from the Director ..............................................................................................................2 Presenting the CRM .......................................................................................................................4 Personnel 2002-2003 .......................................................................................................................5 Scientific Personnel ........................................................................................................................6 Members .............................................................................................................................................................6 Postdoctoral Fellows ...........................................................................................................................................8 Visitors ................................................................................................................................................................9 Management ..................................................................................................................................11 Bureau de direction ........................................................................................................................................... 11 Advisory Committee ......................................................................................................................................... 11 Computer Facilities ..........................................................................................................................................
    [Show full text]
  • Novel Frameworks for Mining Heterogeneous and Dynamic
    Novel Frameworks for Mining Heterogeneous and Dynamic Networks A dissertation submitted to the Graduate School of the University of Cincinnati in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Department of Electrical and Computer Engineering and Computer Science of the College of Engineering by Chunsheng Fang B.E., Electrical Engineering & Information Science, June 2006 University of Science & Technology of China, Hefei, P.R.China Advisor and Committee Chair: Prof. Anca L. Ralescu November 3, 2011 Abstract Graphs serve as an important tool for discrete data representation. Recently, graph representations have made possible very powerful machine learning algorithms, such as manifold learning, kernel methods, semi-supervised learning. With the advent of large-scale real world networks, such as biological networks (disease network, drug target network, etc.), social networks (DBLP Co- authorship network, Facebook friendship, etc.), machine learning and data mining algorithms have found new application areas and have contributed to advance our understanding of proper- ties, and phenomena governing real world networks. When dealing with real world data represented as networks, two problems arise quite naturally: I) How to integrate and align the knowledge encoded in multiple and heterogeneous networks? For instance, how to find out the similar genes in co-disease and protein-protein inter- action networks? II) How to model and predict the evolution of a dynamic network? A real world exam- ple is, given N years snapshots of an evolving social network, how to build a model that can cap- ture the temporal evolution and make reliable prediction? In this dissertation, we present an innovative graph embedding framework, which identifies the key components of modeling the evolution in time of a dynamic graph.
    [Show full text]
  • Certified Approximation Algorithms for the Fermat Point and N-Ellipses
    Certified Approximation Algorithms for the Fermat Point and n-Ellipses Kolja Junginger # Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland Ioannis Mantas # Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland Evanthia Papadopoulou # Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland Martin Suderland # Faculty of Informatics, Università della Svizzera italiana, Lugano, Switzerland Chee Yap # Courant Institute, New York University, NY, USA Abstract d Given a set A of n points in R with weight function w : A → R>0, the Fermat distance function is P φ(x) := a∈A w(a)∥x − a∥. A classic problem in facility location dating back to 1643, is to find the Fermat point x∗, the point that minimizes the function φ. We consider the problem of computing ∗ ∗ ∗ ∗ a point xe that is an ε-approximation of x in the sense that ∥xe − x ∥ < ε. The algorithmic literature has so far used a different notion based on ε-approximation of the value φ(x∗). We devise a ∗ certified subdivision algorithm for computing xe , enhanced by Newton operator techniques. We also revisit the classic Weiszfeld-Kuhn iteration scheme for x∗, turning it into an ε-approximate Fermat point algorithm. Our second problem is the certified construction of ε-isotopic approximations of n-ellipses. These are the level sets φ−1(r) for r > φ(x∗) and d = 2. Finally, all our planar (d = 2) algorithms are implemented in order to experimentally evaluate them, using both synthetic as well as real world datasets. These experiments show the practicality of our techniques. 2012 ACM Subject Classification Theory of computation → Approximation algorithms analysis Keywords and phrases Fermat point, n-ellipse, subdivision, approximation, certified, algorithms Digital Object Identifier 10.4230/LIPIcs.ESA.2021.54 Funding The work of C.
    [Show full text]