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

ACM-SE 20最新文献

筛选
英文 中文
Joining separate file systems 连接不同的文件系统
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503900
J. Livesey
{"title":"Joining separate file systems","authors":"J. Livesey","doi":"10.1145/503896.503900","DOIUrl":"https://doi.org/10.1145/503896.503900","url":null,"abstract":"This paper takes a look at the so-called 'meta-system' approach to Distributed System construction; that is, constructing a distributed system by tieing together existing local operating systems. In particular it looks at some of the file system problems that may be encountered. These problems are simplified if one has the opportunity to rewrite the underlying local operating system (see [Oppen 81], for example], but typically, this is not the case. Since it is impractical to look at all existing local operating systems, I focus on a particular local operating system, Primos, with its overlying user interface, Software Tools, However, this is not to be taken as a comment on these systems; much of what I have to say is probably true of the majority of existing local operating systems.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116760566","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
Data management and model management: a relational synthesis 数据管理和模型管理:一种关系综合
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503921
R. Blanning
{"title":"Data management and model management: a relational synthesis","authors":"R. Blanning","doi":"10.1145/503896.503921","DOIUrl":"https://doi.org/10.1145/503896.503921","url":null,"abstract":"The successful implementation of data base management systems has led to suggestions that similar systems, called model management systems, be developed for decision models to facilitate and control user access to models and to integrate sets of models. This paper compares data management and model management in a relational context and examines an important difference between them: the conspicuous presence of sensitivity analysis in model management and its complete absence in data management. The paper concludes by outlining the salient issues in the integration of data and model management.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126021095","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}
引用次数: 28
Computer graphics animation of the Tellico Reservoir water temperature simulation 电脑图形动画的Tellico水库水温模拟
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503913
William L. Reid, Dalpha R. Stubblefield
{"title":"Computer graphics animation of the Tellico Reservoir water temperature simulation","authors":"William L. Reid, Dalpha R. Stubblefield","doi":"10.1145/503896.503913","DOIUrl":"https://doi.org/10.1145/503896.503913","url":null,"abstract":"A color computer graphics animation movie was developed to illustrate simulated water temperatures in Tellico Reservoir. Movie depicts March through October of a typical annual cycle in five minutes of animation. A FORTRAN program used DISSPLA software and an Information International FR 80 graphic recorder to produce a 16 mm color, silent movie. Displayed data were taken from the results of a two-dimensional hydrodynamic computer model.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114288609","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
Realization of a translator for Janus Janus翻译器的实现
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503934
J. H. Barrett, K. Reilly
{"title":"Realization of a translator for Janus","authors":"J. H. Barrett, K. Reilly","doi":"10.1145/503896.503934","DOIUrl":"https://doi.org/10.1145/503896.503934","url":null,"abstract":"The Janus programming language, viewed as the assembler for an abstract machine with a tree-based memory system, is of theoretical and practical interest, e.g., Pascal compilers. Many widely accepted theoretical formulations and conceptualizations are incorporated into it. We share these interests, but primarily want to utilize the system for its portability and other pragmatic contributions. Realizations of the abstract machine on a real machine is of interest as the complementary component in the study of language development.The central purpose of this paper is to describe some basic aspects of the implementation of Janus especially as they relate to a Data General Eclipse S/l30 (in the Computer Laboratory at Alabama-Birmingham). These implementation features have been driven by certain computing goals, mostly in non-numerical areas: table processing, list processing, and logic programming. Recent progress has focused on such topics as the core computation features and realization of a decision-table interpreter (which is part of a complex of table processors that incorporate up to five different machines). The paper overviews the various aspects of this work and focuses on the details in major applications.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114431710","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
A truck dispatching system 一种卡车调度系统技术方案
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503908
Ken R. Adcock
{"title":"A truck dispatching system","authors":"Ken R. Adcock","doi":"10.1145/503896.503908","DOIUrl":"https://doi.org/10.1145/503896.503908","url":null,"abstract":"Described is a system for the daily selection of truck carriers to deliver finished goods to a customer's site. The paper illustrates interfacing with corporate order entry and freight rate systems; the development and solution of a linear programming model; management reporting; and the human factors that must be considered.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129077983","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
A programming contest driving system 一个编程竞赛驱动系统
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503947
R. Hendry
{"title":"A programming contest driving system","authors":"R. Hendry","doi":"10.1145/503896.503947","DOIUrl":"https://doi.org/10.1145/503896.503947","url":null,"abstract":"This paper describes a system used to manage a programming contest. It has been used at East Tennessee State University for the past two years to determine the college's representatives to the ACM regional contest. The primary objective of the system is centralized automatic control. Its features provide ease of use and preservation of anonymity for the contestants in addition to security, logging, and scoring for the judges.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132210201","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
Dataflow representation in a network database 网络数据库中的数据流表示
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503954
X. Pham
{"title":"Dataflow representation in a network database","authors":"X. Pham","doi":"10.1145/503896.503954","DOIUrl":"https://doi.org/10.1145/503896.503954","url":null,"abstract":"Solutions to the problem of consistency and correctness of duplicate database have been tackled by many authors such as in [Elli77], [Grap76], and [Mull71]. In a network system, each update may bring up a different kind of consistency and a new proof of correctness. Data integrity and security in a concurrent environment are a big headache for the system implementor. Issues related to security and social impacts on a network system are discussed in [Denn72]. This paper attempts to use a new method, Dataflow Language, to represent the interactions in a network environment, and in doing so, the paper, hopefully, points out the consistency, and correctness of the duplicate database.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132796124","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 analysis of programming environments 对编程环境的分析
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503929
J. E. Urban, Lucy Edmonds, David Holland, Barry King, Manijeh Moghis, Hugo Valencia
{"title":"An analysis of programming environments","authors":"J. E. Urban, Lucy Edmonds, David Holland, Barry King, Manijeh Moghis, Hugo Valencia","doi":"10.1145/503896.503929","DOIUrl":"https://doi.org/10.1145/503896.503929","url":null,"abstract":"Programming environments consist of those tools and techniques that are applied throughout the software life cycle. Recent interest in programming environments has existed in industry, government, and academia. This paper is a synopsis of five graduate software engineering course projects in which programming environments were analyzed. The basis for the course project was a general set of environment questions posed to the attendees of the National Bureau of Standards Programming Environment Workshop. This paper addresses environment settings and requirements for the settings. The impact of utilizing programming environments, evaluation criteria, and technology validation are discussed. Finally, the paper covers current programming environment technology and potential future directions.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130747433","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 O(V) algorithm M for computing transitive reduction of a planar acyclic digraph 计算平面无环有向图传递约简的O(V)算法M
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503902
S. Kundu
{"title":"An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph","authors":"S. Kundu","doi":"10.1145/503896.503902","DOIUrl":"https://doi.org/10.1145/503896.503902","url":null,"abstract":"We present a linear O(V) algorithm for computing the transitive reduction of a planar acyclic digraph G, where V is the number of nodes in G. The algorithm makes explicit use of a fixed, but otherwise arbitrary, planar representation of G and obtains the transitive reduction in two steps, by computing successively the left reduction and the right-reduction. The planar digraphs form the second class of digraphs for which linear transitive reduction algorithm is known; the other class being the digraphs whose transitive reductions are directed spanning trees.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124230811","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
Solving a file assignment problem with a genetic plan 用遗传计划解决文件分配问题
ACM-SE 20 Pub Date : 1982-04-01 DOI: 10.1145/503896.503955
Thomas Wood
{"title":"Solving a file assignment problem with a genetic plan","authors":"Thomas Wood","doi":"10.1145/503896.503955","DOIUrl":"https://doi.org/10.1145/503896.503955","url":null,"abstract":"A genetic plan has been applied to the central server computer network file assignment problem. Throughput of the network is calculated for each file assignment produced by the genetic algorithm. Crossover and mutation are performed on individuals in accordance with their throughput.Various methods of representing and interpreting individuals as file assignments have been attempted. The effect of scaling, and time and space efficiency are addressed. The genetic plan quickly produces file assignments which are near optimal with regard to throughput of the network.","PeriodicalId":184493,"journal":{"name":"ACM-SE 20","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1982-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073250","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学术文献互助群
群 号：481959085
Book学术官方微信