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

AFIPS '71 (Spring)最新文献

筛选
英文 中文
Associative processing of line drawings 线条图的联想处理
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478864
N. J. Stillman, C. DeFiore, P. Berra
{"title":"Associative processing of line drawings","authors":"N. J. Stillman, C. DeFiore, P. Berra","doi":"10.1145/1478786.1478864","DOIUrl":"https://doi.org/10.1145/1478786.1478864","url":null,"abstract":"The marriage of computer graphics and an associative memory is a natural union. This is evidenced by the widespread use of software simulations of associative memories in today's most flexible graphical systems. The content-addressability of a hardware associative memory makes conventional addressing schemes superfluous and eliminates the need for pointers required to link related data, vastly reducing system overhead. The parallel retrieval and update functions possible with a hardware associative memory remove any need for multiple storage which is so prevalent in current systems and simultaneously increases processing speed. The capability of implicitly storing relations between data further decreases the storage requirements, while increasing flexibility.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133185758","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}
引用次数: 15
The data system environment simulator (DASYS) 数据系统环境模拟器(DASYS)
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478824
L. E. DeCuir, R. W. Garrett
{"title":"The data system environment simulator (DASYS)","authors":"L. E. DeCuir, R. W. Garrett","doi":"10.1145/1478786.1478824","DOIUrl":"https://doi.org/10.1145/1478786.1478824","url":null,"abstract":"For the past nine years, SDC has been Integration Contractor to one of the largest satellite tracking, commanding and control networks in the nation.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123225284","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
The theory and practice of bipartisan constitutional computer-aided redistricting 两党宪法计算机辅助重划选区的理论与实践
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478806
S. Nagel
{"title":"The theory and practice of bipartisan constitutional computer-aided redistricting","authors":"S. Nagel","doi":"10.1145/1478786.1478806","DOIUrl":"https://doi.org/10.1145/1478786.1478806","url":null,"abstract":"The theory behind bipartisan constitutional computer-aided redistricting essentially consists of three normative criteria which any systematic legislative redistricting scheme probably ought to seek to achieve. First, the redistricting system ought to be feasible such that it keeps computer time and other costs down to a minimum. Second, the system ought to provide legislative districts that will be approximately equal in population per representative so as to satisfy the Supreme Court's equality criterion, and the districts should be so shaped as to satisfy other legal requirements that relate to contiguity. Third, the system should consider the impact of the resulting districting on incumbents and on party balance so as to minimize the unhappiness which redistricting might otherwise produce for political leaders and for diverse political viewpoints.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129438042","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 interactive simulator generating system for small computers 用于小型计算机的交互式模拟器生成系统
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478848
Joel L. Brame, C. Ramamoorthy
{"title":"An interactive simulator generating system for small computers","authors":"Joel L. Brame, C. Ramamoorthy","doi":"10.1145/1478786.1478848","DOIUrl":"https://doi.org/10.1145/1478786.1478848","url":null,"abstract":"This paper is concerned with a novel idea for the use of an interactive computer system. The system, called an Interactive Simulator Generator, is designed primarily for a student interested in learning about the structure of a computer. This is achieved through the use of design configuration in a simulation process. The Interactive Simulator Generator asks questions about the structure of the target machine the user wants and provides him finally with a simulator for his machine. It also provides a list of pseudo micro-operations that help the user to specify and develop assembly instructions and programs. Modest diagnostic and debugging aids are provided. Measurements such as frequency of use and average execution time, etc., are also available for comparing different computer configurations. The simulation of a subset of the PDP-8 Computer is illustrated. The system is programmed in System 360/APL.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131289279","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}
引用次数: 7
The TABLON mass storage network TABLON海量存储网络
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478835
R. Gentile, Joseph R. Lucas
{"title":"The TABLON mass storage network","authors":"R. Gentile, Joseph R. Lucas","doi":"10.1145/1478786.1478835","DOIUrl":"https://doi.org/10.1145/1478786.1478835","url":null,"abstract":"This paper documents an approach by the Department of Defense for solving the massive volume digital tape storage problem. It describes a computer network called TABLON which provides several trillion (1012) bits of on-line storage simultaneously to a number of dissimilar computer systems. Such a network has potential application to any company, major institution, or publicly supported organization with the following situations:\u0000 ---they currently employ a number of large scale, third-generation computer systems,\u0000 ---their data base is large enough to cause physical storage and/or access problems,\u0000 ---their data accumulation is growing faster than their ability to pay for devices to contain it, and\u0000 ---they have a strong desire to consolidate all their computerized information into one central location","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116277427","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}
引用次数: 9
Optimal sizing, loading and re-loading in a multi-level memory hierarchy system 多级内存层次系统中的最优大小、加载和重新加载
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478834
S. R. Arora, A. Gallo
{"title":"Optimal sizing, loading and re-loading in a multi-level memory hierarchy system","authors":"S. R. Arora, A. Gallo","doi":"10.1145/1478786.1478834","DOIUrl":"https://doi.org/10.1145/1478786.1478834","url":null,"abstract":"Starting with the appearance of the third generation computers the demand for memory storage devices has increased. This increased demand has been for both the main storage and auxiliary storage devices. The major reasons for this increase were the problems of larger data processing tasks and the introduction of multiprogramming and time-sharing.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983858","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}
引用次数: 10
Performance evaluation of direct access storage devices with a fixed head per track 每磁道固定磁头直接存取存储设备的性能评价
AFIPS '71 (Spring) Pub Date : 1899-12-30 DOI: 10.1145/1478786.1478831
Trilok Manocha, W. L. Martin, Karl W. Stevens
{"title":"Performance evaluation of direct access storage devices with a fixed head per track","authors":"Trilok Manocha, W. L. Martin, Karl W. Stevens","doi":"10.1145/1478786.1478831","DOIUrl":"https://doi.org/10.1145/1478786.1478831","url":null,"abstract":"Computer designers agree that the slow response of input and output devices is the most critical factor limiting the performance of a computer system. When a program requests an access to one of these devices, the request is put on a queue. The members of the queue are usually serviced on a first-come-first-served basis or on the basis of preassigned priorities. Devices with large capacity are able to store a number of data sets belonging to various programs in a multi-programming environment. This usually leads to a queue build-up for these devices, thereby creating a bottleneck in the system.","PeriodicalId":158225,"journal":{"name":"AFIPS '71 (Spring)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132231199","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学术官方微信
小红书