Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben

1994 | Buch

Welcome Kapitel lesen Erstes Kapitel lesen

Studies in Computer Science

In Honor of Samuel D. Conte

herausgegeben von: John Rice, Richard A. DeMillo

Verlag: Springer US

Buchreihe : Software Science and Engineering

Enthalten in: Professional Book Archive

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Über dieses Buch

This book is the proceedings ofa conference held November 1-3, 1989, to honor Samuel D. Conte for his many contributions to computer sci­ ences at Purdue University and to the profession as a whole. The com­ puter sciences program reflected the breadth of Conte's interests and ac­ complishments; there were tributes to Conte, perspectives on computer science itself, and research papers. The first part of these proceedings chronicles the career and contri­ butions; much of it is based on Conte's remarks made at the conference banquet. The second part of the proceedings starts with one vision of the future of computer sciences given in Peter Denning's keynote address. Historical accounts of building successful educational programs in com­ puter sciences follow. The third part consists of seven research contribu­ tions, primarily from past or present colleagues. These include Conte's numerical analysis, computational geometry, and discussions of software engineering. The conference was organized by the Purdue University Department of Computer Sciences and the Software Engineering Research Center at Purdue. Both of these organizations were founded by Conte, so is fitting for them to recognize their founder's achievements in such a con­ crete way.

Inhaltsverzeichnis

Frontmatter

Samuel D. Conte

Frontmatter
Welcome
Abstract
I want to start off with some material that we received today from people at TRW Corporation. At lunch time, where there were many fewer people, Rich read the official communications from them, but they also sent along a number of personal messages from former colleagues and students at TRW Corporation. For those of you who are not aware of it, Sam was at a predecessor of TRW before he came to Purdue in 1962. I think it was Aerospace Corporation at that time. Let me read a few of these.
John R. Rice
Introduction
Abstract
I’ve been given the pleasant task of introducing tonight’s speaker. One of the clichés that is often used by people who have been asked to introduce a speaker, especially if the person is lazy, is the statement describing the speaker as someone who needs no introduction. That statement is valid to varying degrees, depending of course on the speaker and the audience. It is certainly true tonight, given the reputation of the speaker and this gathering of friends.
Felix Haas
Address to Guests
Abstract
First of all I want to express my deep appreciation to all of you former students, faculty, colleagues, and friends for attending this symposium. I want to especially thank those of you who contributed invited papers, particularly David Young, who worked with me at Aberdeen Proving Grounds in 1951 and later at TRW in California; Carl deBoor, whom I recruited as a faculty member in 1966 and who later coauthored with me a best selling textbook in numerical analysis; Peter Denning, who joined the department in 1972 and later became head of the department; and finally I owe a special thanks to John Rice both for his outstanding contributions to the computer science department as a faculty member and department head and for conceiving and organizing this symposium.
Samuel D. Conte
Keynote Address Worldnet
Abstract
I chose for my topic “worldnet.” The phenomenon I call worldnet is closely wrapped up with the development of computer science as a discipline. We’re celebrating here today the birth of computer science as a discipline with the first department in the country for granting Ph.Ds right here at Purdue. Many of the results of the research of this discipline have found their way into practice over the years and are coming together now in this international milieu of networking.
Peter J. Denning

Computer Science: Past and Future

Frontmatter
1. The Origins of Computing and Computer Science at Purdue University
Abstract
In 1947 Dr. Carl F. Kossack joined the mathematics department at Purdue University. He brought with him several research projects that required extensive computation. He had friends at IBM who offered to donate some IBM punch card equipment, and Kossack set up a statistical laboratory in one of the temporary buildings at Purdue. By 1952 the activities of the statistical laboratory had grown considerably, and a decision was made to install an IBM card-programmed calculator (CPC). The CPC was not a stored program computer, but it was a general-purpose programmed computer, and the laboratory needed someone skilled in the art of computing. Kossack was authorized to hire an assistant professor who would teach part-time in the mathematics department and also be in charge of the computational division of the statistical laboratory.
Saul Rosent, John R. Rice
2. History of the Computer Sciences Department at Purdue University
Abstract
The previous chapter1 describes how the first Department of Computer Sciences in the United States was established at Purdue University in October 1962. This chapter describes how the department found its identity and matured into one of the strong departments at Purdue and in the nation. There are three natural phases to this development. In the 1960s the effort was to define courses, degree programs, and indirectly the field itself. The 1970s saw the department’s maturation and growth into a typical university department. The 1980s started with a series of crises, some nationwide and some internal to Purdue, which eventually gave the department a considerably different character than it had in the 1970s. Chapter 2 is organized around these three periods.
John R. Rice, Saul Rosen
3. Overview: Carnegie Mellon University Master of Software Engineering Program
Abstract
Carnegie Mellon University (CMU) decided to offer a professional master of software engineering (MSE) degree program beginning in the fall of 1989. The program is a joint effort between the School of Computer Science and the Software Engineering Institute (SEI).
Norman E. Gibbs
4. Lessons Learned in Building a Successful Undergraduate Information Systems Academic Program
Abstract
Since 1978, the Department of Computer Technology (CPT), an undergraduate computer information systems (CIS) program in Purdue University’s School of Technology, has successfully followed an innovative approach to meeting the critical need for competent, occupationally ready information systems professionals. The department opened its doors in the fall of 1978 to 60 students. Today its enrollment exceeds 500 students in five locations!
Thomas I. M. Ho

