DOCSLIB.ORG

Homage to André Aisenstadt

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Homage to André Aisenstadt A Word from the Director................................................................................................................................ 2 Presenting the CRM.......................................................................................................................................... 4 Personnel 2001-2002.......................................................................................................................................... 5 Scientific Personnel........................................................................................................................................... 6 Members 6 Postdoctoral Fellows 8 Visitors 10 Management..................................................................................................................................................... 12 Bureau de direction 12 Advisory Committee 12 Computer Facilities 13 Homage to André Aisenstadt........................................................................................................................ 14 Scientific Activities......................................................................................................................................... 16 Theme Year 2001-2002: Groups and Geometry 16 Aisenstadt Chair 24 General Program 2001-2002 26 CRM Prizes 31 National Program Committee 34 Members’ Seminars and Special Events 38 CRM-ISM Colloquium 44 Coming Activities ........................................................................................................................................... 45 Theme Year 2002-2003: Math in Computer Science 45 Theme Year 2003-2004: Geometric and Spectral Analysis 49 Theme Year 2004-2005: Mathematics of Complex Multiple-Scale Systems 52 Interdisciplinary and Industrial Program 54 General Program 56 CRM Collaborative Network ....................................................................................................................... 58 AARMS/ACSMA.............................................................................................................................................. 60 Industrial Collaborations ............................................................................................................................. 61 Awards, Distinctions and Landmarks........................................................................................................ 64 Research Laboratories.................................................................................................................................... 65 CICMA 65 CIRGET 67 LACIM 69 Mathematical Analysis Laboratory 71 Applied Mathematics Laboratory 73 Mathematical Physics Laboratory 74 PhysNum 76 Statistics Laboratory 78 Publications ..................................................................................................................................................... 80 Recent Titles 80 Previous Titles 81 Research Reports 84 Financial Report at 31 May 2002 ................................................................................................................. 87 Financial Statement 2001-2002 89 CRM Annual Report 2001 - 2002 1 A Word from the Director Science first. It was an sur le Temps Extrême (LUTE). This laboratory, exceptionally rich year. with an important infusion in cash, personnel The thematic program in and computer time from Environment Canada, Groups and Geometry will work not only in the forecasting of extreme began with a remarkably weather, but also on modelling its impacts, in vigorous three-week collaboration with the various ncm2 partners. A session in group theory first workshop is taking place in the fall of 2002 and low dimensional on extreme values, and is co-organized with the topology, with over one finance group. The year also saw the creation of hundred participants for a second spin-off company, in data-mining each of the three weeks. applied to insurance. The first, in imaging, won The workshops that followed were all great the Entrepreneurship prize of the École des successes, and I hesitate to name just a few, for Hautes Études Commerciales de Montréal. The fear of offending those left out; I will however CRM research group in imaging has continued thank in passing our colleagues in Kingston, building up a research network in brain- Eddy Campbell and David Wehlau, who put imaging. One of the group’s researchers, Jean- together a remarkable two-week session, with a Marc Lina, is now sharing his time with the large number of students and visitors. The Institut Universitaire de Gériatrie de Montréal, holders of the Aisenstadt Chair this year were and is now an associate researcher at INSERM three absolutely exceptional mathematicians: (France). This Montréal-Paris collaboration has Edward Frenkel, Laurent Lafforgue and George just been awarded an important grant from the Lusztig. Lafforgue went on to receive a Fields Ministère de la Recherche, de la Science et de la medal later in the year. Lafforgue and Frenkel Technologie. gave their lectures in tandem, and were accompanied by Robert Langlands, who also The development of science does rely on gave a series of talks. The year in all saw twenty continuous funding. This is an arduous or so lecture series, which had a considerable constraint and the year from this point of view impact (thanks once again to those who gave was exceptionally full. The CRM submitted last them). If one adds to this the seminars of the January a request for renewal to NSERC, as part various groups and laboratories attached to the of a reallocations process that included four CRM, the CRM-ISM Colloquium (my thanks to institutes and twenty or so grant selection the organizers, Dana Schlomiuk and Tadashi committees. It was a heavy task: choosing Tokieda), it all adds up to a rich scientific priorities, choosing programs, writing the atmosphere, unthinkable even ten years ago. proposal, organizing a site visit with over a hundred people to coordinate. Many of the CRM The 2001-2002 program was not even over yet researchers took part in the proceedings, and I when we started on the 2002-2003 program on thank them. The whole process was a great the Mathematics of Computer Science. The CRM success, with the CRM obtaining an 11% increase played host in May to two of the big conferences in funding, which puts it third in the in theoretical computer science, STOC and CCC. reallocations exercise and gives it the same There were a number of small satellite activities funding as the Fields Institute and PIMS. The organized around this, and in June, a workshop additional resources obtained will be used on random number generators, organized in mostly to increase funding of long-term visitors style by Pierre L’Écuyer. The summer also saw a and of postdoctoral fellows. school in quantum computing, directed by Gilles Brassard, with over eighty participants. On the provincial front, as these words are being written, the CRM has just submitted its As ever, the two industrial networks, MITACS application to FQRNT, the provincial research and ncm 2, had their share of events and agency, for increased funding. The exercise, if it developments. The main one was doubtless the is crowned with success, will fund a certain official opening on December 6, 2001, of the new number of laboratories associated to the CRM; it ncm2 laboratory, the Laboratoire Universitaire has already allowed the CRM to obtain 2 Annual Report 2000 - 2001 CRM A Word from the Director significant financial support from all the major large number of talented mathematicians that Québec universities, and this for the first time. are now in our universities, a large segment of them having just arrived. They will, I hope, have An additional satisfaction occurred in the the resources that they deserve. writing of the application, as I was listing the Jacques Hurtubise CRM Annual Report 2001 - 2002 3 Presenting the CRM The Centre de recherches mathématiques (CRM) project (Mathematics of Information was created in 1969 by the Université de Technology and Complex Systems Another). Montréal through a special grant from the example is the National Program National Research Council of Canada. It became Committee, which provides funding for off- an NSERC national research centre in 1984. It is site research activities. currently funded by NSERC (Natural Sciences This national mandate is complemented by, and and Engineering Research Council), by the indeed supported by, a long-standing vocation Government of Québec through the FQRNT of promoting research in the Montréal area. For (Fonds québécois de la recherche sur la nature et instance, les technologies), by the Université de Montréal, • the CRM supports, through partnership and by private donations. The mission of the agreements, a group of local researchers CRM is to do research in mathematics and chosen mainly from departments of closely related disciplines and to provide mathematics and statistics, but also leadership in the development of the computer science, physics, economics, mathematical sciences in Canada. engineering, etc.; The CRM carries on its mission and national • it organizes series of regular seminars and mandate in several ways: lecture courses on different areas of • it organizes a series of scientific events each mathematical sciences; year, around a given theme (distinguished • it sponsors joint activities with the ISM lecture series, workshops, conferences, (Institut des sciences mathématiques) summer schools, visitor programs, etc.); including the weekly
Load more

