ADVANCE PROGRAM CALL FOR POSTERS REGISTRATION ISSAC '95 PLEASE NOTE: There is also a postscript version of this document in ftp.ccs.neu.edu:/pub/sigsam/issac95/advance-prog.ps . (Read the README file first.) There is a WEB version with the latest information at ftp://ftp.ccs.neu.edu/pub/sigsam/issac95/adv_prog/adv_prog.html . (Note that "ftp" is part of the WEB address.) There is also a re-mailer at issac95@ccs.neu.edu, which will return the latest version of this document. If you encounter any difficulties, please write to gene@ccs.neu.edu. The contents of this mailing are organized in the following order. Cover Symposium Timetable Invited Presentations Contributed Research Papers Tutorials System News Business Session Social Gatherings Montreal Accomodations Conference Organization Call for Posters Registration COVER International Symposium on Symbolic and Algebraic Computation July 10--12, 1995 (with tutorials and reception on July 9, 1995) Sponsored by ACM SIGSAM and SIGNUM at Concordia University, Montreal, Canada ISSAC'95 provides an opportunity to learn of new developments in all areas of symbolic mathematical computation. This symposium marks the twentieth in a series of conferences dating back to 1966. Activities of the conference include invited presentations, original research papers, tutorial courses, vendor exhibits and software demonstrations. In addition to the technical program, social events provide an opportunity to meet with colleagues on an informal basis. Topics of the meeting include: Algorithmic mathematics: Algebraic, symbolic, and symbolic--numeric algorithms in all areas of mathematics; Computer science: Theoretical and practical questions in symbolic mathematical computation, including computer algebra systems and problem solving environments, programming languages and libraries for symbolic computation, user interfaces, data structures, parallel computing, software architectures, concrete analysis and benchmarking, artificial intelligence techniques, automatic differentiation, and code generation; Applications:Problem treatments incorporating algebraic, symbolic or symbolic-numeric computation in an essential or novel way, including engineering, economics and finance, physical and biological sciences, computer science, logic, mathematics, statistics, and use in education. Individuals wishing to present very recent results should see the call for posters included with this program. Concordia University hosts ISSAC'95 at its Montreal city center campus. Limited low cost university accommodation is available, as well as near-by hotels. Montreal is a bilingual English-French island city, with good public transportation and access to international airports. Individuals or organizations wishing to make arrangements in connection with the symposium should contact the appropriate member of the conference committee. The most up-to-date information on this meeting is available electronically, through an automatic re-mailer issac95@ccs.neu.edu and the World Wide Web via file://ftp.ccs.neu.edu/pub/sigsam/html/issac.html SYMPOSIUM TIMETABLE Sunday, July 9 8:00 9:00 Tutorials registration 9:00 12:00 Morning Tutorials 12:00 5:00 Social: Axiom Open Forum 2:00 5:00 Afternoon Tutorials 5:00 7:00 Social: Waterloo Maple Software 7:00 8:00 Conference registration 8:00 11:00 Reception Monday, July 10 7:30 8:30 Conference registration 8:30 8:40 Opening 8:40 10:10 Contributed Papers: Differential Equations 10:40 12:10 Contributed Papers: Visualization 12:10 1:30 Lunch Break 1:30 2:30 Invited Presentation: R. Lopez 2:30 4:00 Contributed Papers: Algebraic Numbers 4:00 5:00 Poster Session I 5:00 7:00 Social: Wolfram Research Inc. 7:00 9:00 System News Tuesday, July 11 8:30 10:00 Contributed Papers: Algorithms I 10:30 12:00 Contributed Papers: Systems 12:00 1:30 Lunch Break 1:30 2:30 Invited Presentation: B. Sturmfels 2:30 4:00 Contributed Papers: Polynomial and Differential Algebra 4:00 5:00 Poster Session II 5:30 7:00 Business Session 7:30 10:00 Conference Banquet Wednesday, July 12 8:30 10:00 Contributed Papers: Seminumerical Methods 10:30 12:00 Contributed Papers: Greatest Common Divisors 12:00 1:30 Lunch Break 1:30 2:30 Invited Presentation: R. Constable 2:30 4:00 Contributed Papers: Groups 4:30 6:00 Contributed Papers: Algorithms II 6:00 6:10 Closing INVITED PRESENTATIONS Monday, July 10, 1:30--2:30 The Role of Computer Algebra in Undergraduate Education Robert J. Lopez Rose-Hulman Institute of Technology, Terre Haute IN, USA The ultimate CAS for the undergraduate classroom is a black box that simply, faithfully, errorlessly does any mathematics we now do ``by hand.'' Such a device can then be used to implement, explore, teach, and learn mathematics in math, science, and engineering classes. The perfect system does not yet exist, but using what is presently available, the classroom dynamic dramatically changes: less lecturing and detailing of manipulation, more conceptualizing and mathematical experimenting. Examples taken from my experiences teaching in computer-equipped classrooms illustrate the types of changes in curriculum and pedagogy that a CAS allows --- and even demands. Successes and some failures will be presented to create a balanced view of where we are and what we might yet achieve. Tuesday, July 11, 1:30--2:30 Polyhedral Methods for Solving Polynomial Equations Bernd Sturmfels University of California, Berkeley CA, USA A basic problem in computational algebra is to find all zeros of a sparse system of polynomial equations. The situation is relatively well understood for complex zeros: their expected number is the mixed volume of the given Newton polytopes. This theorem due to Bernstein is proved by an algorithm using toric deformations. Things are more difficult (and interesting) over the real numbers: Khovanskii has shown that the number of real roots is bounded by a function which is independent of the degree of the given equations. More precise upper bounds are stated in conjectures of Kouchnirenko and Itenberg-Roy. We discuss these results and conjectures, and we illustrate them with colorful polyhedral pictures. Wednesday, July 12, 1:30--2:30 An Experiment with Collaborative Mathematics Environments: Linking Nuprl and Weyl Robert L. Constable Cornell University, Ithaca NY, USA This lecture will report on what theorem provers and computer algebra systems say to each other. Nuprl is a proof development system based on type theory which can express constructive distinctions across the full range of mathematics. In particular it can define the domains of computer algebra systems like Axiom and Weyl which are also based on types. In our experimental links, Weyl performs symbolic computation for Nuprl which in turn carries out reasoning for Weyl. This talk explains what has been accomplished so far and what we hope to do next. RESEARCH PAPERS DIFFERENTIAL EQUATIONS Monday, July 10, 8:40--10:10 * Algorithmic Determination Of Structure Of Infinite Lie Pseudogroups Of Symmetries Of PDEs L. G. Lisle, G. J. Reid and A. Boulton * Programs for Applying Symmetries of PDEs Thomas Wolf * Symmetries of $2^{nd}$ and $2^{rd}$ Order ODE's Fritz Schwarz * The Symbolic Computation of Differential Invariants of Polynomial Vector Field Systems Using Trees M. J. Duffou and R. L. Grossman VISUALIZATION July 10, 10:40--12:10 * From Honest to Intelligent Plotting Ron Avitzur and Olaf Bachmann and Norbert Kajler * Simplification and Optimization Transformations of Chains of Recurrences Eugene V. Zima * A Hybrid Symbolic-Numerical Method for Tracing Surface-to-Surface Intersections Tra^n Quo^n Nam * Numeric-symbolic algorithms for evaluating one-dimensional algebraic sets Shankar Krishnan and Dinesh Manocha ALGEBRAIC NUMBERS July 10, 2:30--4:00 * Computations with relative extensions of number fields with an application to the construction of Hilbert class fields M. Daberkow and M. Pohst * On the Implementation of Dynamic Evaluation P. A. Broadbery, T. Go'mez-Di'az and S. M. Watt * Finding roots of unity among quotients of the roots of an integral polynomial Kazuhiro Yokoyama, Ziming Li and Istva'n Nemes * An algorithm for computing the Weierstrass normal form Mark van Hoeij ALGORITHMS I Tuesday, July 11, 8:30--10:00 * Algorithms for Computing Sparse Shifts for Multivariate Polynomials Dima Yu. Grigoriev and Lakshman Y. N. * A simplified method of recognizing zero among elementary constants Daniel Richardson * Fast Computation of the Smith Normal Form of an Integer Matrix Mark Giesbrecht * Preconditioning of Rectangular Polynomial Matrices for Efficient Hermite Normal Form Computation George Labahn and Arne Storjohann SYSTEMS July 11, 10:30--12:00 * STAR/MPI: Binding a Parallel Library to Interactive Symbolic Algebra Systems Gene Cooperman * Searching Techniques for Integral Tables T. H. Einwohner and R. J. Fateman * Mathematical Typesetting in MATHEMATICA Neil Soiffer * Theorems and Algorithms: An Interface between Isabelle and Maple Clemens Ballarin, Karsten Homann and Jacques Calmet POLYNOMIAL AND DIFFERENTIAL ALGEBRA July 11, 2:30--4:00 * Representation for the radical of a finitely generated differential ideal F. Boulier, D. Lazard, F. Ollivier and M. Petitot * Gro"bner Duality and Multiplicities in Polynomial System Solving Maria Grazia Marinari, Teo Mora and Hans Michael Mo"ller * Implicitization of parametric curves and surfaces by using symmetric functions L. Gonza'lez-Vega and G. Trujillo * Comparison of Various Multivariate Resultant Formulations Deepak Kapur and Tushar Saxena SEMINUMERICAL METHODS Wednesday, July 12, 8:30--10:00 * The Singular Value Decomposition for Approximate Polynomial Systems Robert M. Corless, Patrizia M. Gianni, Barry M. Trager and Stephen M. Watt * Numerical uniformization of hyperelliptic curves Klaus-Dieter Semmler and Mika Seppa"la" * The Analytic Continuation Process: From Computer Algebra To Numerical Claudine Chaffy * An algorithm for the reduction of linear DAE M. P. Que're' and G. Villard GREATEST COMMON DIVISORS July 12, 10:30--12:00 * On computing greater common divisor on polynomials given by black boxes for their evaluation A. Diaz and E. Kaltofen * Evaluation of the Heuristic Polynomial GCD Hsin-Chao (Phil) Liao and Richard J. Fateman * A solution to the extended gcd problem Bohdan S. Majewski and George Havas * An Analysis of Lehmer's Euclidean GCD Algorithm Jonathan Sorenson GROUPS July 12, 2:30--4:00 * Algorithms for Mixed Matrix/Permutation Representations Gene Cooperman, Larry Finkelstein and Michael Tselman * Fast Recognition of Nilpotent Permutation Groups Ferenc Ra'ko'czi * A Nearly Linear Algorithm for Construction and Conjugation of Sylow Subgroups in Small-Base Groups Prabhav Morje * On the Computation of Ordinary Irreducible Representations of Finite Groups Torsten Minkwitz ALGORITHMS II July 12, 4:30--6:00 * Rational solutions of linear difference and q-difference equations with polynomial coefficients S. A. Abramov * On Polynomial Solutions of Linear Operator Equations Sergei A. Abramov, Manuel Bronstein and Marko Petkovsek * A rational version of Moser's algorithm A. Barkatou * Indefinite sums of rational functions S. A. Abramov TUTORIALS Five tutorial courses on topics of current interest in symbolic computation and its applications will be given on Sunday, July 9th, by internationally renowned experts. They will provide an opportunity for scientists, engineers and students interested in the field and its diverse applications to acquire a first-hand knowledge of the state of the art. Each tutorial course will include a set of printed course notes for later reference. The tutorials will be organized in parallel sessions in the morning and in the afternoon, and it is possible to attend two tutorial courses at a reduced fee. Participation in tutorial courses is possible without registration for the ISSAC conference. Sunday, July 9, 9:00-12:00 Tutorial on Automatic Differentiation Andreas Griewank T. U. Dresden, Germany The tutorial will consist of an introduction, software presentations and case studies. The introduction (with on-line demonstrations using the package ADOL-C) will contain the basic principles and techniques of AD. To understand its mathematical aspect we will consider: composite functions as acyclic computational graphs, the application of the chain rule by node elimination, the concept of truncated taylor series arithmetic, the forward and the reverse mode of AD and the cheap gradient theorem. The other concern is the computer science aspect including two principal implementation schemes, operator overloading & source to source transformation, theoretical bounds for storage requirements & run time and strategies to prepare codes and overcome practical difficulties. The software presentations exhibit AMPL: AD within a modelling system, GRESS/ ADGEN: direct and adjoint code generator and MAPLE: AD within a CA system. We will conclude with three case studies: linear algebra, climate simulations and beam physics. Sunday, July 9, 9:00-12:00 Tutorial on Algorithmic Quantifier Elimination for Elementary Real Algebra Hoon Hong RISC, Johannes Kepler University, Linz, Austria The problem of quantifier elimination for the elementary real algebra is to devise an algorithm which, given a formula (made of integral polynomials, =, >, and, or, negate, forall, and exists), finds an equivalent formula without quantifiers. Note that the decision problem is a special case where the input formula does have free variables. Its importance stems from the fact that it is often the core of many problems arising in algorithmic mathematics, natural science, and engineering. Since Alfred Tarski (1930)'s first algorithm, various improved, new, and specialized algorithms have been devised with better computing times for large inputs, for small inputs or for special inputs. Currently computer implementations are applied to several problems from engineering and science. The content of the tutorial is as follows: (1) Survey on the known ideas and algorithms. (2) Computer demos on examples arising from engineering and science. (3) Suggestions on the future directions and research topics. Sunday, July 9, 9:00-12:00 Tutorial on Algorithmic Elimination Methods Deepak Kapur Institute for Programming and Logics, SUNY Albany, USA This tutorial will provide a gentle introduction to different methods for eliminating variables from a finite system of polynomials and for solving polynomial equations. Elimination methods have applications in many fields. The first part of the tutorial will discuss resultant-based methods investigated in the 19th century and early 20th century. The main idea is to generate from a system of nonlinear polynomial equations, possibly a larger system of independent polynomial equations. The larger system has as many equations as distinct terms in the polynomials. Each term is treated as an unknown and the theory of linear algebra can be applied. Three major resultant methods due to Euler, Bezout, Sylvester, Cayley, Dixon and Macaulay, and a sparse reformulation of Macaulay will be discussed and compared. In the second part, two other methods -- the Gro"bner basis method based on polynomial ideal theory and the characteristic set method based on algebraic geometry will be reviewed. The use of these methods for elimination and equation solving will be discussed. Examples from application domains such as computer vision, geometric reasoning and solid modeling will be used. Sunday, July 9, 2:00-5:00 Tutorial on Algorithmic Methods for finding real solutions of systems involving exponential and other elementary functions Daniel Richardson University of Bath, UK Considering the objects of elementary analysis through lazy eyes, we suppose that a point in $R^n$ is given by an initial good approximation together with an algorithm which produces a sequence of approximations which are increasingly good, and which converge to a limit. Also an elementary function, such as $e^x$ or $sin(x)$, is given by an initial approximating polynomial, together with an algorithm which produces a sequence of increasingly good approximating polynomials, which converge to a limit. From this point of view, we ask: to what extent is it possible to obtain exact information about such objects of elementary analysis which are defined as limits of approximations? To what extent do known algebraic techniques transfer? A good deal of progress has been made recently in this area. This tutorial will attempt to survey the situation. * Is accurate representation of transcendental functions possible in a computer? * Theoretical background. Undecidability results. Results of Khovanskii, Gabrielov, Van den Dries, Wilkie, MacIntyre, Vorobjov. * Stratification of Elementary Sets, using Wu's method * Schanuel's conjecture. The elementary numbers form a computable field, and the real elementary numbers form a computable real closed exponential field, unless Schanuel's conjecture is false. * Solving systems of equations. Pseudo derivatives, topological degree and recursive subdivision. Sunday, July 9, 2:00-5:00 Tutorial on Algorithmic Lie Theory for Solving ODE's Fritz Schwarz GMD, Institut SCAI, Sankt Augustin, Germany The theory developed by Sophus Lie in the second half of the last century is the most important algorithmic method for finding closed form solutions of differential equations. It is the purpose of this tutorial to provide a survey on Lie's theory with particular emphasis on algorithmic methods. The scope is limited to solving ordinary differential equations. A fair knowledge of analysis and some algebra should be sufficient to follow the tutorial. It is accompanied by a demo which illustrates the material presented by applying it to many examples. A partial list of topics to be covered is given subsequently. * Introduction: Motivation behind Lie's work. Relation to other approaches. * Finite groups of point transformations: One parameter groups. Groups with r parameters. Geometric properties of groups. The structure of groups. The finite groups of the plane. * Symmetries of differential equations: The determining system. Janet bases. How to find the symmetries. Solving and order equations. * Summary and further work: Relation of this theory to solving pde's. Complexity and implementation issues. Extension to higher order equations. SYSTEM NEWS On the evening of Monday, July 10, a special session will be held where the providers of some widely used systems describe their latest developments. AXIOM Release 2.0: Last autumn, NAG launched Axiom 2.0, a major development incorporating a revolutionary new library compiler, an interactive link to numerical algorithms from the NAG Fortran Library, as well as many algebraic enhancements. The compiler emphasises generality and efficiency, and has the unique ability to generate stand-alone code for use outside the Axiom environment. The NAG link allows external numerical routines to be called directly from within Axiom with the results being made available in the Axiom environment for further processing. DERIVE Version 3: Implicit plots, autoscaling, and trace-mode. Animated 3D-plots via hot-links to the AcroSpin program. Boolean simplification and truth tables. Subscripts, and optional degree-mode trigonometric functions. Extension of Taylor series to invert functions or solve algebraic as well as differential equations. Support for the HP-95, 100 and 200LX palmtop computers and Color printers. For information: swh@aloha.com, phone +1-808-734-5801, fax +1-808-735-1105 MACSYMA 2.0: Macsyma NOTEBOOKS combine graphical math display, text processing, editable graphics, hypertext links, navigator dialog. GRAPHICS: Animation, clipping, mouse query for coordinates. A typical 3D plot has over 200 attributes which can be edited with five custom dialogs. LINEAR ALGEBRA: 180 new commands, language extensions, a Matlab(tm)- to-Macsyma translator. SYMBOLIC MATHEMATICS: Better integration in many areas. Macsyma finds symmetries and solutions of PDEs, and writes vector and tensor PDEs in curvilinear coordinates. NUMERICAL ANALYSIS: Improved integration, solution of ODEs, least squares, statistics, linear algebra. Companion product PDEase(tm) solves PDEs with finite elements. MAPLE V Release 4: Shipping in the fall of 1995, this release will provide significant enhancements to all dimensions of Maple --- graphical user interface, plotting, symbolic computation, numeric computation, and the Maple language itself. One of the most important areas of improvement is in the graphical user interface for preparation of Mathematical documents. Release 4 includes an enhanced worksheet model with outlining controls, stylesheet-based document formatting and display facilities, and in-line display and manipulation of Maple graphics. MATHEMATICA: A major new version of Mathematica that has been under development for over three years is now in testing. New front end features include editable, typeset input and output, extensive hypertext electronic help, customizable and programmable user interface, and a new notebook file format compatible with layout languages such as TeX and html. Major new kernel functionality includes more powerful symbolic integration, an improved numerical differential equation solver, additional special functions, and faster, more compact overall performance. REDUCE 3.6: Version 3.6 of REDUCE is planned for release shortly. In addition to the correction of bugs and awkward features, and updates of most of the major application packages, this version includes, among many other new features: * a greatly improved pattern matching facility; * a definite integration capability; * a linear algebra package with matrix normal form algorithms, simplex etc. Full details will be available shortly on the REDUCE Home Page ( http://www.rrz.uni-koeln.de/REDUCE/). BUSINESS SESSION Tuesday July 11, 5:00 -- 5:45 p.m. SIGSAM Business Meeting This is the annual SIGSAM business meeting, open to the public and not restricted to SIGSAM members. The agenda may be obtained in advance from the SIGSAM Chair, kaltofen@cs.rpi.edu. Tuesday July 11, 5:45 -- 7:00 p.m. ISSAC Business Meeting This meeting is open to any registered participant of ISSAC'95. The status of ISSAC'96 will be reviewed and the site for ISSAC'97 will be decided. The ad hoc committee on the conduct of future ISSAC meetings will present its report and a vote will be taken on its proposals. Registered participants of prior ISSAC meetings may be able to vote electronically or by postal ballot on the committee's proposals. To obtain a copy of the report and proposals and determine whether you are eligible to vote, send an E-mail message to issacballot@ccs.neu.edu. SOCIAL GATHERINGS Sunday July 9, 12:00 -- 5:00 p.m. AXIOM Open Forum This event is an opportunity for ISSAC95 attendees to find out what's new in AXIOM, and interact with its developers from both NAG and IBM. There will be a series of demos from 12:00 until 2.00p.m., accompanied by a buffet lunch, followed by informal presentations describing the new AXIOM Library Compiler, the link to the NAG Library, user contributions to AXIOM etc. The afternoon session will provide further opportunities for discussions and demonstrations. There is no charge for the Open Forum and no need to book in advance; you are welcome to attend all or part of the event. For further details, contact NAG. Sunday July 9, 5:00 -- 7:00 p.m. Maple Social Waterloo Maple Software is pleased to be participating in ISSAC'95. You are invited to interact with world-wide Maple users and learn about new Maple developments at this social gathering. Visit the WMS exhibit to be eligible to win a free copy of Maple V! Attend the various program sessions to experience the power of Maple V and discover innovative techniques to increase your productivity. To obtain product information please E-mail info@maplesoft.com or WWW: http://www.maplesoft.com Sunday July 9, 8:00 -- 11:00 p.m. ISSAC'95 Conference Reception Monday July 10, 5:00 -- 7:00 p.m. Wolfram Research Inc. Wolfram Researh Inc. cordially invites you to a talk by Alexei Bocharov, followed by a reception. Dr. Alexei Bocharov will present several new algebraic computation features that are implemented in the forthcoming version of Mathematica, including algebraic numbers and algebraic root objects as well as new features in definite integration, enhancements to the Grobner basis function, and substantially improved symbolic and differential equation solving functions. Hors d'oeuvres and beverages will be served following the talk. Tuesday July 11, 7:30 -- 10:00 p.m. ISSAC'95 Conference Banquet MONTREAL Montreal is a picturesque city on an island in the middle of the Saint Lawrence river. Its mixture of French and English brings a particularly cosmopolitan and European air to the city. Some of its notable features are Mount Royal (with a spectacular view of the city), Vieux Montre'al (Old Montreal) and the port, the huge complex of underground downtown shopping malls, the extensive subway system, the spectacular diversity of excellent (yet reasonably-priced) cuisines, and the boutiques and night life along St-Denis (with a francophone flavor) or along Crescent St. (with an anglophone flavor). The underground city stretches over 18 miles of shop-lined pedestrian walkways linking major office towers, hotels and apartment blocks, department stores, restaurants and cafe's, subway stations and even rail and bus terminals. In fact, it's possible to live in the city below without ever having to face winter blizzards or summer heat waves. The International Jazz Festival (June 29--July 9) draws top artists and thousands of their fans for free outdoor concerts. It is followed by the Just for Laughs comedy fest (July 21--31). The adventuresome may wish to try a rafting excursion in the Lachine rapids, while those with tamer interests can visit the Montreal Muse'e des Beaux Arts, the Botanical Gardens or the Insectarium. For more information you may call or write: The Greater Montreal Convention and Tourism Bureau 1555 Peel Street, suite 600 Montreal, Quebec / CANADA H3A 1X6 Tel: +1 514-844-5400 or, in Canada, 1-800-363-7777 If time permits, one can also take a 2-1/2 hour side trip to Quebec City, the only walled city in North America. The carefully preserved architecture, mixed with the extensive set of boutiques, restaurants and night life, make it a tourist's paradise. Information on Montreal and Quebec City can be found on the Web http://www.cum.qc.ca/ http://www.city.net/countries/canada/quebec/montreal/ http://www.llc.org/web-quebec/eindex.html Air Travel: Montreal is served by two airports, Dorval and Mirabel. All international flights except those originating from USA arrive at Mirabel. Transportation from the airport: Shuttle buses run between the airports and downtown hotels departing from the airports approximately every 15 to 20 minutes. All shuttle buses go directly to Queen Elizabeth Hotel, which is situated in downtown Montreal. Once you are there, take a taxi to your hotel. Alternatively, while boarding the bus at the airport inform the driver that you have reservations at one of the hotels (Chateau Versaille and Le Centre Sheraton) and you will be taken directly to your hotel. Shuttle bus fares are $9.00 from Dorval and $15.00 from Mirabel. You may also go to your hotel from the airport by taxi. The cost from Dorval is $25.00 and from Mirabel approximately $50.00. Local Transportation: Montreal is well served by Metro (underground train service) and bus. The cost of one trip between any two points is $1.75. You may call +1 514-288-6287 for more information regarding public transportation in Montreal. ACCOMODATIONS Montreal has a wide range of hotels, from the very expensive to the more modestly priced. Very near the campus are L'Hotel de la Montagne (Phone: +1-514-288-5656) and Ritz-Carlton Hotel (Phone: +1-514-842-4212), two of the grandest hotels in Montreal costing about CAD 200 per night. On a more moderate note, we have preferential rates arranged at two downtown hotels: the Hotel Chateau Versailles and Hotel Travelodge. In addition, a block of rooms has been reserved for students at the McGill University residences. Details for each of these are provided below. For reservations please contact the hotel directly and mention ISSAC'95 to obtain the preferential room rates. Current ISSAC accomodation information and fax-able hotel reservation are available on the WEB page http://www.cs.concordia.ca/~faculty/gregb/issac95/local.html Hotel Chateau Versailles: The closest hotel to the campus of Concordia University is the Hotel Chateau Versailles which is a 3 minute walk from campus. The rooms are very comfortable and spacious; some are equipped to handle modems. The room rate includes continental breakfast. Reservations require a deposit for one night, guaranteed by a credit card. For cancellations before 6pm on the arrival date, the deposit will be refunded. The deposit will not be refunded for cancellations after 6pm on the arrival date. For reservations, please contact the Hotel Chateau Versailles directly. The block of rooms will be held for ISSAC'95 until June 26th, 1995 so make your bookings before then. Occupancy Room Rate per Night Single/Twin/Double CAD 85.00 + Tax (14%) Hotel Chateau Versailles Phone: +1-514-933-3611 Attention: Lisa Thornburn +1-800-361-7199 (Canada) 1659 Sherbrooke, West +1-800-361-3664 (US) Montreal, Quebec CANADA H3H 1E3 Fax: +1-514-933-6867 Hotel Travelodge: The Hotel Travelodge is situated downtown next to Chinatown, at the corner of Blvd Rene' Le'vesque and Clark St in Montreal. This is a 25 minute walk, or a 10 minute Metro ride, to campus. The rooms are functional and come with toilet, shower, TV, and coffee-making facilities. Breakfast is not included in the room rate. It is also possible to reserve rooms which may accomodate three or four people in bunk beds. You must arrange yourself for roommates to share these rooms. Reservations require a deposit for one night, guaranteed by a credit card. For cancellations before 6pm on the arrival date, the deposit will be refunded. The deposit will not be refunded for cancellations after 6pm on the arrival date. For reservations, please contact the Hotel Travelodge directly. The block of rooms will be held for ISSAC'95 until June 25th, 1995 so make your bookings before then. Occupancy Room Rate per Night Single/Twin/Double CAD 75.00 + Tax (14%) Triple CAD 82.00 + Tax Quadruple CAD 89.00 + Tax Hotel Travelodge Phone: +1-514-874-9090 Attention: Brigitte Verstrynge Fax: +1-514-874-0907 50 boulevard Rene'-Leve'sque Montreal, Quebec CANADA H2Z 1A2 McGill Student Residences: Dormitories of the Royal Victoria College are located at the corner of University and Sherbrooke Street. Each dormitory room accomodates one person, and a valid student ID is required to obtain the student rate. Toilet and bath/shower facilities are available on each floor, but not in the room. The dormitories are situated downtown next to the campus of McGill University and are a 15 minute walk from the campus of Concordia University. Reservations are confirmed upon receipt of a 36.75 CAD or 28.00 CAD deposit per person, applicable towards the residence fee. Cheque, money orders, and VISA or Mastercard are accepted. This deposit is nonrefundable should you cancel. Please make cheque payable to ``McGill University''. Check in hours for the Residences are 7:00 AM to 10:30 PM, weekdays, and 8:00 AM to 10:00 PM, weekends. Please note that arrangements will be made on an individual basis for those arriving outside of regular check in hours. Please be sure to state your expected arrival time. For reservations, please contact the McGill Student Residences directly. The block of rooms will be held for ISSAC'95 until June 10th, 1995 so make your booking before then.s Occupancy Room Rate per Night Single CAD 36.75 (Tax included) Student (with ID) CAD 28.00 (Tax included) McGill Summer Accommodations Phone: +1-514-398-6367 3935 University St. Fax: +1-514-398-6770 Montreal, Quebec CANADA H3A 2B4 Reserve@Residences.lan.mcgill.ca CONFERENCE ORGANIZATION Conference Committee: * Greg Butler, Registration Chair Concordia U. 1455 de Maisonneuve W Montreal PQ Canada H3G 1M8 gregb@cs.concordia.ca * Gene Cooperman, Publicity Chair College of CS Northeastern University Boston, MA 02115 USA gene@ccs.neu.edu * Richard Fateman, Program Committee Vice Chair CS Division, EECS University of California Berkeley, CA 94720 USA fateman@cs.berkeley.edu * David Jeffry, Exhibits Chair Dept Applied Math U Western Ontario London, Ont Canada N6A 5B7 djj@uwo.ca * Jeremy Johnson, Treasurer Dept of Math and CS Drexel University Philadelphia, PA 19104 USA jjohnson@mcs.drexel.edu * Ton Levelt, Proceedings Editor U. Nijmegen Toernooiveld 1 6525 ED Nijmegen The Netherlands ahml@sci.kun.nl * John McKay, Local Arrangements Chair Concordia U. 1455 de Maisonneuve W Montreal PQ Canada H3G 1M8 mckay@vax2.concordia.ca * Carlo Traverso, Program Committee Chair Dip. di Matematica U. Pisa via Buonarroti 2 I-56123 Pisa, Italy issac95@dm.unipi.it * Vilman Trevisan, Poster Sessions Chair U. FRGS Cx. Postal 15040 Porto Alegre, RS, 91509-900 Brazil trevisan@mat.ufrgs.br * Stephen Watt, General Chair IBM T.J. Watson Research Center Yorktown Heights, NY 10598 USA issac95@watson.ibm.com * Volker Weispfenning, Tutorials Chair Lehrstuhl für Mathematik U. Passau D-94030 Passau Germany weispfen@alice.fmi.uni-passau.de Program Committee: Christian Bischof Argonne National Lab, USA Manuel Bronstein ETH Zu"rich, Switzerland Kevin Broughan University of Waikato, New Zealand Richard Fateman University of California, Berkeley, USA Hoon Hong RISC-Linz, Austria Norbert Kajler UNSA, France and RIACA, Netherlands Edmund Lamagna University of Rhode Island, USA Francois Ollivier E'cole Polytechnique Palaiseau, France Tomas Recio Universidad de Cantabria, Spain Carlo Traverso Universita di Pisa, Italy Stephen Vavasis Cornell University, USA David Withoff Wolfram Research Inc, USA Poster Session Committee: Mike Dewar Numerical Algorithms Group Ltd, UK David Jacobs Clemson University, USA Vilmar Trevisan UFRGS, Brazil Ken Weber Kent State University, USA Kazuhiro Yokoyama Fujitsu Laboratories Ltd, Japan ISSAC'95 is sponsored by the ACM special interest groups for Symbolic and Algebraic Manipulation, SIGSAM, and for Numerical Mathematics, SIGNUM. The organizers of ISSAC'95 thank the following corporations for contributing to the support of the symposium: IBM T.J. Watson Research Center Numerical Algorithms Group (AXIOM) SoftWarehouse (DERIVE) Waterloo Maple Software (MAPLE) Wolfram Research (MATHEMATICA) CALL FOR POSTERS The Poster Session provides an informal vehicle to present very recent research developments, or experience with applications of computer algebra. The poster session is particularly important as a forum for results that are not yet complete, but which have a clear importance that would benefit from immediate and rapid dissemination. Proposed posters may be submitted either electronically or by mail as abstracts of 400 to 1200 words. E-mail submission is strongly preferred, addressed to the Poster Session Chair at issac95@mat.ufrgs.br. The preferred format is a LaTeX/TeX file, but Postscript or plain text format is acceptable. Articles submitted by regular mail must allow time for international postal service and should be addressed to the Poster Session Chair (see Conference Organization). Abstracts should be received no later than May 14, 1995; those received later may not receive full consideration. Please state the contact author's name, address and telephone number, as well as fax and E-mail if available. Abstracts will be reviewed by the poster session committee and, for abstracts received by May 14, notification will be sent by May 28, 1995. Production times do not allow posters to appear in the proceedings, but a separate summary of the posters will be made available at the meeting. ISSAC 95 REGISTRATION All prices in this form are quoted in Canadian dollars (CAD) and US dollars (USD). Cancellations received before June 1, 1995: 80% refund. Before June 20, 1995: 50% refund. Please note that accomodations must be booked separately, and participants are responsible for their own insurance coverage. REGISTRANT INFORMATION Name: Affiliation: Address: Tel No.: Fax No.: E-mail Address: CONFERENCE REGISTRATION The fee for the conference includes one copy of the proceedings, attendance at all conference sessions, conference dinner and refreshment breaks. For student registrants the fee does not include the conference dinner. Member prices are available to ACM, SIGSAM, or SIGNUM members. Please circle the appropriate fees: CATEGORY By June 1 After June 1 Student 80 (USD) 110 (CAD) 100 (USD) 140 (CAD) Member 280 (USD) 400 (CAD) 330 (USD) 470 (CAD) Non-Member 340 (USD) 485 (CAD) 390 (USD) 555 (CAD) ACM/SIGSAM/SIGNUM Membership No.: If you are not currently an ACM or SIGSAM or SIGNUM member you may join now. You will receive the reduced conference registration fee and receive member benefits for one year. If desired, please check the appropriate box: |_| ACM membership. 84 (USD) 120 (CAD) |_| SIGSAM membership. 44 (USD) 63 (CAD) |_| SIGNUM membership. 23 (USD) 33 (CAD) TUTORIALS REGISTRATION There will be two tutorial sessions held on Sunday July 9, 1995. Tutorial registration and conference registration are independent --- it is possible to attend one without the other, and to attend both requires paying both registratino fees. Please check the boxes for desired tutorials. Morning Session: one of |_| Griewank: Automatic Differentiation |_| Hong: Quantifier Elimination for Elementary Algebra |_| Kapur: Algorithmic Elimination Methods Afternoon Session one of |_| Richardson: Real Solutions of Systems Involving ... |_| Schwarz: Algorithmic Lie Theory for Solving ODE's Circle one number for the appropriate fee: CATEGORY Morning Afternoon Both Student 25 (USD) 35 (CAD) 25 (USD) 35 (CAD) 40 (USD) 55 (CAD) Regular 50 (USD) 70 (CAD) 50 (USD) 70 (CAD) 90 (USD) 130 (CAD) CONFERENCE DINNER The conference dinner will be held Tuesday evening, July 11, 1995 in Old Montreal. Please indicate whether you require extra tickets for the dinner. |_| Conference Dinner -- Price 45 (USD) 60 (CAD) Number of extra tickets ________ If you have special dietary needs, please contact the registration chair by E-mail. STUDENT CERTIFICATION I hereby certify that the applicant is a full-time student or teaching/research assistant. Name of College/University: __________________________________ Department Chair (signature): ________________________________ PAYMENT Please compute your total and indicate your payment method. Conference Registration _________________________________ ACM/SIGSAM/SIGNUM, if desired ___________________________ Tutorials Registration __________________________________ Extra dinner tickets ____________________________________ TOTAL ___________________________________________________ |_| I enclose a cheque/bankers draft (in Canadian dollars) made payable to ISSAC'95 |_| I enclose a cheque/bankers draft (in US dollars) made payable to ISSAC'95 |_| I have arranged for the fee to be paid in full (in US dollars) by bank transfer (net of bank charges) into the following account: Bank: Merrill Lynch 1 Mellon Bank Plaza Pittsburgh, PA 15258-0001 (USA) Merrill Lynch ABA routing no.: 043 000 261 Merrill Lynch Federal Funds Wire account no.: 101-1730 Account Name: ACM International Symposium on Symbolic and Algebraic Computation Account No.: 85207084 |_| Debit my MasterCard card with the sum of _______________ Signature ______________________________________________ Card Number ____________________________________________ Expiry Date ____________________________________________ |_| Debit my Visa card with the sum of Signature ______________________________________________ Card Number ____________________________________________ Expiry Date ____________________________________________ SUBMISSION The completed form should be sent to: ISSAC'95 Department of Computer Science Concordia University 1455 de Maisonneuve Blvd West Montreal, Quebec CANADA H3G 1M8 Fax: + 1 514 848 2830 E-mail: issac95@cs.concordia.ca Cheques must be sent by regular mail or express service. Payment by credit card can only be accepted by regular mail, express service, or fax.