Research Contributions

Frontmatter
5. Polynomial Interpolation in Several Variables
Abstract
I want to thank the organizers for inviting me to this meeting as it gives me the opportunity to help celebrate Sam Conte who gave me my first academic job. More than that, he provided my children with many years of summer camp in the wilds of New Hampshire and Wisconsin, and at least two of them think that those summers in New Hampshire were essential for their growing up (and I tend to agree with them).
C. de Boor
6. Exterior Point Algorithm for Linear Programming Implemented on the SX-2 Supercomputer
Abstract
In introducing three survey articles by Anstreicher, Monma and Wright, 1 the editor of the March 1989 SIAM News made the following comments about linear programming (LP) problems:
According to current estimates, more than $100 million in human and computer time is invested yearly in the formulation and solution of linear programming problems. Businesses, large and small, use linear programming models to optimize communications systems and to schedule transportation networks, to control inventories, to plan portfolios, to maximize output...
Invented in the mid-1940s by George Dantzig and improved in various ways in the intervening four decades, the simplex method continues to be the workhorse algorithm for solving linear programming problems. It is no wonder, then, that the announcement in 1984 of a method [AT&T researcher N. Karmarkar’s Projective algorithm2] with the potential for dramatic improvement in computational effectiveness over the simplex method made front-page news in major newspapers and magazines throughout the country.
L. Duane Pyle, Sang-Ha Kim
7. Parallel Multilevel Methods
Abstract
Chapter 7 is concerned with iterative methods for solving the linear system
$$Au = b$$
(1)
where A is a given square nonsingular N × N matrix and b is a given vector. A frequently used procedure for solving Equation 1 involves choosing a standard basic iterative method of the form
$$u^{\left( {n + 1} \right)} = G_s u^{\left( n \right)} + k_s $$
(2)
where for some nonsingular (splitting) matrix Q s we have
$$\left\{ {\begin{array}{*{20}c} {G_s = I - Q_s^{ - 1} A} \\ {k_s = Q_s^{ - 1} b} \\ \end{array} } \right.$$
(3)
Examples of such iterative procedures are Richardson’s method, where Q s = I, and the Jacobi method, where Q s = D.
David M. Young Jr., Bi Roubolo Vona Jr.
8. Using Algebraic Geometry for Multivariate Polynomial Interpolation
Abstract
Interpolation provides a direct way of fitting analytic functions to sampled data. Chapter 8 is motivated by computational efficiency and deals with polynomials rather than arbitrary analytic forms. We distinguish between multivariate polynomial functions
$$F:x_n = f_1 \left( {x_1 , \ldots ,x_{n - 1} } \right)$$
multivariate rational functions
$$\Re :x_n = \frac{{f_1 \left( {x_1 , \ldots ,X_{n - 1} } \right)}} {{f_2 \left( {x_1 , \ldots ,X_{n - 1} } \right)}}$$
and polynomial algebraic functions or implicitly defined hypersurfaces
$$H:f_1 \left( {x_1 , \ldots ,X_n } \right) = 0$$
where all f i are multivariate polynomials with coefficients in ℝ. While prior work on interpolation has dealt with multivariate polynomial functions F and rational functions ℬ, see for example References 1–5, little work has been reported on interpolation with implicitly defined hypersur-faces ℋ. See References 6 and 15 which summarizes prior work on implicit surface interpolation in three dimensions and provides several additional references.
Chandrajit L. Bajaj
9. Object-Oriented Design with Box Structures
Abstract
There are many discussions in the literature today about object-oriented designs but few about systematic methods for object-oriented designing. There is a profound difference between a syntax correct object-oriented design and a sound engineering process for achieving one, often it is the difference between heuristic invention and systematic derivation. In either case the syntactic result is an object-oriented design, but practical results can vary widely in effectiveness.
Alan R. Hevner, Harlan D. Mills
10. Toward Formalizing Control System Simulation Software
Abstract
The job of a control engineer is to build controllers for physical systems. Traditionally this has been done by creating a mathematical model of the system using differential equations. With the model the engineer designs a controller and analyzes the new model (original model and the controller) for proper control and stability.
Joseph E. Hollingsworth
11. Sensitivity of Differential Equations
Abstract
Although it had received little attention until recently, the sensitivity of two-point boundary value problems in differential equations is the subject of much current study (see, for instance Reference 1). The question of how the solution of a differential system depends on its data is not only fundamental in analyzing differential models for physical processes, but it is essential for understanding numerical methods for solving the system. Indeed the sensitivity of the difference systems that approximate differential systems must depend in one way or another on the sensitivity of the original problem. Thus it is mathematically convenient to present a conditioning analysis that applies to both the differential and the difference systems. Chapter 11 develops the basis for such a uniform analysis.
R. V. M. Zahar
Backmatter
Metadaten
Titel
Studies in Computer Science
herausgegeben von
John Rice
Richard A. DeMillo
Copyright-Jahr
1994
Verlag
Springer US
Electronic ISBN
978-1-4615-1791-7
Print ISBN
978-1-4613-5723-0
DOI
https://doi.org/10.1007/978-1-4615-1791-7