发布求助
文献互助 智能选刊 最新文献

ACM-SE 18最新文献

筛选
英文 中文
Use of Plato in teaching computer design 柏拉图在计算机设计教学中的应用
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503884
J. Poore
{"title":"Use of Plato in teaching computer design","authors":"J. Poore","doi":"10.1145/503838.503884","DOIUrl":"https://doi.org/10.1145/503838.503884","url":null,"abstract":"CDA 3102 \"Computer Organization\" was a required course in the Computer Science curriculum at Florida State University, which has just been renumbered and made a part of a required sequence. The course is quite standard in the discipline. It begins with Boolean Algebra, Peano Arithmetic, and number systems, then proceeds through realization of logic gates, design of fundamental circuits, on to registers, adders, etc., and their combination into arithmetic-logic units, control units, memory units, and, finally, the organization of these units into computers of various architectures.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115348160","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}
引用次数: 0
Applications of root finding methods for discrete rational Chebyshev approximation 离散有理切比雪夫近似求根方法的应用
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503873
D. McAllister, S. Pizer
{"title":"Applications of root finding methods for discrete rational Chebyshev approximation","authors":"D. McAllister, S. Pizer","doi":"10.1145/503838.503873","DOIUrl":"https://doi.org/10.1145/503838.503873","url":null,"abstract":"Root finding algorithms are shown to be applicable for finding best rational Chebyshev approximations over finite point sets when the denominator of the approximating function is bounded below by a positive constant. The methods are applicable to approximation in several variables and are shown to be competitive with the differential correction algorithm.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"438 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123613364","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}
引用次数: 0
Orbit generation by use of Taylor's expansion 利用泰勒展开的轨道生成
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503887
H. W. Jones
{"title":"Orbit generation by use of Taylor's expansion","authors":"H. W. Jones","doi":"10.1145/503838.503887","DOIUrl":"https://doi.org/10.1145/503838.503887","url":null,"abstract":"Feynman (I) presents a method of tracing the orbit of a particle in a field of force. He makes each step of the orbit by calculating an average velocity for the particle based on its initial velocity and the acceleration it is subjected to over a finite length of time, At, and calculating the new location of the particle, assuming it moves in a straight line. Since the acceleration of the particle is known as a function of position, it is possible to use Taylor's expansion to get a higher order approximation. The question arises as to what is the most efficient way to plot an orbit over a cycle: should we use a few steps and a higher order of approximation, or many steps with the lowest order of approximation. It must be realized that the higher the order of approximation the more CPU time is required per step, but the steps may be larger to achieve the same degree of accuracy in the complete orbit; similarly, the more steps used, the more CPU is required. Several orders of approximations were used on Feynman's problem to decide which order leads to the least CPU time for equal accuracy in the determination of the orbit's period. It was found that~the third order approximation had almost twice the efficiency of any order from","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"253 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131881538","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}
引用次数: 0
Research issues in "fully" distributed systems “完全”分布式系统中的研究问题
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503872
R. LeBlanc
{"title":"Research issues in \"fully\" distributed systems","authors":"R. LeBlanc","doi":"10.1145/503838.503872","DOIUrl":"https://doi.org/10.1145/503838.503872","url":null,"abstract":"The topic of distributed systems is a major research area at Georgia Institute of technology with the particular class of systems being examined described in a definational paper by Enslow [i]. In recent years, the phrase \"distributed systems\" has become an extremely popular term for both research and marketing and the meaning of the term has become very imprecise. For that reason, we at Georgia Tech have further identified our particular area of interest as fully distributed data processing systems. The major factor differentiating our work from that of others is that the systems we are examining are ~ ~ coupled. This is an important dxstinction to bear in mind while reading this paper, since our view of distributed systems is certainly quite different from other researchers as a result of assuming this characteristic.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116512358","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}
引用次数: 2
Profile of a typical computer science department 典型的计算机科学系简介
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503892
G. Bailes
{"title":"Profile of a typical computer science department","authors":"G. Bailes","doi":"10.1145/503838.503892","DOIUrl":"https://doi.org/10.1145/503838.503892","url":null,"abstract":"The art and science of computing with digital computers is still in its formative stages. As a result, much of the terminology, technology, techniques, and training is yet to be standardized to any substantial degree. Likewise, computer science and information science programs in institutions of higher education lack standardization.While it is not the purpose of this paper to comment on the standards or curricula of computer or information science programs, the paper does provide some statistics which allow the reader to determine some of the characteristics of a \"typical\" computer science program. Specifically, statistics are given on current enrollment, faculty, teaching loads, tenure policies, faculty recruitment, and computing equipment available in such programs. The statistics are based on a recent nationwide survey.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115003492","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}
引用次数: 0
An algorithm for piecewise linear approximations 分段线性逼近的算法
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503851
J. Pleasant
{"title":"An algorithm for piecewise linear approximations","authors":"J. Pleasant","doi":"10.1145/503838.503851","DOIUrl":"https://doi.org/10.1145/503838.503851","url":null,"abstract":"An algorithm is described for approximating a function F(x) on a finite interval [a,b] whose second derivative is of constant sign on (a,b) by a continuous piecewise linear function, with any desired accuracy. Given a positive number ε, the algorithm finds a continuous piecewise linear functionL(x) = m<inf>i</inf> x + b<inf>i</inf>, x<inf>i-l</inf> ≤ × ≤ x<inf>i</inf>,i = 1,2 ...,nwhere a = x<inf>o</inf> < x<inf>l</inf> < ... < x<inf>n</inf> = b, such thatmax {|L(x) - F(x)|: x<inf>i-l</inf> ≤ x ≤ x<inf>i</inf>} ≈ = εfor i = 1,2,...,n-l, and|L(x) - F(x)| ≤ εfor x<inf>n-l</inf> ≤ × ≤ x<inf>n</inf>. In contrast to a method described by Phillips (1968), the derivative of F(x) is not used in the calculation of L(x). A computer implementation of the algorithm is discussed and an example of its use is provided.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115023700","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}
引用次数: 1
The effective employment of students in the development of information systems for state government 学生在州政府信息系统开发中的有效就业
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503858
J. Peck, Christopher W. Foreman
{"title":"The effective employment of students in the development of information systems for state government","authors":"J. Peck, Christopher W. Foreman","doi":"10.1145/503838.503858","DOIUrl":"https://doi.org/10.1145/503838.503858","url":null,"abstract":"The State Government of South Carolina shares a problem with many other states in its inability to adequately attract and retain highly skilled computer professionals. The many direct and fringe benefits offered by private industry attract well qualified data processing professionals away from state data processing positions. Out of this condition, a serious question arises: How are state governmental agencies to operate efficiently and effectively in the control of large amounts of money if they cannot retain an adequate staff of qualified data processing personnel?","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127635756","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}
引用次数: 0
Image processing projects for introductory students 图像处理项目，为入门学生
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503883
M. L. Nack, H. Porter
{"title":"Image processing projects for introductory students","authors":"M. L. Nack, H. Porter","doi":"10.1145/503838.503883","DOIUrl":"https://doi.org/10.1145/503838.503883","url":null,"abstract":"Two image processing projects are presented for introductory students that require only minimal computer facilities. The first produces a binary (black or white pixel) image and introduces signal processing concepts. The second project extends these ideas to the production of a grey level image.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129742381","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}
引用次数: 0
Job performance evaluation of data processing personnel: an empirical study 数据处理人员工作绩效评价的实证研究
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503878
Charles K. Woodruff
{"title":"Job performance evaluation of data processing personnel: an empirical study","authors":"Charles K. Woodruff","doi":"10.1145/503838.503878","DOIUrl":"https://doi.org/10.1145/503838.503878","url":null,"abstract":"Job performance evaluations of 16 systems analysts, 52 programmer analysts, 63 programmers, and 71 operations personnel from twelve data processing centers in metropolitan Atlanta are presented. Judgmental ratings of eight job characteristic traits by the individual's manager or supervisor were used. Study subjects were rated highest in Cooperation and lowest in Innovativeness. Systems analysts were rated highest of the functional groups.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122267493","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}
引用次数: 2
Use of computer simulation in Florida Atlantic University's MBA program 佛罗里达大西洋大学MBA课程的计算机模拟应用
ACM-SE 18 Pub Date : 1980-03-24 DOI: 10.1145/503838.503886
S. S. Stephenson
{"title":"Use of computer simulation in Florida Atlantic University's MBA program","authors":"S. S. Stephenson","doi":"10.1145/503838.503886","DOIUrl":"https://doi.org/10.1145/503838.503886","url":null,"abstract":"The MBA program at Florida Atlantic University is a general program covering all the fundamental areas of business administration, viz: accounting, finance, management, marketing, economics, quantitative methods and information systems. Within this traditional framework, the Computer Systems department residing in the College of Business has incorporated in one of the two five (5) quarter credit required courses under its jurisdiction, \"Information Systems\" an extensive exercise in model construction and computer simulation using the Dynamo language and associated industrial dynamics concepts. Dynamo, a high level procedural language developed in the 1960's by Jay Forrester, Jack Pugh and associates of the Sloane School at MIT, has been successfully used for the past eight years in this course on large scale IBM and more recently Univac system available for the student use.","PeriodicalId":431590,"journal":{"name":"ACM-SE 18","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1980-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126340536","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信