DOCSLIB.ORG

INRIA, Evaluation of Theme Sym B

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
INRIA, Evaluation of Theme Sym B INRIA, Evaluation of Theme Sym B Project-team Algorithms November 14-15, 2006 Project-team title: Algorithms (ALGO) Scientific leader: Bruno Salvy Research center: Rocquencourt 1 Personnel Personnel (March 2002) Misc. INRIA CNRS University Total DR (1) / Professors 3 3 CR (2) / Assistant Professors 1 1 Permanent Engineers (3) Temporary Engineers (4) PhD Students 5 1 6 Post-Doc. 1 1 Total 6 4 1 11 External Collaborators 2 2 2 6 Visitors (> 1 month) 1 1 (1) “Senior Research Scientist (Directeur de Recherche)” (2) “Junior Research Scientist (Charg´ede Recherche)” (3) “Civil servant (CNRS, INRIA, ...)” (4) “Associated with a contract (Ing´enieur Expert or Ing´enieurAssoci´e)” Personnel (November 2006) Misc. INRIA CNRS University Total DR / Professors 3 3 CR / Assistant Professor 2 2 Permanent Engineer Temporary Engineer 1 1 PhD Students 1 2 3 Post-Doc. 1 1 Total 3 5 2 10 External Collaborators 1 1 2 Visitors (> 1 month) 1 Changes in staff DR / Professors Misc. INRIA CNRS University total CR / Assistant Professors Arrival 1 Leaving Comments: Alin Bostan joined our team in September 2004. Current composition of the project-team in November 2006: – DR: Philippe Flajolet (DR 0), Mireille R´egnier and Bruno Salvy (DR 2); – CR: Fr´ed´eric Chyzak (CR 1), Alin Bostan (CR 2); – PhD Students: Eric´ Fusy (deputation from Corps des T´el´ecoms), Fr´ed´eric Giroire and Carine Pivoteau (with scholarships from the Ministry of Research and Higher Education); – Temporary Engineer: Andr´eDerrick Balsa; – Post-doc: Fr´ed´ericMeunier (deputation from Corps des Ponts); – External collaborators: Philippe Dumas (Mathematics Teacher in a classe pr´eparatoire aux grandes Ecoles´ , Lyc´eeJean-Baptiste Say, Paris; Pierre Nicod`eme (CR CNRS, Ecole´ polytechnique). Current position of former project-team members (including PhD stu- dents during the March 2002 to November 2006 period): Former PhD students: – Alin Bostan, researcher, Algorithms project, Inria; – Marianne Durand, analyst in computational financial mathematics, BNP-Paribas, Paris, France; – Julien Fayolle, post-doc, LRI, University of Paris-Sud, France; – Ludovic Meunier, software engineer, Murex (software development for trading, risk management and processing), Paris, France; – Vincent Puyhaubert, mathematics teacher, classe pr´eparatoire aux grandes Ecoles´ , Lyc´ee F´enelon, Paris, France; – Mathias Vandenbogaert, researcher in biology, Institut Pasteur, Paris, France. Former post-docs: – Ha Le, half-time math developer, Waterloo Maple Inc., and half-time post-doc, Uni- versity of Waterloo, Canada; – Jos´eLuis Martins, administrator at the Commission of the European Communities, Luxembourg. – Alexandre Sedoglavic, maˆıtre de conf´erences in computer science, University of Lille, France; – Markus V¨oge, researcher in computer science, department of media technology, EMPA research institute, D¨ubendorf, Switzerland. 2 Last INRIA enlistments Alin Bostan, CR 2 since September 1st, 2004. 2 Work progress 2.1 Keywords Analysis of algorithms, analytic combinatorics, random discrete structures, limit laws, computer algebra, special functions, Gr¨obner bases, combinatorics on words, biological sequences, genome. 2.2 Context and overall goal of the project The primal objective of the project, inherited from the former century, is the field of anal- ysis of algorithms. By this is meant a precise quantification of complexity issues associated to the most fundamental algorithms and data structures of computer science. Departing from traditional approaches that, somewhat artificially, place emphasis on worst-case sce- narii, the project focuses on average-case and probabilistic analyses, aiming as often as possible at realistic data models. As such, our research is inspired by the pioneering works of Knuth. The need to analyze, dimension, and finely optimize algorithms requires an in-depth study of random discrete structures, like words, trees, graphs, and permutations, to name a few. Indeed, a vast majority of the most important algorithms in practice either “make bets” on the likely shape of input data or even base themselves of random choices. In this area we are developing a novel approach based on recent theories of combinatorial analysis together with the view that discrete models connect nicely with complex-analytic and asymptotic methods. The resulting theory has been called “Analytic combinatorics”. Applications of it have been or are currently being worked out in such diverse areas as communication protocols, multidimensional search, data structures for fast retrieval on external storage, data mining applications, the analysis of genomic sequences, and data compression, for instance. The analytic-combinatorial approach to the basic processes of computer science is very systematic. It appeared early in the history of the project that its development would greatly benefit from the existence of symbolic manipulation systems and computer algebra. This connection has given rise to an original research programme that we are currently carrying out. Some of the directions pursued include automating the manipulation of combinatorial models (counting, generating function equations, random generation), the development of “automatic asymptotics”, and the development of a unified view of the theory of special functions. In particular, the project has developed the Maple library Algolib, that addresses several of these issues. 2.3 Objectives for the evaluation period Copy-pasted and translated from the previous evaluation document. One of the first objectives is the completion of a vast synthesis on methods in ana- lytic combinatorics (by P. Flajolet and R. Sedgewick, a Princeton success writer). Then the development of analysis of algorithms, along the natural evolution: worst-case (often obsolete) → average-case (current) → probabilistic analysis (i.e., in distribution, the fu- ture). We aim at: various hashing schemes; the dynamical analysis of algorithms (with 3 B. Vall´ee, Caen); random generation (thanks to a new idea with a physical origin: Boltz- mann generators); the automation of the analysis of combinatorial structures by computer algebra; tree models and random graphs; problems exhibiting a phase transition in relation with analytic methods and coalescent saddle-points; elucidating the role of “holonomic” functions in the combinatorics of “hard” models, etc. Our research projects in computer algebra are guided by two objectives. First, com- plete and make more systematic the automation of the analysis of combinatorial struc- tures, in particular towards ordered structures and analyses in distribution. Second, take advantage of our specific strength in analysis to bring progress at the interface between computer algebra and numerical analysis. The idea is to bring together our work on spe- cial functions, recurrences and on asymptotic analysis so as to develop tools producing automatically efficient numerical code. This is the topic of L. Meunier’s PhD thesis. It will be validated and focused by applications in physics. It will also be fueled by more research on the analysis of non-linear differential equations and on efficiency issues in commutative and non-commutative elimination. Concerning the analysis of sequences, the recent trends, which will be pursued in the next years, concern the study of algorithms that search for sets of words or regular ex- pression, and the extension to the (more realistic) Markovian model of analysis performed under the Bernoulli model. Biological applications reveal how crucial time and memory complexity of the algorithms are. Thus part of our research will aim at the efficient con- struction of minimal automata (with M. Raffinot) in the case of regular expressions and on the set of words neighboring a given word (with U. Bordeaux). 2.4 Evolution of the objectives The long-term directions have not changed. The unexpected discovery of the LogLog algorithm for approximate counting has fo- cused some of our energy. The hiring of Alin Bostan has allowed us to concentrate more on efficiency issues in computer algebra. 2.5 Objective 1 (Analysis of algorithms): Executive summary The planned development of the book Analytic Combinatorics has been progressing at a fair pace, though the task of synthesizing a domain of such amplitude is quite labour- intensive. Random generation by means of Boltzmann models has been advancing and is gradually finding applications developed by partner teams in computational biology and software testing. Progress has been made in the analysis of phase transitions, in particular in connection with percolation on the random graph, which provides an entry point to the analysis of several hard optimization problems (e.g., constraint satisfaction). The perfection of the standard theory of analytic combinatorics has benefited from side studies related to urn processes, tree models, continued fractions, interconnection graphs, complex asymptotics, etc. New applications have been developed in the area of data com- pression (classical and new algorithms, e.g., by antidictionary), hashing, boolean function complexity, coding theory, and pattern occurrences in the context of intrusion detection. An unexpected development has been the revival of interest for probabilistic counting al- gorithms, which are currently the object of intense study by the network monitoring and data mining communities: the LogLog algorithm is currently the absolutely best algorithm available on the market (in terms of efficiency and robustness) for the fundamental task of estimating cardinalities
Load more

Recommended publications
  • SMT-Like Queries in Maple
    SMT-like Queries in Maple Stephen A. Forrest Maplesoft Europe Ltd., Cambridge, UK [email protected] Abstract. The recognition that Symbolic Computation tools could ben- efit from techniques from the world of Satisfiability Checking was a pri- mary motive for the founding of the SC2 community. These benefits would be further demonstrated by the existence of \SMT-like" queries in legacy computer algebra systems; that is, computations which seek to decide satisfiability or identify a satisfying witness. The Maple CAS has been under continuous development since the 1980s and its core symbolic routines incorporate many heuristics. We describe ongoing work to compose an inventory of such \SMT-like\ queries ex- tracted from the built-in Maple library, most of which were added long before the inclusion in Maple of explicit software links to SAT/SMT tools. Some of these queries are expressible in the SMT-LIB format us- ing an existing logic, and it is hoped that those that are not could help inform future development of the SMT-LIB standard. 1 Introduction 1.1 Maple Maple is a computer algebra system originally developed by members of the Symbolic Computation Group in the Faculty of Mathematics at the University of Waterloo. Since 1988, it has been developed and commercially distributed by Maplesoft (formally Waterloo Maple Inc.), a company based in Waterloo, Ontario, Canada, with ongoing contributions from affiliated research centres. The core Maple language is implemented in a kernel written in C++ and much of the computational library is written in the Maple language, though the system does employ external libraries such as LAPACK and the GNU Multiprecision Library (GMP) for special-purpose computations.
    [Show full text]
  • Stephen M. Watt 25 October 2010
    Stephen M. Watt 25 October 2010 Professional Address Department of Computer Science MC 375 [email protected] University of Western Ontario http://www.csd.uwo.ca/~watt London Ontario, canada n6a 5b7 Tel. +1 519 661-4244 Fax. +1 519 661-3515 Personal Address 56 Doncaster Place [email protected] London Ontario, canada n6g 2a5 Tel. +1 519 471-1688 Fax. +1 519 204-9288 Table of Contents General Career and Education . 2 Professional Biography . 2 Prizes, Awards, Honours . .3 Leadership . 4 Research Research Summary . 6 Publications . 8 Major Software Productions . 20 Invited Presentations . 21 Research Grants . .27 Technology Transfer . 30 Teaching Teaching Philosophy . .31 Program Development . 31 Courses Taught . .32 Training of Highly Qualified Personnel . .34 Outreach and Coaching . .39 Service Institutional Service . 40 Professional Boards and Committees . 42 Conference Organization . 43 Evaluation . 47 Stephen M. Watt 2 1 Career and Education 1997-date Professor, Department of Computer Science, University of Western Ontario, canada Department Chair (1997-2002) Cross appointments to departments of Applied Mathematics and Mathematics 2001-date Member, Board of Directors, Descartes Systems Group (nasdaq dsgx, tse dsg) Chairman of the Board (2003-2007) 1998-2009 Member, Board of Directors, Maplesoft 1996-1998 Responsable Scientifique (Scientific Director), Projet safir Institut National de Recherche en Informatique et en Automatique, france 1995-1997 Professeur, Dept. d’Informatique, Universit´ede Nice–Sophia Antipolis, france Titularisation (tenure) awarded January 1996. 1984-1997 Research Staff Member, IBM T.J. Watson Research Center, Yorktown Heights ny, usa 1982-1984 Lecturer (during PhD), Dept. of Computer Science, University of Waterloo, canada 1981-1986 PhD, Computer Science, University of Waterloo, canada 1979-1981 MMath, Applied Mathematics, University of Waterloo, canada 1976-1979 BSc, Honours Mathematics and Honours Physics, U.
    [Show full text]
  • Computer Science at the University of Waterloo
    COMPUTER SCIENCE AT WATERLOO A HISTORY TO CELEBRATE 25 YEARS by Peter J. Ponzo The William G. Davis Centre for Computer Research University of Waterloo COMPUTER SCIENCE at WATERLOO A History to Celebrate 25 Years : 1967 - 1992 Table of Contents Foreword ...................................................................................................................... 1 Prologue: "Computers" from Babbage to Turing .............................................. 3 Chapter One: the First Decade 1957-1967 ............................................................ 13 Chapter Two: the Early Years 1967 -1975 ............................................................ 39 Chapter Three: Modern Times 1975 -1992.............................................................. 52 Chapter Four: Symbolic Computation ..................................................................... 62 Chapter Five: the New Oxford English Dictionary ................................................. 67 Chapter Six: Computer Graphics ........................................................................... 74 Appendices A: A memo to Arts Faculty Chairman ..................................................................... 77 B: Undergraduate Courses in Computer Science .................................................... 79 C: the Computer Systems Group ............................................................................. 80 D: PhD Theses ......................................................................................................... 89 E: Graduate
    [Show full text]
  • Notices of the American Mathematical Society Is in Federal Support of Science and Published Monthly Except Bimonthly in May, June, Technology
    OF THE AMERICAN SOCIETY Young Scientists' Network Advocacy and an Electronic Newsletter Ease New Doctorates' Job Search Woes page 462 DeKalb Meeting (M?Y 20-23) page 481 MAY/JUNE 1993, VOLUME 40, NUMBER 5 Providence, Rhode Island, USA ISSN 0002-9920 Calendar of AMS Meetings and Conferences This calendar lists all meetings and conferences approved prior to the date this issue should be submitted on special forms which are available in many departments of went to press. The summer and annual meetings are joint meetings of the Mathematical mathematics and from the headquarters office of the Society. Abstracts of papers to Association of America and the American Mathematical Society. Abstracts of papers be presented at the meeting must be received at the headquarters of the Society in presented at a meeting of the Society are published in the journal Abstracts of papers Providence, Rhode Island, on or before the deadline given below for the meeting. Note presented to the American Mathematical Society in the issue corresponding to that of that the deadline for abstracts for consideration for presentation at special sessions is the Notices which contains the program of the meeting, insofar as is possible. Abstracts usually three weeks earlier than that specified below. Meetings ······R ••••*••asl¥1+1~ 11-1-m••• Abstract Program Meeting# Date Place Deadline Issue 882 t May 2G-23, 1993 DeKalb, Illinois Expired May-June 883 t August 15-19, 1993 (96th Summer Meeting) Vancouver, British Columbia May 18 July-August (Joint Meeting with the Canadian
    [Show full text]
  • Wei-Chi Yang | Radford University
    Curriculum Vitae of Professor Wei-Chi Yang E-mail:[email protected] URL: http://www.radford.edu/wyang EDUCATION • Ph.D., Mathematics, University of California, Davis, and Degree received: August 1988. Dissertation: The Multidimensional Variational Integral and Its Extensions. Advisor: Professor Emeritus Washek F. Pfeffer of the Mathematics Department. • M.A., Mathematics, University of California, Davis, March 1983. • B.S., Mathematics, Chung Yuan University, Taiwan, June 1981. CONSULTING 1. Consultant for Khulisa Management Services Inc., South Africa, July-November 2013. 2. Consultant for CASIO computer Ltd. 1/2000-3/2010. 3. Consultant for HP-Australia, 2010-2012, 7/98-10/99. 4. Consultant for Waterloo Maple Inc., Canada 1997-1998. 5. Visiting Consultant for Ngee Ann Polytechnic, Singapore, June 1997- June 1998 6. Consultant for TCI Software Research, U.S.A. 8/95-1/97. 7. Consultant for Waterloo Maple Software, Canada 1992-1994. 8. Consultant for Ngee Ann Polytechnic, Singapore 10/95-12/95. Awards, Grants and Honors 1. Awarded the Dalton Eminent Scholar Award by Radford University in November 2020. (see link here: https://www.radford.edu/wyang/2020- 2021DaltonEminent.pdf.) 2. Yang, W.-C. (April, 2020): The Proceedings of Asian Technology Conference in Mathematics (ATCM) has been evaluated for inclusion in Scopus by the Content Selection & Advisory Board (CSAB). Note. I founded the ATCM in 1995, the Proceedings of the conference is being indexed by Scopus is truly a prestigious honor and great for the ATCM communities. 3. Guest Professorship at the Leshan Vocational and Technical College, China, Nominated, Leshan Vocational and Technical College, China, Scholarship/Research, International, (April 3, 2019).
    [Show full text]
  • Seagram Museum Collection of Photographs and Audiovisual Material 2000.202
    Seagram Museum collection of photographs and audiovisual material 2000.202 This finding aid was produced using ArchivesSpace on September 14, 2021. Description is written in: English. Describing Archives: A Content Standard Audiovisual Collections PO Box 3630 Wilmington, Delaware 19807 [email protected] URL: http://www.hagley.org/library Seagram Museum collection of photographs and audiovisual material 2000.202 Table of Contents Summary Information .................................................................................................................................... 4 Historical Note ............................................................................................................................................... 5 Scope and Content ......................................................................................................................................... 5 Administrative Information ............................................................................................................................ 8 Related Materials ........................................................................................................................................... 9 Controlled Access Headings .......................................................................................................................... 9 Collection Inventory ..................................................................................................................................... 10 Chronological photographic
    [Show full text]
  • XML in Mathematical Web Services
    Re-format page sizes XML in Mathematical Web Services Mike Dewar Elena Smirnova Stephen M. Watt Abstract We describe a framework for delivering mathematical web services, resulting from the MONET project [http://monet.nag.co.uk/cocoon/monet/index.html]. Mathematical problems often have a well-defined structure that can be described in detail at a fine- grained level. In the MONET architecture, mathematical services describe their capabilities using a Mathematical Services Description Language in addition to WSDL. When presented with a problem, a mathematical service broker selects an appropriate set of services and combines them to provide a solver. We describe how two XML-based data formats, OpenMath and Content MathML, are used in a mathematical service toolkit based on the Maple computer algebra system. This service toolkit is based on a configuration engine that provides the appropriate conversions between the mathematical XML data formats, builds the necessary Maple program, and installs the necessary extensions to a generic Web services engine. XML 2005 Conference proceeding by RenderX - author of XML to PDF (XSL FO) formatter. 1 RenderX XSL • FO formatter Re-format page sizes XML in Mathematical Web Services Table of Contents 1. Introduction .................................................................................................................................... 4 1.1. Motivation ............................................................................................................................ 4 1.2. Objectives
    [Show full text]
  • Control System Theory in Maple
    Control System Theory in Maple by Justin M.J. Wozniak A thesis presented to the University of Waterloo in fulfilment of the thesis requirement for the degree of Master of Mathematics in Computer Science Waterloo, Ontario, Canada, 2008 c Justin M.J. Wozniak 2008 I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by pho- tocopying or by other means, in total or in part, at the request of other institutions or individuals for the purpose of scholarly research. ii The University of Waterloo requires the signatures of all persons using or pho- tocopying this thesis. Please sign below, and give address and date. iii Abstract In this thesis we examine the use of the computer algebra system Maple for control system theory. Maple is an excellent system for the manipulation of expres- sions used by control system engineers, but so far it is not widely used by the public for this purpose. Many of the algorithms in Maple were implemented because their application in control theory is known, but this functionality has not been compiled in a meaningful way for engineers. Over the past two years we have investigated what functionality control system engineers need and have attempted to fill in the gaps in Maple’s functionality to make it more useful to engineers. iv Acknowledgements I would like to thank my supervisor, Dr.
    [Show full text]