ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99149
Jan G. Wilms
{"title":"Computerizing a machine readable dictionary","authors":"Jan G. Wilms","doi":"10.1145/98949.99149","DOIUrl":"https://doi.org/10.1145/98949.99149","url":null,"abstract":"Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexical Function Grammar, General Phrase Structured Grammar, Functional Unification Grammar). These requirements go far beyond the typical small, hand-coded vocabularies developed for theoretical or demonstration purposes. Many researchers have independently discovered the rich, though unstructured, knowledge sources that machine readable dictionaries offer. This paper reports on an attempt to impose structure to the Funk and Wagnalls Dictionary, by means of a parser written in Turbo Pascal, using a mixed approach of pattern matching and transition networks. The resulting computerized dictionary is 95 % accurate, but correcting the final 5% incorrectly parsed involves painstakingly scrutinizing the output and modifying the parser to handle exceptional cases that occur only once or twice in the entire MRD, or editing the machine readable dictionary to remove errors introduced by the OCR process.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127973939","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99151
D. Partridge, Calvin Lee, Tod Pinniger, Warren Ogle
{"title":"Speech through myoelectric signal recognition SMyLES","authors":"D. Partridge, Calvin Lee, Tod Pinniger, Warren Ogle","doi":"10.1145/98949.99151","DOIUrl":"https://doi.org/10.1145/98949.99151","url":null,"abstract":"People who can not communicate throu gh audible speech are separated from society. SMyLES, MES hardware, and Speech generation hardware will allow these people the ability to join society. This paper is about the software called SMyLES that is the heart of the speecli recognition through myoelectric","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043354","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99094
Amos O. Olagunju
{"title":"An investigation of a 3-Poisson model as a basis for automatic index term selection","authors":"Amos O. Olagunju","doi":"10.1145/98949.99094","DOIUrl":"https://doi.org/10.1145/98949.99094","url":null,"abstract":"The indexing of a document is a central problem in preparing that document for a retrieval. This paper presents an overview of a sophisticated 3Poisson model, for application in automatic indexing. For all","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130704084","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99141
J. Battelini, S. Isukapalli
{"title":"A special purpose finite element architecture","authors":"J. Battelini, S. Isukapalli","doi":"10.1145/98949.99141","DOIUrl":"https://doi.org/10.1145/98949.99141","url":null,"abstract":"In this paper we will propose a special purpose parallel architecture for solving partial differential equations using the Finite Element method. We will propose a Multiple Instruction-stream, Multiple Data-stream (MIMD) architecture with a mesh interconnection network. Since there exists a plethora of Finite Element code, we will not provide a specific variation. We will, however, explicitly diagram how current sequential code should be modified to run efficiently on our proposed machine. In this paper, we concentrate on two-dimensional triangular shaped elements. However, any figure with no more than six sides including two-1 dimensional hexagonal and quadrilateral elements as well as three-dimensional triangular or quadrilateral elements are supported. We focus on two areas of the Finite Element method that can be sped up greatty using our machine. These two areas are mesh generation and the solution phase. We employ a multifront approach as our solution technique.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132691633","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.98977
J. Cross, Kelly I. Morrison, Charles H. May
{"title":"Generation of graphical representations from Ada source code","authors":"J. Cross, Kelly I. Morrison, Charles H. May","doi":"10.1145/98949.98977","DOIUrl":"https://doi.org/10.1145/98949.98977","url":null,"abstract":"","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114288873","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99063
Amos O. Olagunju, J. Turner, D. Richey, R. Jackson, S. Hanley, A. Williams, R. Howard
{"title":"Statistical indices for software quality estimation","authors":"Amos O. Olagunju, J. Turner, D. Richey, R. Jackson, S. Hanley, A. Williams, R. Howard","doi":"10.1145/98949.99063","DOIUrl":"https://doi.org/10.1145/98949.99063","url":null,"abstract":"n major feature is a work package designed to satisfy the processing objectives of a client company. The number of major features always varies from one software release to another C01891. Although there is an increasing trend in the number of major features and enhancement modification requests from one software release to another, the number of maintenance modification requests continues fluctuate; consequently, the total modification requests and items do not always exhibit a stable pattern [01891. In addition to providing information on the quality of discrepancy reports, modification request items, scripts and the overall software, quantitative indices are needed for estimating the discovery rate of discrepancy reports, the defect density of the current software and the field fault density. The primary purpose of this project was to develop statistical indices for estimating the quality of new or updated software releases. This paper presents a set of newly-developed absolute and relative measures that are useful for estimating the quality of software releases. Quality metrics were developed to better support (a) quality assurance estimation for major and minor software releases; and (b) computation of estimated field values such as the field fault density. Uhl ike the existing software quality metrics, (e.g., Li89, MuB7, Hu891, the new sets of quality assurance indices will be found useful by two categories of users — one set for the developers and test organizations, and the other in administrative decision-making positions. Cubic splines, polynomial splines, Langrangian interpolating polynomials and least squares ression analysis are alternative tools","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374453","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99137
A. Khanna
{"title":"A distributed algorithm for generation of the Kth best spanning tree","authors":"A. Khanna","doi":"10.1145/98949.99137","DOIUrl":"https://doi.org/10.1145/98949.99137","url":null,"abstract":"The problem at hand is to try and construct k spanning trees for a weighted connected graph, such that the weight of each constructed tree is less than a given w. This problem is called the kth best spanning tree problem. The sequential algorithm used is based on the procedure described by Maycda and Scshu. A distribution strategy for the parallel algorithm has been given. Spccdups for graph sizes varying from 5 vertices to 13 vertices have been shown and ana lyzed. Spccdups show that the distributed algorithm is cer tainly faster than the sequential algorithm, but also identify a bottleneck. All programs were implemented on the IN TEL iPSC/2.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127209867","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}
ACM-SE 28Pub Date : 1990-04-01DOI: 10.1145/98949.99046
R. Eggen, M. Eggen
{"title":"A parallel algorithm for Steiner systems","authors":"R. Eggen, M. Eggen","doi":"10.1145/98949.99046","DOIUrl":"https://doi.org/10.1145/98949.99046","url":null,"abstract":"The construction of Steiner systems provides an interesting foundation for the study of parallelism. Basic search techniques, such as depth first or breadth first search, warrant continued study when parallelism is involved. Though the emphasis of this paper is the study and corresponding,results of implementing a parallel algorithm solving Steiner systems, Steiner systems are important in their own right and have been studied for significant periods of time. The following areas are influenced by Steiner systems: 1) Graph theory [1], 2) Applications in Geometry [2], 3) Balanced incomplete block designs and groups [3], 4) Group theory [6], 5) Applications in algebra and design theory [7], and 6) Applications in graph theory [8]. In addition, the recent article by Colbourn and Van Oorschot in the ACM Computing Surveys attests to the multitude of applications of combinatorial designs in Computer Science [11].","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115562863","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号
