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

ACM-SE 33最新文献

筛选
英文 中文
A timing comparison of the conjugate gradient and Gauss-Seidel parallel algorithms in a one-dimensional flow equation using PVM 基于PVM的一维流动方程共轭梯度和高斯-赛德尔并行算法的时序比较
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122055
Luke Olszewski
{"title":"A timing comparison of the conjugate gradient and Gauss-Seidel parallel algorithms in a one-dimensional flow equation using PVM","authors":"Luke Olszewski","doi":"10.1145/1122018.1122055","DOIUrl":"https://doi.org/10.1145/1122018.1122055","url":null,"abstract":"The development of parallel processing came about due to the ineffectiveness of a single processor to accommodate the solutions of large scale problems in a reasonable amount of time. In this paper, we shall introduce one such problem, and discuss the implementation of two parallel algorithms applied to the linear approximations. This study will illustrate how an approximation method which has a faster rate of convergence may not necessarily produce the best solution time.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"21 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121324756","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}
引用次数: 3
An optimal algorithm for similarity based entity association 基于相似性的实体关联优化算法
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122024
Olivier Brissac
{"title":"An optimal algorithm for similarity based entity association","authors":"Olivier Brissac","doi":"10.1145/1122018.1122024","DOIUrl":"https://doi.org/10.1145/1122018.1122024","url":null,"abstract":"Some inductive learning systems enable structural descriptions of examples, based on elementary entities whose value can be either symbolic or numerical. This paper studies such systems, especially the ones that use a similarity measure defined between elementary entities. As it is the case in our system [12], [13], in a learning process, the matching step leads to a generalization of the training set. The main benefit of a similarity based matching step is to enable symbolic as well as numeric values processing. Given a pair of examples, learning algorithms using a similarity measure begin with computing this measure for all entities pairs taken in both examples. When it comes to choosing which entities are to be associated, a greedy method is used: entities are associated by pairs in decreasing similarity order. This paper proposes an alternative to this greedy choice based on a network flow algorithm providing an optimal result, according to the given similarity function. Furthermore, we study a generalization of this approach and we show the general case to be NP-complete. After a discussion on theoretical and practical use of the optimal method, we give some directions for further works.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126408350","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 entity-relationship design system for graphical software development 面向图形软件开发的实体关系设计系统
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122025
Christopher R. Senhouse
{"title":"An entity-relationship design system for graphical software development","authors":"Christopher R. Senhouse","doi":"10.1145/1122018.1122025","DOIUrl":"https://doi.org/10.1145/1122018.1122025","url":null,"abstract":"The Entity-Relationship (ER) Model has proven to be a more useful technique than in just the field of database design. It and its extensions have become prominent in the design and analysis phases of software development. This paper will describe a system built in Smalltalk, the Entity-Relationship Design System, which allows the graphical creation and manipulation of ER diagrams. The system then generates Smalltalk code to create the ER database that is specified by the diagram. This allows the ER Model to be used in the implementation phase of software development, as well as in design and analysis.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133253901","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
Constructing multiprocessor workload characterizations 构建多处理器工作负载表征
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122020
Darrell Suggs, R. Reynolds
{"title":"Constructing multiprocessor workload characterizations","authors":"Darrell Suggs, R. Reynolds","doi":"10.1145/1122018.1122020","DOIUrl":"https://doi.org/10.1145/1122018.1122020","url":null,"abstract":"We present a method for developing a multiple processor workload characterization based on actual system level traces of user and kernel accesses. We trace a single processor system executing an N-processor workload. We then perform static analysis on the trace and produce individual process characterizations. These characterizations can be used to build input workloads for models of multiple processor systems. This provides a method for using real workload traces to drive multiple processor simulations without requiring that a similarly configured machine exist. Additionally, a wealth of static information can be obtained from the traces. As an example, we have traced and analyzed the popular commercial benchmark, TPC-B. We present results from the analysis.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121901599","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}
引用次数: 4
Software engineering frontiers in computational science and engineering 软件工程是计算科学和工程的前沿
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122039
D. Stevenson
{"title":"Software engineering frontiers in computational science and engineering","authors":"D. Stevenson","doi":"10.1145/1122018.1122039","DOIUrl":"https://doi.org/10.1145/1122018.1122039","url":null,"abstract":"In 1991, the US Congress passed the High Performance Computing and Communications bill, commonly known as the HPCC bill, enshrining the Grand Challenges as national priorities. The very nature of these problems require the multidisciplinary teamwork of engineers plus computer, mathematical and physical scientists. But many important scientific and engineering problems are solved daily on workstations---these were dubbed the \"petty challenges\". Both classes of problem are demanding computational systems although quite different from non-scientific systems.We review a philosophical background for CSE, using this development to point out how seemingly innocuous decisions made by engineers and scientists can have disastrous results. Hence, software engineers should see CSE as a professional challenge. Our program is based on studying applications, the algorithms to solve problems arising in those applications, and the mapping of those algorithms to architectures. Using Computing Reviews categories, we outline the subjects required for understanding CSE systems.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121935589","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
Semi-numerical transient analysis of Markov models 马尔可夫模型的半数值瞬态分析
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122021
A. V. Ramesh, Kishor S. Trivedi
{"title":"Semi-numerical transient analysis of Markov models","authors":"A. V. Ramesh, Kishor S. Trivedi","doi":"10.1145/1122018.1122021","DOIUrl":"https://doi.org/10.1145/1122018.1122021","url":null,"abstract":"We present a new O(n3) algorithm for seminumerical transient analysis of continuous time Markov chains with n states. The algorithm is based on spectral decomposition of the transition rate matrix in combination with partial fraction expansion based on Laplace transforms. The algorithm acknowledges the inherent numerical difficulties associated with illconditioned problems and finite machine precision by incorporating a realistic assessment of the condition and sensitivity of the problem. It is more efficient and provides more accurate solutions in the face of round-off error when compared to similar algorithms in the literature. We demonstrate the performance of the algorithm on many ill-conditioned applications.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124002644","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
The impact of accreditation on CS1 and CS2 认证对CS1和CS2的影响
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122052
J. Hankins, B. Parker
{"title":"The impact of accreditation on CS1 and CS2","authors":"J. Hankins, B. Parker","doi":"10.1145/1122018.1122052","DOIUrl":"https://doi.org/10.1145/1122018.1122052","url":null,"abstract":"The purpose of this paper is to present a summary of the results of a recently conducted electronic survey. This empirical investigation used a nationwide electronic mail questionnaire sent to a random sampling of colleges. The intent of the investigation was to study trends in CS1, primarily, and CS2, secondarily. The survey contained questions concerning course content, language, hardware, closed structured laboratories, and curriculum model. Results were tabulated to detect trends and to learn whether accredited programs and non-accredited programs are providing statistically significant different educational experiences.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128092928","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
Experiences and successes in teaching a language many CS students didn't want to learn: COBOL 教授一种许多计算机学生不想学的语言:COBOL的经验和成功
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122073
Stephen M. Jodis
{"title":"Experiences and successes in teaching a language many CS students didn't want to learn: COBOL","authors":"Stephen M. Jodis","doi":"10.1145/1122018.1122073","DOIUrl":"https://doi.org/10.1145/1122018.1122073","url":null,"abstract":"Many computer science students see no value in taking a COBOL programming course until they begin to notice the number of job advertisements requiring the applicant to have knowledge of the language. Even if students are aware that knowledge of the COBOL language could help them to locate an entry level job, many still find the course to be less than exciting. The presentation of the COBOL course has evolved over the past four years from an introduction to COBOL programming, to introduction to COBOL via a software engineering approach, to introduction to COBOL, software engineering, and how it applies to real world events and situations. Over these years the response of the students to the course has improved, the amount of material covered has increased, and students are finding jobs which require knowledge of COBOL.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122525796","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
Human perception of halftoned images 人类对半色调图像的感知
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122035
Lori Postner
{"title":"Human perception of halftoned images","authors":"Lori Postner","doi":"10.1145/1122018.1122035","DOIUrl":"https://doi.org/10.1145/1122018.1122035","url":null,"abstract":"An empirical study of human perception of halftoned images was conducted to determine which of five different halftoning algorithms generated the best images. The subjects viewed each of the 20 stimuli (halftoned images) at two distances, and although all images were more preferred at the far distance, the rating of the pictures was dependent upon the algorithm used in generation. Images containing a high level of detail were rated highest when halftoned by the neural network and the simulated annealing algorithms of [4], whereas pictures that had little detail and many smooth surfaces were rated highest under the Floyd-Steinberg model [3].","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117263362","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
Generating nonlinear class boundaries using distributed encodings 使用分布式编码生成非线性类边界
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122064
S. Narayan
{"title":"Generating nonlinear class boundaries using distributed encodings","authors":"S. Narayan","doi":"10.1145/1122018.1122064","DOIUrl":"https://doi.org/10.1145/1122018.1122064","url":null,"abstract":"Multi-layer Perceptron (MLP) networks function as hyperplane classifiers when applied to classification problems. Therefore, MLP networks can be inefficient when applied to problems in which class boundaries are inadequately modeled by hyperplanes. Attempts to remedy this problem typically necessitate the introduction of a new neural network model in which alternative node connection functions are used to allow the formation of nonlinear class boundaries. In this paper we demonstrate the use of a biologically motivated data representation scheme which, while working within the constraints of the MLP model, permits the development of nonlinear class boundaries. The enhancements afforded by the data representation scheme are demonstrated and analyzed in the context of a classification problem.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176742","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学术官方微信