Variational methods of approximation have become very popular in recent years among engineers and numerical analysts. In particular, the finite element method has established itself as one of the most powerful techniques available for the approximate solution of boundary-value problems. In the present paper, we outline a number of mathematical properties of the method which are partially responsible for its success; we discuss certain error estimates and convergence results, and we describe some results obtained in applications of the method to a class of nonlinear problems in elastodynamics.
{"title":"Some distributional and convergence properties of the finite element method, with applications in nonlinear elastodynamics","authors":"J. Oden","doi":"10.1145/800192.805746","DOIUrl":"https://doi.org/10.1145/800192.805746","url":null,"abstract":"Variational methods of approximation have become very popular in recent years among engineers and numerical analysts. In particular, the finite element method has established itself as one of the most powerful techniques available for the approximate solution of boundary-value problems. In the present paper, we outline a number of mathematical properties of the method which are partially responsible for its success; we discuss certain error estimates and convergence results, and we describe some results obtained in applications of the method to a class of nonlinear problems in elastodynamics.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"26 1","pages":"405-408"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81078262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper is concerned with two different ways of expanding the definition of a tessellation automaton, and some of the resultant properties which thereby ensue. The first allows the notion of sequential processing, while the second allows the addition of spatial non-uniformity.
{"title":"Pattern generation in non-standard tessellation automata","authors":"W. Grosky, F. Tsui","doi":"10.1145/800192.805730","DOIUrl":"https://doi.org/10.1145/800192.805730","url":null,"abstract":"This paper is concerned with two different ways of expanding the definition of a tessellation automaton, and some of the resultant properties which thereby ensue. The first allows the notion of sequential processing, while the second allows the addition of spatial non-uniformity.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"518 1 1","pages":"345-348"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78404140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In order to satisfy three types of terminal users, student programmers, production users and CAI authors, Western Washington State College has developed a MULTILINGUAL INTERPRETER. The MULTILINGUAL INTERPRETER allows PL/I, BASIC and COURSEWRITER III to be run on a single terminal system. The configuration of the language processor is such that programs can be prepared in more than one source language. The main purpose of this development is to provide advanced programming features not only to the non-CAI programmer, but to the CAI programmer as well. This paper describes the steps taken in the development of this system and the system's language mixing capabilities.
{"title":"A MULTILINGUAL INTERPRETER for interactive computing in an academic environment","authors":"Larry Kheriaty","doi":"10.1145/800192.805719","DOIUrl":"https://doi.org/10.1145/800192.805719","url":null,"abstract":"In order to satisfy three types of terminal users, student programmers, production users and CAI authors, Western Washington State College has developed a MULTILINGUAL INTERPRETER. The MULTILINGUAL INTERPRETER allows PL/I, BASIC and COURSEWRITER III to be run on a single terminal system. The configuration of the language processor is such that programs can be prepared in more than one source language. The main purpose of this development is to provide advanced programming features not only to the non-CAI programmer, but to the CAI programmer as well. This paper describes the steps taken in the development of this system and the system's language mixing capabilities.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"108 1","pages":"290-294"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79333242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interpreter for an intermediate language (IL) into which various source languages (including TRAIL itself) may be translated. The interpreter size is about 1400 bytes. The choice of an interpreted target language was guided by the objectives of minimum object code size and machine independence of the developed software. Both of these have been achieved, at the expense of a 20:1 slowdown of execution speed relative to directly assembled code. The interpreted object code is at least 50% smaller than assembly code. The source language was designed to match the requirements of language translator software; software design directly models syntax checking, context-free translation, and context-sensitive translation aspects, in ascending order of complexity. Anticipated benefits include greater productivity in design and debug phases, and enhanced communication between programmers via simplified documentation procedures.
{"title":"A minisystem programming language","authors":"Robert J. Lechner, W. Stallings","doi":"10.1145/800192.805700","DOIUrl":"https://doi.org/10.1145/800192.805700","url":null,"abstract":"TRAIL is a block-structured language and programming system for the development of programming support systems and translators for problem-oriented languages on minicomputers. The programming system includes an interpreter for an intermediate language (IL) into which various source languages (including TRAIL itself) may be translated. The interpreter size is about 1400 bytes.\u0000 The choice of an interpreted target language was guided by the objectives of minimum object code size and machine independence of the developed software. Both of these have been achieved, at the expense of a 20:1 slowdown of execution speed relative to directly assembled code. The interpreted object code is at least 50% smaller than assembly code.\u0000 The source language was designed to match the requirements of language translator software; software design directly models syntax checking, context-free translation, and context-sensitive translation aspects, in ascending order of complexity. Anticipated benefits include greater productivity in design and debug phases, and enhanced communication between programmers via simplified documentation procedures.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"1 1","pages":"174-182"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75500762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Paul F. Huebner, Daniel T. Skelton, Earl J. Schweppe
An interactive simulation of the execution of mnemonically entered instructions for the Datapoint 2200 Computer has been developed which runs on this same machine. A representation of the registers, flip-flops, program counter, subroutine stack, and referenced memory cell is show on the display of the machine. Individual mnemonic instructions may be entered from the keyboard and are shown on the display in standard assembly source language except that instructions may not be labelled. Both the instructions and their operands are syntactically checked character-by-character as they are entered and all illegal entries are refused. The simulator displays the corresponding octal form of these instructions and modifies the representation of the state of the machine accordingly. Short programs of such instructions may be entered and normal sequential execution simulated, Experience indicates that such simulators can provide an easy means of learning the computer organization, mnemonic instructions, and program execution of a computer. They can be especially helpful in demonstrating the dynamics of recursive subroutine calls and push-down stacks.
{"title":"Interactive instruction simulation on and of the Datapoint 2200 computer","authors":"Paul F. Huebner, Daniel T. Skelton, Earl J. Schweppe","doi":"10.1145/800192.805722","DOIUrl":"https://doi.org/10.1145/800192.805722","url":null,"abstract":"An interactive simulation of the execution of mnemonically entered instructions for the Datapoint 2200 Computer has been developed which runs on this same machine. A representation of the registers, flip-flops, program counter, subroutine stack, and referenced memory cell is show on the display of the machine. Individual mnemonic instructions may be entered from the keyboard and are shown on the display in standard assembly source language except that instructions may not be labelled. Both the instructions and their operands are syntactically checked character-by-character as they are entered and all illegal entries are refused. The simulator displays the corresponding octal form of these instructions and modifies the representation of the state of the machine accordingly. Short programs of such instructions may be entered and normal sequential execution simulated, Experience indicates that such simulators can provide an easy means of learning the computer organization, mnemonic instructions, and program execution of a computer. They can be especially helpful in demonstrating the dynamics of recursive subroutine calls and push-down stacks.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"1 1","pages":"304-308"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83199774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
{"title":"Extended polynomial algorithms","authors":"A. C. Hearn, R. Loos","doi":"10.1145/800192.805696","DOIUrl":"https://doi.org/10.1145/800192.805696","url":null,"abstract":"It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"35 1","pages":"147-152"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84878232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The TICCIT project (Time-shared, Interactive, Computer-controlled Information Television) being developed jointly by the MITRE Corporation and Brigham Young University is now installed and operating at BYU with 30 terminals. The software for on-line authoring is being used to input more than six semesters of material in Mathematics and English instruction for Community Colleges. Two community colleges have been selected for a field test in 1974-75. They are Phoenix College and Northern Virginia Community College in Alexandria. The innovative concepts of learner-controlled courseware were illustrated by means of 35 mm. slides. These concepts include the objectives and status display (MAP), the primary instruction logic of the learner-control command language, and the Advisor program. The modularity of design for learner-controlled courseware permits differentiated staffing for the production of large volumes of quality material. The production procedures for learner-controlled courseware, involving roles of different team members, were briefly described.
{"title":"Learner-controlled course on the TICCIT system","authors":"C. Bunderson","doi":"10.1145/800192.805731","DOIUrl":"https://doi.org/10.1145/800192.805731","url":null,"abstract":"The TICCIT project (Time-shared, Interactive, Computer-controlled Information Television) being developed jointly by the MITRE Corporation and Brigham Young University is now installed and operating at BYU with 30 terminals. The software for on-line authoring is being used to input more than six semesters of material in Mathematics and English instruction for Community Colleges. Two community colleges have been selected for a field test in 1974-75. They are Phoenix College and Northern Virginia Community College in Alexandria.\u0000 The innovative concepts of learner-controlled courseware were illustrated by means of 35 mm. slides. These concepts include the objectives and status display (MAP), the primary instruction logic of the learner-control command language, and the Advisor program.\u0000 The modularity of design for learner-controlled courseware permits differentiated staffing for the production of large volumes of quality material. The production procedures for learner-controlled courseware, involving roles of different team members, were briefly described.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"6 1","pages":"349"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84138454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A brief exposition on generalized splines is given. Generalized splines form a spectrum of functions Sα (that depend on a parameter 0<α<@@@@) which minimize a penalty-type functional (depending on α) associated with a variety of regularization and stabilization methods. Interpolating splines and least-squares splines are obtained as limiting cases of a generalized spline (as α→0 and α&rarr@@@@ respectively). Least-squares solutions (of minimal norm) of operator equations are considered in terms of generalized inverses of linear operators. Approximate minimization (of functionals that arise in these settings) using spline functions is indicated. Projection and least-squares methods (on subspaces of splines for example) are used to approximate least-squares solutions of minimal norm of linear operator equations.
{"title":"On applications of generalized splines and generalized inverses in regularization and projection methods","authors":"M. Nashed","doi":"10.1145/800192.805748","DOIUrl":"https://doi.org/10.1145/800192.805748","url":null,"abstract":"A brief exposition on generalized splines is given. Generalized splines form a spectrum of functions Sα (that depend on a parameter 0<α<@@@@) which minimize a penalty-type functional (depending on α) associated with a variety of regularization and stabilization methods. Interpolating splines and least-squares splines are obtained as limiting cases of a generalized spline (as α→0 and α&rarr@@@@ respectively). Least-squares solutions (of minimal norm) of operator equations are considered in terms of generalized inverses of linear operators. Approximate minimization (of functionals that arise in these settings) using spline functions is indicated. Projection and least-squares methods (on subspaces of splines for example) are used to approximate least-squares solutions of minimal norm of linear operator equations.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"19 1","pages":"415-418"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84427435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PLANIT (Programming LANguage for Interactive Teaching) is a language used by authors to generate instructional sequences which are accessed by students via a computer. The Instructor's Computer Utility or ICU/PLANIT is the complete software system which makes PLANIT operational. This system is intended to function either as the sole operating system for the target machine or in co-operation with other operating systems. In August 1972, the National Science Foundation selected Purdue University as a test-site for an analysis and evaluation of ICU/PLANIT. Near the end of 1972, the Northwest Regional Educational Laboratory and Dr. Frye contracted with NSF for further PLANIT development and interaction between the test-site and PLANIT development was established.
{"title":"Test-site evaluation of ICU/PLANIT","authors":"T. Frederick","doi":"10.1145/800192.805724","DOIUrl":"https://doi.org/10.1145/800192.805724","url":null,"abstract":"PLANIT (<underline>P</underline>rogramming <underline>LAN</underline>guage for <underline>I</underline>nteractive <underline>T</underline>eaching) is a language used by authors to generate instructional sequences which are accessed by students via a computer. The Instructor's Computer Utility or ICU/PLANIT is the complete software system which makes PLANIT operational. This system is intended to function either as the sole operating system for the target machine or in co-operation with other operating systems.\u0000 In August 1972, the National Science Foundation selected Purdue University as a test-site for an analysis and evaluation of ICU/PLANIT. Near the end of 1972, the Northwest Regional Educational Laboratory and Dr. Frye contracted with NSF for further PLANIT development and interaction between the test-site and PLANIT development was established.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"8 1","pages":"316-319"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84514184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The multivariate splines considered are piecewise polynomials of total degree s, with continuous derivatives of order s-1. The piecewise domains consist of the polyhedra obtained by partitioning En with any k hyperplanes. For nondegenerate partitions, the splines have data fitting power which is greater than a single polynomial and less than the standard tensor product splines. An especially simple canonical form represents these splines. This representation, although numerically ill-conditioned, can be effectively used with standard software on problems with 1≤s≤3, 1≤n≤3, 1≤k≤8. Fixed partition problems can be solved with IBM's Scientific Subroutine Package programs for min-max or least squares fitting. Variable partitions can be handled with Marquardt's method, modified to avoid redundant placement of partitions.
{"title":"Computational aspects of data fitting with a new multivariate spline","authors":"P. B. Zwart","doi":"10.1145/800192.805747","DOIUrl":"https://doi.org/10.1145/800192.805747","url":null,"abstract":"The multivariate splines considered are piecewise polynomials of total degree s, with continuous derivatives of order s-1. The piecewise domains consist of the polyhedra obtained by partitioning En with any k hyperplanes. For nondegenerate partitions, the splines have data fitting power which is greater than a single polynomial and less than the standard tensor product splines. An especially simple canonical form represents these splines. This representation, although numerically ill-conditioned, can be effectively used with standard software on problems with 1≤s≤3, 1≤n≤3, 1≤k≤8. Fixed partition problems can be solved with IBM's Scientific Subroutine Package programs for min-max or least squares fitting. Variable partitions can be handled with Marquardt's method, modified to avoid redundant placement of partitions.","PeriodicalId":72321,"journal":{"name":"ASSETS. Annual ACM Conference on Assistive Technologies","volume":"145 1","pages":"409-414"},"PeriodicalIF":0.0,"publicationDate":"1973-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89067012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：