Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65172
J. Weber, P. C. Berry, W. Hagamen, K. Iverson
The problem of the extraction, representation, and utilization of meaning from English text has been elusive. Semantic parsing permits effective and relevant response to complex questions where the domain is well defined. The semantic net used is a three-row numeric matrix. Each column of the net represents an assertion about the domain. The meanings of each word are contained in associations (pointers to the names of things within the domain). The intersection of these pointers is used to define each phrase. Ambiguity is further reduced, when necessary, by an implementation of common sense-limiting the interpretations to those meanings that may be associated as the subject or object of each verb. Multiply embedded clauses are processed by passing the result of one clause as an argument for the next. By this means, complex expressions can be reduced to a single token.<>
{"title":"A semantic processor for natural language","authors":"J. Weber, P. C. Berry, W. Hagamen, K. Iverson","doi":"10.1109/CMPSAC.1989.65172","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65172","url":null,"abstract":"The problem of the extraction, representation, and utilization of meaning from English text has been elusive. Semantic parsing permits effective and relevant response to complex questions where the domain is well defined. The semantic net used is a three-row numeric matrix. Each column of the net represents an assertion about the domain. The meanings of each word are contained in associations (pointers to the names of things within the domain). The intersection of these pointers is used to define each phrase. Ambiguity is further reduced, when necessary, by an implementation of common sense-limiting the interpretations to those meanings that may be associated as the subject or object of each verb. Multiply embedded clauses are processed by passing the result of one clause as an argument for the next. By this means, complex expressions can be reduced to a single token.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114935298","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65072
M. Weiss, Zhixi Fang, C. R. Morgan, Peter A. Belmont
An effective dynamic processor self-scheduling scheme is presented for general parallel program constructs in a restructuring compiler. In the program constructs, parallel loops, serial loops, if-then-else constructs and a generalization of fork-joins can be nested in an arbitrary order, and procedure calls can be involved in any level of the nested constructs. In parallel programs, a piece of the program code, such as loop iterations, is called a chore, which is considered to be a work unit in the program. In this scheme, processors schedule themselves to the chores dynamically at execution time without involving the operating system. Memory management is another issue addressed. Efficiency concerns dictate treating chore locality differently from procedure locality. As a corollary, the number of call frames required at any one time for a nonrecursive procedure is bounded by the number of processors.<>
{"title":"Effective dynamic scheduling and memory management on parallel processing systems","authors":"M. Weiss, Zhixi Fang, C. R. Morgan, Peter A. Belmont","doi":"10.1109/CMPSAC.1989.65072","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65072","url":null,"abstract":"An effective dynamic processor self-scheduling scheme is presented for general parallel program constructs in a restructuring compiler. In the program constructs, parallel loops, serial loops, if-then-else constructs and a generalization of fork-joins can be nested in an arbitrary order, and procedure calls can be involved in any level of the nested constructs. In parallel programs, a piece of the program code, such as loop iterations, is called a chore, which is considered to be a work unit in the program. In this scheme, processors schedule themselves to the chores dynamically at execution time without involving the operating system. Memory management is another issue addressed. Efficiency concerns dictate treating chore locality differently from procedure locality. As a corollary, the number of call frames required at any one time for a nonrecursive procedure is bounded by the number of processors.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"31 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116392187","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65166
F.-T. Lin, J.-Y. Juang, D.-T. Lee
It is shown how a mathematical constraint resolution (MATHCORE) system can be used to design a better decision support system. MATHCORE not only has the flexibility of expressing mathematical equations within a logic programming paradigm in a natural way, but also has an ability to deal with systems of nonlinear equations, regression analysis, and optimization problems. While most existing constraint logic programming systems try to devise their own constraint solvers and are confined to systems of linear equations and simple nonlinear functions, the MATHCORE removes this limitation by directly taking advantage of well-developed numerical methods available in the mathematical libraries. With MATHCORE, complex decision optimization models can be embedded in a rule-based decision support system. Using this methodology, it is demonstrated that the interactions among various economic factors in a housing market can be stated in the program body, while various (optimization) goals of social welfare can be expressed as queries.<>
{"title":"Application of mathematical constraint resolution to decision support system","authors":"F.-T. Lin, J.-Y. Juang, D.-T. Lee","doi":"10.1109/CMPSAC.1989.65166","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65166","url":null,"abstract":"It is shown how a mathematical constraint resolution (MATHCORE) system can be used to design a better decision support system. MATHCORE not only has the flexibility of expressing mathematical equations within a logic programming paradigm in a natural way, but also has an ability to deal with systems of nonlinear equations, regression analysis, and optimization problems. While most existing constraint logic programming systems try to devise their own constraint solvers and are confined to systems of linear equations and simple nonlinear functions, the MATHCORE removes this limitation by directly taking advantage of well-developed numerical methods available in the mathematical libraries. With MATHCORE, complex decision optimization models can be embedded in a rule-based decision support system. Using this methodology, it is demonstrated that the interactions among various economic factors in a housing market can be stated in the program body, while various (optimization) goals of social welfare can be expressed as queries.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116405509","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65073
P. Tang, P. Yew, Chuanqi Zhu
Concurrent algorithms for a parallel linked list in a shared-memory parallel computer are proposed. The deletion of entries in a linked list can be executed concurrently in any order. In particular, the deletion of nonadjacent entries can be executed simultaneously without interfering with each other. The appending of a new entry to the list and the deletion of the entries other than the last one in the list can also be executed simultaneously. Parallel linked lists are very useful tools for parallel computers in processor scheduling memory management and sparse matrix computations. The machine model and the synchronization instruction used are described.<>
{"title":"A parallel linked list for shared-memory multiprocessors","authors":"P. Tang, P. Yew, Chuanqi Zhu","doi":"10.1109/CMPSAC.1989.65073","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65073","url":null,"abstract":"Concurrent algorithms for a parallel linked list in a shared-memory parallel computer are proposed. The deletion of entries in a linked list can be executed concurrently in any order. In particular, the deletion of nonadjacent entries can be executed simultaneously without interfering with each other. The appending of a new entry to the list and the deletion of the entries other than the last one in the list can also be executed simultaneously. Parallel linked lists are very useful tools for parallel computers in processor scheduling memory management and sparse matrix computations. The machine model and the synchronization instruction used are described.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108886","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65090
Kenneth P. Smith, J. Liu
A query processing method that produces approximate answers to queries posed in standard relational algebra is presented. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy makes it possible to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes approximate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.<>
{"title":"Monotonically improving approximate answers to relational algebra queries","authors":"Kenneth P. Smith, J. Liu","doi":"10.1109/CMPSAC.1989.65090","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65090","url":null,"abstract":"A query processing method that produces approximate answers to queries posed in standard relational algebra is presented. This method is monotone in the sense that the accuracy of the approximate result improves with the amount of time spent producing the result. This strategy makes it possible to trade the time to produce the result for the accuracy of the result. An approximate relational model that characterizes approximate relations and a partial order for comparing them is developed. Relational operators which operate on and return approximate relations are defined.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129827724","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65050
F. Fong, S. Shatz
Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. Timed and conditional entry call models that shed light on determining implementable interpretations are presented. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.<>
{"title":"Derivation of Petri net models of Ada tasking constructs involving time","authors":"F. Fong, S. Shatz","doi":"10.1109/CMPSAC.1989.65050","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65050","url":null,"abstract":"Ada tasking constructs involving time are modeled by timed Petri nets. Such modeling is helpful in interpreting the (often) ambiguous semantics described in the Ada reference manual. Timed and conditional entry call models that shed light on determining implementable interpretations are presented. From a general selective wait model, it is shown how to apply Petri net reduction operations to derive other selective wait models.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129634881","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65084
S. Su
It is argued that present object-oriented (O-O) database management systems (DBMSs) have not gone far enough. Two important aspects of semantics are not captured in the Smalltalk-type O-O paradigm and the DBMSs that have been developed on the basis of this paradigm. The first aspect is the specification of knowledge rules which model constraints, expert knowledge, deductive rules, and trigger conditions that are applicable to objects. The second aspect is the specification of various types of associations that an object type can have with other object types. It is suggested that the O-O paradigm for future database or knowledge-base management systems should extend the concept of a class from that of object type to object class. Rule declaration, rule inheritance, and association types are discussed.<>
{"title":"Extensions to the object-oriented paradigm","authors":"S. Su","doi":"10.1109/CMPSAC.1989.65084","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65084","url":null,"abstract":"It is argued that present object-oriented (O-O) database management systems (DBMSs) have not gone far enough. Two important aspects of semantics are not captured in the Smalltalk-type O-O paradigm and the DBMSs that have been developed on the basis of this paradigm. The first aspect is the specification of knowledge rules which model constraints, expert knowledge, deductive rules, and trigger conditions that are applicable to objects. The second aspect is the specification of various types of associations that an object type can have with other object types. It is suggested that the O-O paradigm for future database or knowledge-base management systems should extend the concept of a class from that of object type to object class. Rule declaration, rule inheritance, and association types are discussed.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130613726","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65066
Bruce Leasure
Summary form only given. A progress report on the standardization activity of the Parallel Computing Forum, including the programming model and the binding of that model in FORTRAN-77, is presented. The programming model defines two methods of describing the work to be executed in parallel: iterations of a loop and single-entry multiple-exit sections of code. Nested parallelism is supported, along with a partial sharing model for programming language viewable objects. Access to shared objects is controlled by both explicit and implicit synchronization. A large collection of details ranging from input/output issues to sequential consistency and to language/machine atomicity mismatch are addressed.<>
{"title":"PCF programming model and FORTRAN bindings","authors":"Bruce Leasure","doi":"10.1109/CMPSAC.1989.65066","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65066","url":null,"abstract":"Summary form only given. A progress report on the standardization activity of the Parallel Computing Forum, including the programming model and the binding of that model in FORTRAN-77, is presented. The programming model defines two methods of describing the work to be executed in parallel: iterations of a loop and single-entry multiple-exit sections of code. Nested parallelism is supported, along with a partial sharing model for programming language viewable objects. Access to shared objects is controlled by both explicit and implicit synchronization. A large collection of details ranging from input/output issues to sequential consistency and to language/machine atomicity mismatch are addressed.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123311657","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65051
S. Becker, A. Hevner
The author demonstrates the natural extension of the box structure theory and techniques of system development to concurrent system design. The semantics and syntax of box structures for designing concurrency are presented. Concurrent box structure designs for several concurrent system environments are shown. Extensions to more complex environments are suggested.<>
{"title":"Concurrent system design with box structures","authors":"S. Becker, A. Hevner","doi":"10.1109/CMPSAC.1989.65051","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65051","url":null,"abstract":"The author demonstrates the natural extension of the box structure theory and techniques of system development to concurrent system design. The semantics and syntax of box structures for designing concurrency are presented. Concurrent box structure designs for several concurrent system environments are shown. Extensions to more complex environments are suggested.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128045328","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}
Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65143
Takeshi Kaneko, Takeshi Nakajo
A method of specifying effective testing regions for detecting software defects accompanying changes in external specifications is proposed. On the basis of a careful analysis of actual software defects, the concept of restriction elements is introduced, and it is shown that software defects resulting from external specification changes can be regarded as consisting of the incorrect addition or elimination of these restriction elements. These errors produce a response different from the specifications in certain input regions. A theorem concerning the regions influenced is presented, and examples showing the effectiveness of the method are given.<>
{"title":"Method of determining effective software testing regions: detection of software defects related to external specification changes","authors":"Takeshi Kaneko, Takeshi Nakajo","doi":"10.1109/CMPSAC.1989.65143","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65143","url":null,"abstract":"A method of specifying effective testing regions for detecting software defects accompanying changes in external specifications is proposed. On the basis of a careful analysis of actual software defects, the concept of restriction elements is introduced, and it is shown that software defects resulting from external specification changes can be regarded as consisting of the incorrect addition or elimination of these restriction elements. These errors produce a response different from the specifications in certain input regions. A theorem concerning the regions influenced is presented, and examples showing the effectiveness of the method are given.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132131020","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：