IPNet Digest Volume 1, Number 03 February 17, 1994 Today's Editor: Patricia K. Lamm Michigan State University Today's Topics: IPNet On-Line Bibliography NSF Undergraduate Research Program in Inverse Problems International Conference, European Consortium for Mathematics in Industry Table of Contents: Math of Control, Signals, and Systems Table of Contents: Computational and Applied Mathematics (Matem Aplicada e Computacional) Table of Contents: SIAM J. Computing Submissions for IPNet Digest: Mail to ipnet-digest@math.msu.edu Information about IPNet: Mail to ipnet-request@math.msu.edu ------------------------------ From: IPNet Subject: bibliography Date: Thu, 17 Feb 1994 We are in the process of establishing an on-line bibliography database for the IPNet, available via e-mail to the IPNet, as well as gopher and anonymous ftp. Optimally, the bibliography files will be cross-referenced by subject area, such as: General theory of linear ill-posed problems General theory of nonlinear ill-posed problems Inverse scattering problems Inverse heat conduction problems and so on. Before setting up the database, it would be helpful to receive suggestions of subject areas that might be included. Please send any COMMENTS and SUGGESTIONS regarding the bibliography database to: ipnet-bib@math.msu.edu Announcements will be made at a later date regarding the submission of bibliography files -- please do not send any bibliography files at this time. ------------------------------ From: Edward Curtis Subject: NSF Undergraduate Research Program in Inverse Problems Date: Thu, 10 Feb 1994 Summer Research for Undergraduates Department of Mathematics University of Washington Seattle, Washington 98195 The Department of Mathematics at the University of Washington will offer a summer program to introduce undergraduates to research in mathematics. This program is sponsored by the National Science Foundation under a Research Experiences For Undergraduates (REU) grant. The program will run from June 20, 1994 to August 12, 1994. At the University of Washington REU site, students will investigate inverse problems which arise in partial differential equations and discrete problems related to them. Briefly stated, our problem is that of determining the conductivity inside a region from measurements of currents and potentials on the boundary. The students will be introduced to various forms of this problem, through lectures and reading. They will also be given an introduction to some of the possible numerical techniques for solving these problems. The students will become acquainted with the computing equipment and software which is available for work on these problems and will use these tools to investigate methods of solution. They will work in small teams in consultation with the faculty members. This program is intended for highly motivated students, who are United States citizens and who will have completed their junior year by Spring, 1994. The following preparation is considered essential for admission to this program: 1. Linear algebra (including eigenvalues and eigenvectors) 2. Advanced (multivariable) Calculus 3. Differential equations (at the level of Boyce and DiPrima) 4. First year Physics 5. Experience using Fortran Admission is competitive and will be based on motivation, demonstrated ability in classwork, and on letters of recommendation. Students admitted to this program will be given a stipend of $2500 out of which they will have to pay approximately $1200 for tuition, room, and board. There may also be a small allowance for travel depending on distance from Seattle. It is anticipated that this will be an intense program, and students should not enroll in other courses or have any part-time jobs during the duration of this program. On campus housing will be arranged for those that desire it. Students should not apply for admission to the University of Washington admissions office directly, but should send a completed application form to James A. Morrow at the Department of Mathematics. Deadline for applications is April 1, 1994. For application and/or additional information call one of the following: Ed Curtis 206-543-1945 email: curtis@math.washington.edu Jim Morrow 206-543-1161 email: morrow@math.washington.edu Brooke Miller 206-543-6830 email: miller@math.washington.edu ------------------------------ From: "PROF.HEINZ W. ENGL" Subject: European Consortium for Mathematics in Industry Date: Tue, 08 Feb 1994 ECMI 94 The European Consortium for Mathematics in Industry (ECMI) holds its 8th International Conference at the University of Kaiserslautern, Germany, between September 6 and 10, 1994 (in cooperation with the German Mathematical Union, DMV). The objective of the conference is to provide a forum for the presentation of work on the applications of mathematics to industrial problems. It will provide a forum for academics and industrialists to meet and discuss mathematical problems of mutual interest. It should also give advanced students a first-hand impression of the challenges and opportunities for mathematicians in European industry. The scientific program will focus mainly on seven topics, namely mathematical methods in - aerospace industry - automotive industry - chemical industry - chip production - construction industry - finance - metallurgic processes. The core of each topic is a special session consisting of one invited lecture and four selected lectures; contributed talks related to these topics will be placed on the afternoon following the respective special session. Contributed papers and minisymposia in other areas of industrial mathematics are also welcome. If interested, please request registration material from the chairman of the organizing committee Prof.Helmut Neunzert Fachbereich Mathematik Universitaet POBox 3049 D-67653 Kaiserslautern, Germany Fax:+49-631-2053052, E-Mail: ecmi94@mathematik.uni-kl.de The deadline for the submission of abstracts is April 10. Prof.Heinz W.Engl, Linz, Austria President of ECMI ------------------------------ From: sontag@control.rutgers.edu (Eduardo Sontag) Subject: TOC, Math of Control, Signals, and Systems Date: Mon, 7 Feb 1994 MATH OF CONTROL, SIGNALS, AND SYSTEMS TABLE OF CONTENTS, Vol. 6, No. 1 Svatopluk Poljak and Jiri Rohn, Checking robust nonsingularity is NP-complete, pp. 1-9. B.D.O. Anderson and M. Deistler, Identification of Dynamic Systems from Noisy Data: The Case m = n-1, pp.10-29. L. Gurvits, L. Rodman, T. Shalom, Controllability by completions of partial upper triangular matrices, pp. 30-40. Luiz A.B. San Martin, Invariant control sets on flag manifolds, pp. 41-61. A. Le Breton and Dinh Tuan Pham, Maximum Likelihood Estimation for Continuous Time Autoregressive Model by Relaxation on Residual Variances Ratio Parameters, pp. 62-75. Christiaan Heij, Identification of non-controllable systems from impulse response measurements, pp. 76-97. TABLE OF CONTENTS, Vol. 6, No. 2 Arkadii S. Nemirovskii, Several NP-hard problems arising in robust stability analysis, pp. 99-105. J-B. Pomet, R.M. Hirschorn, and W.A. Cebuhar, Dynamic ouput feedback regulation for a class of nonlinear systems, pp. 106-124. Hirosi Sugiyama, A Sampling Theorem with Equally-Spaced Sampling Points on the Negative Time Axis, pp. 125-134. Vincent Blondel and M. Gevers, The simultaneous stabilizability question of three linear systems is undecidable, pp. 135-145. Andrea Baccioti and Paolo Boieri, Linear stabilizability of planar nonlinear systems, pp. 146-165. Y. Kannai and G. Weiss, Approximating signals by fast impulse sampling, pp. 166-179. Richard Vinter and J. Kotsiopoulus, Dynamic programming for free time problems with endpoint constraints, pp. 180-193. ------------------------------ From: demoura@lmgc.univ-montp2.fr (Carlos DEMOURA LMGC meca) Subject: Contents of COMP APPLIED MATH (Matem Aplicada e Computacional) Date: Fri, 4 Feb 1994 Computational and Applied Mathematics (Matematica Aplicada e Computacional) Edited by: SBMAC - Brazilian Soc. for Comp. and Appl. Mathematics (Rio) Birkhauser Verlag (Boston) Editors: J. Douglas, Jr. (Purdue, W. Laffayette), C.S. Kubrusly (LNCC+PUC-RJ,Rio) and C.A. de Moura (LNCC, Rio) Assoc. Editors: L.A. Medeiros (UFRJ, Rio), J.P. Paes-Leme (PUC-RJ+UERJ, Rio), G. Perla-Menzala (LNNC+UFRJ, Rio) Vol.12 N.2 (1993) - J.M. Martinez, On the convergence of the column-updating method - P. Gauzellino & J.E. Santos Numerical methods for wave propagation in elastic and anelastic media - G. Aimez & P-A. Gremaud On a penalty method for the Navier-Stokes problem in regions with moving boundaries. - J.L. Menaldi & D.A. Tarzia Generalized Lame-Clapeyron solution for a one-phase sourse Stefan problem - L. Nachbin Suplattices associated with convex sets, convex cones and affine spaces - A.L. Iusem & M. Teboulle On the convergence rate of entropic proximal optimization methods Vol.12 N.3 (1993) - J. Baumeister & E.R.von Stockert On a integral equation related to an inverse problem in magnetocardiography - J. Douglas Jr. & J. Wang A new family of mixed finite element spaces over rectangles - J.M. Stern & S.A Vavasis Active set methods for problems in column block angular form - W.C. Connet, WL Golik & A.L. Schwartz, A superconvergent scheme on irregular grids for systems of two-point boundary value problems ------------------------------ From: tate@siam.org Subject: Table of Contents, SIAM J. Computing, June 1993, vol 23 no.3 Date: Tue, 15 Feb 1994 CONTENTS Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima Omer Berkman, Joseph Jaja, Sridhar Krishnamurthy, Ramakrishna Thurimella, and Uz Vishkin Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem With Applications to Routing and Finding Sparse Cuts Philip Klein, Serge Plotkin, Clifford Stein, and Eva Tardos The Extended Low Hierarchy is an Infinite Hierarchy Ming-Jye Sheu and Timothy J. Long Complexity of Network Reliability and Optimal Resource Placement Problems Donald B. Johnson and Larry Raab Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs Jitender S. Deogun and George Steiner Packet Transmission in a Noisy-Channel Ring Network Victor Pestien, S. Ramakrishnan, and Dilip Sarkar Subquadratic Simulations of Balanced Formulae by Branching Programs Jin-Yi Cai and Richard J. Lipton Linear Time Algorithms and NP-Complete Problems Etienne Grandjean Digital Search Trees Again Revisited: The Internal Path Length Perspective Peter Kirschenhofer, Helmut Prodiner, and Wojciech Szpankowski Improved Approximation Algorithms for Shop Scheduling Problems David B. Shmoys, Clifford Stein, and Joel Wein Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications John H. Reif and Sandeep Sen Communication-Space Tradeoffs for Unrestricted Protocols Paul Beame, Martin Tompa, and Peiyuan Yan A New Insight into the Coffman-Graham Algorithm Bertrand Braschi and Denis Trystram ------- end -------