Recommended publications
  • Algorithmic System Design Under Consideration of Dynamic Processes
    Algorithmic System Design under Consideration of Dynamic Processes Vom Fachbereich Maschinenbau an der Technischen Universit¨atDarmstadt zur Erlangung des akademischen Grades eines Doktors der Ingenieurwissenschaften (Dr.-Ing.) genehmigte Dissertation vorgelegt von Dipl.-Phys. Lena Charlotte Altherr aus Karlsruhe Berichterstatter: Prof. Dr.-Ing. Peter F. Pelz Mitberichterstatter: Prof. Dr. rer. nat. Ulf Lorenz Tag der Einreichung: 19.04.2016 Tag der m¨undlichen Pr¨ufung: 24.05.2016 Darmstadt 2016 D 17 Vorwort des Herausgebers Kontext Die Produkt- und Systementwicklung hat die Aufgabe technische Systeme so zu gestalten, dass eine gewünschte Systemfunktion erfüllt wird. Mögliche System- funktionen sind z.B. Schwingungen zu dämpfen, Wasser in einem Siedlungsgebiet zu verteilen oder die Kühlung eines Rechenzentrums. Wir Ingenieure reduzieren dabei die Komplexität eines Systems, indem wir dieses gedanklich in überschaubare Baugruppen oder Komponenten zerlegen und diese für sich in Robustheit und Effizienz verbessern. In der Kriegsführung wurde dieses Prinzip bereits 500 v. Chr. als „Teile und herrsche Prinzip“ durch Meister Sun in seinem Buch „Die Kunst der Kriegsführung“ beschrieben. Das Denken in Schnitten ist wesentlich für das Verständnis von Systemen: „Das wichtigste Werkzeug des Ingenieurs ist die Schere“. Das Zusammenwirken der Komponenten führt anschließend zu der gewünschten Systemfunktion. Während die Funktion eines technischen Systems i.d.R. nicht verhan- delbar ist, ist jedoch verhandelbar mit welchem Aufwand diese erfüllt wird und mit welcher Verfügbarkeit sie gewährleistet wird. Aufwand und Verfügbarkeit sind dabei gegensätzlich. Der Aufwand bemisst z.B. die Emission von Kohlendioxid, den Energieverbrauch, den Materialverbrauch, … die „total cost of ownership“. Die Verfügbarkeit bemisst die Ausfallzeiten, Lebensdauer oder Laufleistung. Die Gesell- schaft stellt sich zunehmend die Frage, wie eine Funktion bei minimalem Aufwand und maximaler Verfügbarkeit realisiert werden kann.
    [Show full text]
  • 54 OP08 Abstracts
    54 OP08 Abstracts CP1 Dept. of Mathematics Improving Ultimate Convergence of An Aug- [email protected] mented Lagrangian Method Optimization methods that employ the classical Powell- CP1 Hestenes-Rockafellar Augmented Lagrangian are useful A Second-Derivative SQP Method for Noncon- tools for solving Nonlinear Programming problems. Their vex Optimization Problems with Inequality Con- reputation decreased in the last ten years due to the com- straints parative success of Interior-Point Newtonian algorithms, which are asymptotically faster. In the present research We consider a second-derivative 1 sequential quadratic a combination of both approaches is evaluated. The idea programming trust-region method for large-scale nonlin- is to produce a competitive method, being more robust ear non-convex optimization problems with inequality con- and efficient than its ”pure” counterparts for critical prob- straints. Trial steps are composed of two components; a lems. Moreover, an additional hybrid algorithm is defined, Cauchy globalization step and an SQP correction step. A in which the Interior Point method is replaced by the New- single linear artificial constraint is incorporated that en- tonian resolution of a KKT system identified by the Aug- sures non-accent in the SQP correction step, thus ”guiding” mented Lagrangian algorithm. the algorithm through areas of indefiniteness. A salient feature of our approach is feasibility of all subproblems. Ernesto G. Birgin IME-USP Daniel Robinson Department of Computer Science Oxford University [email protected]
    [Show full text]
  • Basic Polyhedral Theory 3
    BASIC POLYHEDRAL THEORY VOLKER KAIBEL A polyhedron is the intersection of finitely many affine halfspaces, where an affine halfspace is a set ≤ n H (a, β)= x Ê : a, x β { ∈ ≤ } n n n Ê Ê for some a Ê and β (here, a, x = j=1 ajxj denotes the standard scalar product on ). Thus, every∈ polyhedron is∈ the set ≤ n P (A, b)= x Ê : Ax b { ∈ ≤ } m×n of feasible solutions to a system Ax b of linear inequalities for some matrix A Ê and some m ≤ n ′ ′ ∈ Ê vector b Ê . Clearly, all sets x : Ax b, A x = b are polyhedra as well, as the system A′x = b∈′ of linear equations is equivalent{ ∈ the system≤ A′x }b′, A′x b′ of linear inequalities. A bounded polyhedron is called a polytope (where bounded≤ means− that≤ there − is a bound which no coordinate of any point in the polyhedron exceeds in absolute value). Polyhedra are of great importance for Operations Research, because they are not only the sets of feasible solutions to Linear Programs (LP), for which we have beautiful duality results and both practically and theoretically efficient algorithms, but even the solution of (Mixed) Integer Linear Pro- gramming (MILP) problems can be reduced to linear optimization problems over polyhedra. This relationship to a large extent forms the backbone of the extremely successful story of (Mixed) Integer Linear Programming and Combinatorial Optimization over the last few decades. In Section 1, we review those parts of the general theory of polyhedra that are most important with respect to optimization questions, while in Section 2 we treat concepts that are particularly relevant for Integer Programming.
    [Show full text]
  • Number 73 Fall 2018 Contents Bulletin Newsletter
    Canadian Applied and Industrial Mathematics Society Société canadienne de mathématiques appliquées et industrielles Number 73 Fall 2018 Contents Bulletin Newsletter Submissions Table of Contents Submissions and ideas for publication are Reports from the Society appreciated. They should be sent to the editor. President’s Report ................................................ 2 Board of Directors ................................................. 4 Email: [email protected] Tel: (519) 888 4567 ext. 34468 Minutes from 2018 AGM .................................... 8 Mail: Prof. Justin Wan Committee Members ......................................... 18 CAIMS•SCMAI Secretary Report on CAIMS 2018 ..................................... 19 School of Computer Science Society Updates University of Waterloo Waterloo, ON N2L 3G1 CAIMSSCMAI Awards ..................................... 20 2018 Election – Call for Nominations ........ 22 Advertising Rates CAIMSSCMAI Official Journal ...................... 22 Inserts and non-advertising submissions Math Biology Distinguished Lecture .......... 23 (including letters to the editor) should be negotiated with the Secretary. Inquiries News from the Math Institutes about deadlines, payment and acceptable Fields Institute ..................................................... 24 formats should be directed to the CRM .......................................................................... 27 Secretary. PIMS ......................................................................... 28 Publication Information General
    [Show full text]
  • 1. Introduction: Learning About Operations Research
    1. Introduction: Learning about Operations Research IRV LUSTIG: So hi, my name's Irv Lustig from Princeton Consultants and today, I'm privileged to interview George Nemhauser, who is currently a distinguished professor at the Georgia Institute of Technology. So thank you, George, for joining us today and let's get started. GEORGE NEMHAUSER: Oh, you're most welcome. I'm really looking forward to it. IRV LUSTIG: All right. So tell me, when did you first learn about operations research? GEORGE NEMHAUSER: So basically, I am a chemical engineer. And I think it was the summer between when I graduated with a Bachelor's degree in Chemical Engineering and the fall, when I was going to go off to graduate school at Northwestern for Chemical Engineering, I had a job with the research department of Allied Chemical. And there was a guy-- I think he was my supervisor who was working there-- who told me he was taking a part-time degree at Princeton and he was studying things like linear programming and game theory and I think maybe Kuhn, Tucker conditions, And he told me about this kind of stuff and I thought, wow, this is really interesting stuff, much more interesting than what I'm doing in chemical engineering. So when I got to Northwestern, as a first-year graduate student in Chemical Engineering, I had one elective course. And I looked and there was this new course called Operations Research and it included linear programming and game theory and stuff like that. I said, that's it.
    [Show full text]
  • N Rapid Development of an Open-Source Minlp Solver With
    75 o N O PTIMA Mathematical Programming Society Newsletter DECEMBER 2007 Rapid Development of an Open-source Minlp Solver with COIN-OR Pierre Bonami, John J. Forrest, Jon Lee and Andreas Wächter Abstract • Csdp, Dfo, Ipopt, LaGO, and Svm- QP are solvers for different types of We describe the rapid development of Nonlinear Optimization (semidefinite, Bonmin (Basic Open-source Nonlinear derivative-free, general large-scale Mixed INteger programming) using the interior point, global optimization, QP community and components of COIN- solver for support vector machines) OR (COmputational INfrastructure • CoinMP, FlopC++, GAMSlinks, for Operations Research). NLPAPI, Osi, OS and Smi are problem 1. Introduction modeling and interface tools. Even more, COIN-OR has become the As famous examples like Linux have platform that facilitates the collaboration proven, open-source communities of optimization researchers to start entirely can produce rapidly-developing high- new projects, exploring and developing new quality software, often competitive with algorithmic ideas, by providing both a sound expensive commercial solutions. COIN- software basis that can be re-used, as well as OR (COmputational INfrastructure the technical forum to coordinate the effort. for Operations Research), originally In order to clarify a common founded by IBM in 2000 and a non-profit misconception, we want to emphasize that foundation since 2004, provides such the term “open source” does not simply refer a platform for us optimization folks. to software that is made available to some Since its conception, a number of users in source-code format. According optimization-algorithm implementations to the definition put forth by the non- and related software projects have been profit corporation Open Source Initiative contributed to COIN-OR.
    [Show full text]
  • Le Bulletin Automne/Fall 2012 — Volume 18, No 2 — Le Centre De Recherches Mathématiques
    C CENTRE R DE RECHERCHES M MATHÉMATIQUES Le Bulletin Automne/Fall 2012 — Volume 18, No 2 — Le Centre de recherches mathématiques Geometric Analysis and Spectral Theory Aisenstadt Chairs The Aisenstadt Chair allows us to welcome in each of the thematic programs, two or three world-famous mathematicians for a one-week to a one-semester stay. The recipients of the chair give a series of conferences on set subjects, chosen because of their relevance and impact, within the thematic program, the first of which, in compliance to the donor André Aisenstadt’s wish, must be accessible to a large public. Scientific activities related to the semester “Geometric Analysis and Spectral Theory” included three Aisenstadt lecture series, by R. Schoen, L. Erdős and E. Lindenstrauss, described below. Elon Lindenstrauss the classical dynamics is uniformly hyperbolic, hence “chaotic,” the eigenfunctions of the Laplacian should become equidistributed in the semiclassical limit. In the first lecture titled “Entropy and Quantum Unique Ergodic- ity,” Professor Lindenstrauss gave an overview of ergodic flows, Kol- mogorov – Sinai entropy of ergodic measures, Ledrappier – Young entropy formula, and Bowen – Margulis theorem on equidistribution of periodic orbits. He then reviewed Shnirelman’s Quantum Ergod- icity theorem, Quantum Unique Ergodicity conjecture, and discussed recent results due to Anantharaman, Nonnenmacher and Koch that hold for general negatively curved surfaces. The second and third lectures were devoted to Quantum Unique Ergodicity on finite area arithmetic hyperbolic surfaces. Such sur- faces possess a lot of symmetry, provided by the Hecke operators. Joint eigenfunctions of the Laplacian and those operators are called Hecke – Maass automorphic forms.
    [Show full text]
  • Branch-And-Bound Strategies for Dynamic Programming
    LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY C7. WORKING PAPER ALFRED P. SLOAN SCHOOL OF MANAGEMENT BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC PROGRAMMING Thomas L. Morin* and Roy E. Marsten** WP 750-74ooREVISED May 1975 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 50 MEMORIAL DRIVE CAMBRIDGE, MASSACHUSETTS 02139 BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC PROGRAMMING Thomas L. Morin* and Roy E. Mar St en** WP 750-74floREVISED May 1975 *Northwestern University, Evanston, Illinois **Massachusetts Institute of Technology Alfred P. Sloan School of Management, Cambridge, Massachusetts ABSTRACT This paper shows how branch -and -bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming cjriteria are used to identify and to eliminate states whose corresponding subpolicies could not lead to optimal policies. The general dynamic programming/branch- and-bound approach is applied to the traveling -salesman problem and the nonlinear knapsack problem. The reported computational experience de- monstrates the dramatic savings in both computer storage and computa- tional requirements which were effected utilizing the hybrid approach. Consider the following functional equation of dynamic programming for additive costs: = {TT(y',d) (y = (P. - f(y) min + f ') lT(y ' ,d) y] , y € y.) (1) d € D with the boundary condition f(yo) = ko (2) in which, Q is the finite nonempty state space; y- € fi is the initial state; d € D is a decision, where D is the finite nonempty set of decisions; T: n X D — n is the transition mapping, where T(y',d) is the state that is tt; -• reached when decision d is applied at state y ; Q x D IR is the cost function, where TT(y',d) is the incremental cost that is incurred when de- cision d is applied at state y'; k_ 6 IR is the initial cost incurred in the initial state y_; and in (2) we make the convenient but unnecessary assump- tion that return to the initial state is not possible.
    [Show full text]
  • A New Column for Optima Structure Prediction and Global Optimization
    76 o N O PTIMA Mathematical Programming Society Newsletter MARCH 2008 Structure Prediction and A new column Global Optimization for Optima by Alberto Caprara Marco Locatelli Andrea Lodi Dip. Informatica, Univ. di Torino (Italy) Katya Scheinberg Fabio Schoen Dip. Sistemi e Informatica, Univ. di Firenze (Italy) This is the first issue of 2008 and it is a very dense one with a Scientific February 26, 2008 contribution on computational biology, some announcements, reports of “Every attempt to employ mathematical methods in the study of chemical conferences and events, the MPS Chairs questions must be considered profoundly irrational and contrary to the spirit in chemistry. If mathematical analysis should ever hold a prominent place Column. Thus, the extra space is limited in chemistry — an aberration which is happily almost impossible — it but we like to use few additional lines would occasion a rapid and widespread degeneration of that science.” for introducing a new feature we are — Auguste Comte particularly happy with. Starting with Cours de philosophie positive issue 76 there will be a Discussion Column whose content is tightly related “It is not yet clear whether optimization is indeed useful for biology — surely biology has been very useful for optimization” to the Scientific contribution, with ­ — Alberto Caprara a purpose of making every issue of private communication Optima recognizable through a special topic. The Discussion Column will take the form of a comment on the Scientific 1 Introduction contribution from some experts in Many new problem domains arose from the study of biological and the field other than the authors or chemical systems and several mathematical programming models an interview/discussion of a couple as well as algorithms have been developed.
    [Show full text]
  • Mathematical Programming Society Newsletter
    69 o N O PTIMA Mathematical Programming Society Newsletter JANUARY2003 69 Primal Integer Programming 2 mindsharpener 8 gallimaufry 10 OPTIMA69 JANUARY 2003 PAGE 2 Primal Integer Programming Robert Weismantel Faculty of Mathematics, University of Magdeburg Universitatsplatz 2, D-39106 Magdeburg, Germany [email protected] September 17, 2002 Primal integer programming is an area of Let us begin by recalling that all the problem specific cuts such as facet-defining cuts discrete optimization that -- in a broad sense -- algorithmic schemes applied to integer for the TSP in [18]. To the best of our includes the theory and algorithms related to programming problems without a-priori knowledge, a method of this type for Integer augmenting feasible integer solutions or knowledge about the structure of the side Programming has first been suggested by Ben- verifying optimality of feasible integer points. constraints resort to the power of linear Israel and Charnes [3]. They employed the fact This theory naturally provides an algorithmic programming duality. that for any feasible solution of an integer scheme that one might regard as a generic form Dual type algorithms start solving a linear program optimality can be proven by solving a of a primal integer programming algorithm: programming relaxation of the problem, subproblem arising from the non-basic columns First detect an integer point in a given domain typically with the dual simplex method. In the of a primal feasible simplex tableau. Various of discrete points. Then verify whether this course of the algorithm one maintains as an specializations and variants of a primal cutting point is an optimal solution with respect to a invariant both primal and dual feasibility of the plane algorithm were later given by Young [21, specific objective function, and if not, find solution of the relaxation.
    [Show full text]
  • Name School Year Appointment and Honors Faculty at Harvard 1943-1985; Member of American Academy of Arts and Sciences and the National Academy of Science
    Name School Year Appointment and Honors Faculty at Harvard 1943-1985; Member of American Academy of Arts and Sciences and the National Academy of Science. Died Rice 1938 George W. Mackey March 15, 2006. Harvard University 1941-1944; Columbia University 1944-1945; University of Chicago 1945-1984; Director of MSRI 1984- 1992; University of California at Berkeley. Member of National Academy of Sciences and American Academy of Arts and Toronto 1938 Irving Kaplansky Sciences; 1989 AMS Steele Prize for cumulative influence; President of AMS 1985-1986; Member of National Academy of Sciences and American Academy of Arts and Sciences. Died June 25, 2006 College of St. Michael J. Norris 1938 Case Western Reserve, Sandia Laboratories Thomas Fort Hays Kansas Robert W. Gibson 1938 State Bernard Sherman Brooklyn College 1938, 1939 University of New Mexico Abraham Hillman Brooklyn College 1939 Professor at New Mexico State University (retired) Albert Einstein Award 1954; Lawrence Award 1962; Nobel Prize in Physics 1965] ; Member of National Academy of Sciences ; MIT 1939 Richard P. Feynman Appeared on US postage stamp: National Medal of Science 1979; Died February 15, 1988. University of Michigan 1948-1950 Uinversity of California at Berkeley Director of Scripps Institute of Oceanography, UC-San City College of NY 1939 William Nierenberg Diego 1965-1986 Died in 2000 http://content.cdlib.org/view?docId=tf8k4009q3&chunk.id=bioghist-1.8.3 Edward L. Kaplan Carnegie Tech 1939, 1940, 1941 University of Oregon John Cotton Maynard Toronto 1940 Actuary Robert Maughan Snow George Washington 1940 Department of Transportation W. J. R. Crosby Toronto 1940 Assoc.
    [Show full text]
  • Twenty-Eighth Annual Report of The
    National Science Foundation Twenty-Eighth Annual Report for Fiscal Year 1978 For sale by the Superintendent of Documents, U.S. Government Printing Office Washington, D.C. 20402 - Price $3.25 Stock Number 038-000-00407-7 Letter of Transmittal Washington, D.C. DEAR MR. PRESIDENT: I have the honor to transmit herewith the Annual Report for Fiscal Year 1978 of the National Science Foundation for submission to the Congress as required by the National Science Foundation Act of 1950. Respectfully, Richard C. Atkinson Director, National Science foundation The Honorable The President of ihe United Slates Contents Page Director's Statement vii Mathematical and Physical Sciences, and Engineering 1 Physics 2 Chemistry 6 Mathematical and Computer Sciences 10 Engineering 16 Materials Research 21 Astronomical, Atmospheric, Earth, and Ocean Sciences 29 Astronomy 31 Atmospheric Sciences 39 Earth Sciences 45 Ocean Sciences 51 Polar Programs 56 Biological, Behavioral, and Social Sciences 61 Physiology, Cellular, and Molecular Biology 62 Behavioral and Neural Sciences 67 Environmental Biology 69 Social Sciences 73 Science Education '77 Science Education Resources Improvement 77 Science Education Development and Research 81 Scientific Personnel Improvement 86 Science and Society 91 Applied Science and Research Applications 97 Problem Analysis 98 Integrated Basic Research 98 Applied Research 99 Problem-Focused Research Applications 101 Intergovernmental Science and Public Technology 105 Scientific, Technological, and International Affairs 109 Policy Research and Analysis 110 Science Resources Studies 112 NSF Planning and Evaluation 115 Information Science and Technology 116 International Programs , 118 Appendices A. National Science Board, NSF Staff, Advisory Committees and Panels 121 B. Patents and Inventions Resulting from Activities Supported by the National Science Foundation 138 C.
    [Show full text]