Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65096
C. Yasunobu, R. Itsuki, H. Tsuji, Fumihiko Mori
ESOCKS, a domain shell for intelligent document retrieval is described. An important feature of ESOCKS is its associative retrieval capability. ESOCKS associates input keywords with other keywords and utilizes the augmented keywords to retrieve documents. Keyword association prevents users from missing suitable documents. The certainty factor attached to each retrieved document enables the user to select suitable documents from certain candidates. Another important feature of ESOCKS is its knowledge acquisition facility, using eight kinds of worksheet. For experts, developing an expert system consists of extracting knowledge according to the format and entering it in worksheets. Experience with ESOCKS indicates that an unassisted expert can built an expert system and that associative retrieval is more intelligent than conventional keyword retrieval.<>
{"title":"Document retrieval expert system shell with worksheet-based knowledge acquisition facility","authors":"C. Yasunobu, R. Itsuki, H. Tsuji, Fumihiko Mori","doi":"10.1109/CMPSAC.1989.65096","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65096","url":null,"abstract":"ESOCKS, a domain shell for intelligent document retrieval is described. An important feature of ESOCKS is its associative retrieval capability. ESOCKS associates input keywords with other keywords and utilizes the augmented keywords to retrieve documents. Keyword association prevents users from missing suitable documents. The certainty factor attached to each retrieved document enables the user to select suitable documents from certain candidates. Another important feature of ESOCKS is its knowledge acquisition facility, using eight kinds of worksheet. For experts, developing an expert system consists of extracting knowledge according to the format and entering it in worksheets. Experience with ESOCKS indicates that an unassisted expert can built an expert system and that associative retrieval is more intelligent than conventional keyword retrieval.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"199 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":"115718216","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.65136
J. Salasin
Approaches and metrics useful in assuring reliable software, starting from the time at which requirements are defined, are discussed. This study provides the background for a discussion of technology and policy advances that are expected to greatly improve the ability to field the systems promised.<>
{"title":"Building reliable systems: software testing and analysis","authors":"J. Salasin","doi":"10.1109/CMPSAC.1989.65136","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65136","url":null,"abstract":"Approaches and metrics useful in assuring reliable software, starting from the time at which requirements are defined, are discussed. This study provides the background for a discussion of technology and policy advances that are expected to greatly improve the ability to field the systems promised.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"87 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":"116431990","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.65171
Jingde Cheng, K. Ushijima
A problem in knowledge engineering is investigated in order to determine how to generate automatically new valid causal relations from some known causal relations (e.g. given with the IF-THEN form). The authors discuss this problem from a logical viewpoint and propose using the entailment that is a primitive logical basis for the incremental generation of causal relations. After a brief comparison between relevance logics and entailment logic, the authors define a subclass of entailment logic, given an algebraic model for it, show its soundness based on the model, and discuss deductive entailment reasoning based on the logic. As a result, for given causal relations, new valid causal relations can be generated by deductive entailment reasoning based on the logic.<>
{"title":"Entailment as a logical basis for incremental generation of causal relations","authors":"Jingde Cheng, K. Ushijima","doi":"10.1109/CMPSAC.1989.65171","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65171","url":null,"abstract":"A problem in knowledge engineering is investigated in order to determine how to generate automatically new valid causal relations from some known causal relations (e.g. given with the IF-THEN form). The authors discuss this problem from a logical viewpoint and propose using the entailment that is a primitive logical basis for the incremental generation of causal relations. After a brief comparison between relevance logics and entailment logic, the authors define a subclass of entailment logic, given an algebraic model for it, show its soundness based on the model, and discuss deductive entailment reasoning based on the logic. As a result, for given causal relations, new valid causal relations can be generated by deductive entailment reasoning based on the logic.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"87 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":"114702786","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.65081
F. Sadri
The object model which is based on the abstract data type concept, provides a natural and more powerful modeling capability. This modeling power, coupled with efficiency of implementation, makes object-oriented database systems suitable for complex applications, such as engineering design applications. The author concentrates on: differences between object-oriented databases and object-oriented programming languages and differences between object-oriented databases and classical (relational) databases. The author argues the need for supporting schema evolution and object versions.<>
{"title":"Object-oriented database systems","authors":"F. Sadri","doi":"10.1109/CMPSAC.1989.65081","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65081","url":null,"abstract":"The object model which is based on the abstract data type concept, provides a natural and more powerful modeling capability. This modeling power, coupled with efficiency of implementation, makes object-oriented database systems suitable for complex applications, such as engineering design applications. The author concentrates on: differences between object-oriented databases and object-oriented programming languages and differences between object-oriented databases and classical (relational) databases. The author argues the need for supporting schema evolution and object versions.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"25 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":"126022927","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.65157
B. Zimmer
Software quality and productivity analysis (SQPA) is a relatively new program at Hewlett-Packard which has met with overwhelming success in the past two years. Its basis is a set of standardized questions which provide an assessment of all the major factors which affect the software development environment. The history, methodology, impact, and results of using SQPA are discussed.<>
{"title":"Software quality and productivity analysis at Hewlett-Packard","authors":"B. Zimmer","doi":"10.1109/CMPSAC.1989.65157","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65157","url":null,"abstract":"Software quality and productivity analysis (SQPA) is a relatively new program at Hewlett-Packard which has met with overwhelming success in the past two years. Its basis is a set of standardized questions which provide an assessment of all the major factors which affect the software development environment. The history, methodology, impact, and results of using SQPA are discussed.<<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":"125414734","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.65163
C. Ramamoorthy, S. Shekhar
Neural networks have traditionally been applied to recognition problems, and most learning algorithms are tailored to those problems. The authors discuss the requirements of learning for generalization, which is NP-complete and cannot be approached by traditional methods based on gradient descent. They present a stochastic learning algorithm based on simulated annealing in weight space. The convergence properties and feasibility of the algorithm are verified.<>
{"title":"Stochastic backpropagation: a learning algorithm for generalization problems","authors":"C. Ramamoorthy, S. Shekhar","doi":"10.1109/CMPSAC.1989.65163","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65163","url":null,"abstract":"Neural networks have traditionally been applied to recognition problems, and most learning algorithms are tailored to those problems. The authors discuss the requirements of learning for generalization, which is NP-complete and cannot be approached by traditional methods based on gradient descent. They present a stochastic learning algorithm based on simulated annealing in weight space. The convergence properties and feasibility of the algorithm are verified.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"33 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":"126358357","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.65168
S. Sugimoto, T. Sakaguchi, K. Tabata
A description is given of Concurrent Lisp, which is designed on the basis of lexical scope. It is called lexically scoped concurrent LISP (LS/CL). LS/CL is based on Common LISP. Local variables are lexically scoped and the functions, except for concurrent functions, are defined to satisfy the language specifications of Common LISP. Processes of LS/CL are dynamically created and cooperate with each other. In addition to the language features, this paper shows the environment management mechanism of dynamically activated processes that have statically scoped variables. Also described is the LS/CL system implemented on a workstation.<>
{"title":"Concurrent LISP based on lexical scope","authors":"S. Sugimoto, T. Sakaguchi, K. Tabata","doi":"10.1109/CMPSAC.1989.65168","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65168","url":null,"abstract":"A description is given of Concurrent Lisp, which is designed on the basis of lexical scope. It is called lexically scoped concurrent LISP (LS/CL). LS/CL is based on Common LISP. Local variables are lexically scoped and the functions, except for concurrent functions, are defined to satisfy the language specifications of Common LISP. Processes of LS/CL are dynamically created and cooperate with each other. In addition to the language features, this paper shows the environment management mechanism of dynamically activated processes that have statically scoped variables. Also described is the LS/CL system implemented on a workstation.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"144 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":"132806031","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.65091
J. Srivastava, D. Rotem
The concept of precision in databases for both queries and data is introduced and formalized. Algorithms for maintaining a database at a specified degree of precision are presented and analyzed. It is shown how these algorithms can be used to choose an optimal query plan by means of a query optimizer.<>
{"title":"A framework for expressing and controlling imprecision in databases","authors":"J. Srivastava, D. Rotem","doi":"10.1109/CMPSAC.1989.65091","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65091","url":null,"abstract":"The concept of precision in databases for both queries and data is introduced and formalized. Algorithms for maintaining a database at a specified degree of precision are presented and analyzed. It is shown how these algorithms can be used to choose an optimal query plan by means of a query optimizer.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"21 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":"134232878","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.65089
H. Kitagawa, N. Ohbo
Control of versions and time-varying configurations of design data is a very important issue in computer-aided design environments. A new data modeling scheme to facilitate their management is proposed. The basic idea is to manage complicatedly related time-varying design data in terms of well-defined versions and configurations of conceptual design artifacts. The modeling scheme views the design database as a collection of conceptual objects and representation objects. Representation objects are abstractions of conventional design data files and configurations of conceptual objects are cast on them as the management structure. To facilitate design data management through the conceptual objects, the scheme provides constructs for modeling version variant and invariant configurations and for modular management of large configurations. Operations for design data manipulation and a mechanism for maintaining design database consistency are also presented.<>
{"title":"Design data modeling with versioned conceptual configuration","authors":"H. Kitagawa, N. Ohbo","doi":"10.1109/CMPSAC.1989.65089","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65089","url":null,"abstract":"Control of versions and time-varying configurations of design data is a very important issue in computer-aided design environments. A new data modeling scheme to facilitate their management is proposed. The basic idea is to manage complicatedly related time-varying design data in terms of well-defined versions and configurations of conceptual design artifacts. The modeling scheme views the design database as a collection of conceptual objects and representation objects. Representation objects are abstractions of conventional design data files and configurations of conceptual objects are cast on them as the management structure. To facilitate design data management through the conceptual objects, the scheme provides constructs for modeling version variant and invariant configurations and for modular management of large configurations. Operations for design data manipulation and a mechanism for maintaining design database consistency are also presented.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"44 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":"122994524","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.65144
Jiemin Gong, Minzhu Lu, Ning Li
In order to develop a tool for generating debugging programs to simulate all kinds of microprocessors, it is important to determine a general way to describe them. A language, called the instruction set describing language (ISDL), is presented which can express any type of instruction set. After the user inputs the instruction set description table (ISDT), a DEBUG program of the required type is generated. The design and implementation of the generator on one IBM-PC are presented.<>
{"title":"A tool to generate DEBUG program of arbitrary type of microprocessors","authors":"Jiemin Gong, Minzhu Lu, Ning Li","doi":"10.1109/CMPSAC.1989.65144","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65144","url":null,"abstract":"In order to develop a tool for generating debugging programs to simulate all kinds of microprocessors, it is important to determine a general way to describe them. A language, called the instruction set describing language (ISDL), is presented which can express any type of instruction set. After the user inputs the instruction set description table (ISDT), a DEBUG program of the required type is generated. The design and implementation of the generator on one IBM-PC are presented.<<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":"123517221","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
扫码关注我们
求助内容：
应助结果提醒方式：