Pub Date : 1990-10-31DOI: 10.1109/CMPSAC.1990.139320
Chen Ping, C. Xiyao, Jin Yimin
The authors report on their work to introduce the reflective architecture in a popular compilation-based language, C++, without modifying the compiler. The reflective architecture provides a disciplined split between the object level and the meta-object level in a class-based form. The unit of causal connections is the class member function. Mechanisms based on the methods diversion are constructed to support a kind of implicitly causal connection. A delegation mechanism is constructed for sharing meta-methods whose classes are not designed as having inheritance. A prototype has been constructed in the Advantage C++ 1.1 M4 running on MSDOS.<>
作者报告了他们在不修改编译器的情况下，在流行的基于编译的语言c++中引入反射体系结构的工作。反射体系结构以基于类的形式在对象层和元对象层之间提供了严格的分离。因果关系的单位是类成员函数。在方法转移的基础上构建了支持一种隐含因果关系的机制。为了共享那些类没有被设计为具有继承的元方法，构建了一种委托机制。在MSDOS上运行的Advantage c++ 1.1 M4构建了一个原型。
{"title":"An approach to introduce the reflection to C++","authors":"Chen Ping, C. Xiyao, Jin Yimin","doi":"10.1109/CMPSAC.1990.139320","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139320","url":null,"abstract":"The authors report on their work to introduce the reflective architecture in a popular compilation-based language, C++, without modifying the compiler. The reflective architecture provides a disciplined split between the object level and the meta-object level in a class-based form. The unit of causal connections is the class member function. Mechanisms based on the methods diversion are constructed to support a kind of implicitly causal connection. A delegation mechanism is constructed for sharing meta-methods whose classes are not designed as having inheritance. A prototype has been constructed in the Advantage C++ 1.1 M4 running on MSDOS.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115357000","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139457
Wei-Chung Lin, Fong-Yuan Liao, E. Tsao, Theresa Lingutla
The authors propose a hierarchical approach to solving the surface and the vertex correspondence problems in multiple-view based 3-D object recognition systems. The proposed scheme is a coarse-to-fine search process, and a Hopfield network is employed at each stage. Compared with the conventional object matching schemes, the proposed technique provides a more general and compact formulation of the problem and a solution more suitable for parallel implementation. At the coarse search stage, the surface matching rates between the input image and each object model in the database are computed through a Hopfield network and used to select the candidates for further consideration. At the fine search stage, the object models selected from the previous stage are fed into another Hopfield network for vertex matching. The object model that has the best surface and vertex correspondences with the input image is finally singled out as the best matched model. Results of experiments using both line drawings and real range images to corroborate the proposed theory are also reported.<>
{"title":"A connectionist approach to multiple-view based 3-D object recognition","authors":"Wei-Chung Lin, Fong-Yuan Liao, E. Tsao, Theresa Lingutla","doi":"10.1109/CMPSAC.1990.139457","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139457","url":null,"abstract":"The authors propose a hierarchical approach to solving the surface and the vertex correspondence problems in multiple-view based 3-D object recognition systems. The proposed scheme is a coarse-to-fine search process, and a Hopfield network is employed at each stage. Compared with the conventional object matching schemes, the proposed technique provides a more general and compact formulation of the problem and a solution more suitable for parallel implementation. At the coarse search stage, the surface matching rates between the input image and each object model in the database are computed through a Hopfield network and used to select the candidates for further consideration. At the fine search stage, the object models selected from the previous stage are fed into another Hopfield network for vertex matching. The object model that has the best surface and vertex correspondences with the input image is finally singled out as the best matched model. Results of experiments using both line drawings and real range images to corroborate the proposed theory are also reported.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115839513","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139436
Zheng Zhou, B. Wah
The authors study the decidability of redundancy detection in logic programs which are composed of inference rules with functions in their arguments. They formally define redundancies based on the solution sets in logic programs, and represent solution sets in well-defined domains. They prove that redundancy detection in inference rules with functions is undecidable. The theoretical results obtained here complete the previously unknown properties of redundancy detection of logic programs. Except for nonrecursive inference rules, redundancy detection is undecidable in general. Although general results reveal the inherent difficulty of efficient execution of logic programs through redundancy detection, special redundant cases can still be detected and pruned. Tradeoffs between compile-time analysis of decidable cases and run-time checking of undecidable cases can still be made.<>
{"title":"Redundancy detection in logic programs is undecidable","authors":"Zheng Zhou, B. Wah","doi":"10.1109/CMPSAC.1990.139436","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139436","url":null,"abstract":"The authors study the decidability of redundancy detection in logic programs which are composed of inference rules with functions in their arguments. They formally define redundancies based on the solution sets in logic programs, and represent solution sets in well-defined domains. They prove that redundancy detection in inference rules with functions is undecidable. The theoretical results obtained here complete the previously unknown properties of redundancy detection of logic programs. Except for nonrecursive inference rules, redundancy detection is undecidable in general. Although general results reveal the inherent difficulty of efficient execution of logic programs through redundancy detection, special redundant cases can still be detected and pruned. Tradeoffs between compile-time analysis of decidable cases and run-time checking of undecidable cases can still be made.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123759218","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139355
P. L. Tan, T. Dillon
Semantics is integrated with an object-oriented data model to increase its power of expression, leading to the notions of subsumption of attributes, values, and relationships. In addition, the concept of inheritance is extended to include inheritance of relationships as well as attributes and operations. The specification of attributes, relationships and operations for the hierarchical framework is explained. Multiple relationships between two objects pertaining to the same hierarchy are also allowed. These are important features for object-oriented data models as opposed to object-oriented programming systems where relationships do not play such a central role. These features have been consolidated into a unified model, namely the OSEA (object-oriented semantic model for exception accommodation) model, which also incorporates additional constraints and modeling of exceptions. A prototype system has been developed based on the OSEA model with the view of providing a more complete set of operations for exception handling.<>
{"title":"The conceptual design of OSEA: an object-oriented semantic data model","authors":"P. L. Tan, T. Dillon","doi":"10.1109/CMPSAC.1990.139355","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139355","url":null,"abstract":"Semantics is integrated with an object-oriented data model to increase its power of expression, leading to the notions of subsumption of attributes, values, and relationships. In addition, the concept of inheritance is extended to include inheritance of relationships as well as attributes and operations. The specification of attributes, relationships and operations for the hierarchical framework is explained. Multiple relationships between two objects pertaining to the same hierarchy are also allowed. These are important features for object-oriented data models as opposed to object-oriented programming systems where relationships do not play such a central role. These features have been consolidated into a unified model, namely the OSEA (object-oriented semantic model for exception accommodation) model, which also incorporates additional constraints and modeling of exceptions. A prototype system has been developed based on the OSEA model with the view of providing a more complete set of operations for exception handling.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116841903","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139309
M. Papazoglou, B. Blum, N. Bourbakis, A. Dollas, J. Hughes, E. Knudsen, T. Sellis
A panel session concerning the use of knowledge-based techniques is reported. The discussion covers the following topics: knowledge-based machine vision architectures; experiences from a knowledge-based integrated-circuit testing system; artificial-intelligence (AI) tools for requirements capture and analysis; an approach to knowledge modeling in expert systems design; and a homogeneous approach to bringing AI and database management systems together.<>
{"title":"Applying knowledge-based technology: trends and directions (Panel Session)","authors":"M. Papazoglou, B. Blum, N. Bourbakis, A. Dollas, J. Hughes, E. Knudsen, T. Sellis","doi":"10.1109/CMPSAC.1990.139309","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139309","url":null,"abstract":"A panel session concerning the use of knowledge-based techniques is reported. The discussion covers the following topics: knowledge-based machine vision architectures; experiences from a knowledge-based integrated-circuit testing system; artificial-intelligence (AI) tools for requirements capture and analysis; an approach to knowledge modeling in expert systems design; and a homogeneous approach to bringing AI and database management systems together.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125302115","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139400
Ren-Dar Yang, C. Chung
In an execution of a concurrent Ada program, each task will traverse its own path so that the execution can be seen as involving a set of concurrent paths, referred to as a concurrent path (C-path). The path feasibility problem of concurrent program testing is to identify whether a given C-path is traversable in some execution. A static analysis technique is proposed to address this problem. The technique is based on the analysis of the possible execution order of rendezvous statements within the given C-path. A precede relation is defined to express the execution order of rendezvous statements in a C-path. Several precedence rules and an algorithm are proposed to derive precede relations defined in a C-path. Based on the precede relations and the semantics of Ada, several decision rules are given to identify static infeasible C-paths.<>
{"title":"The analysis of infeasible concurrent paths of concurrent Ada programs","authors":"Ren-Dar Yang, C. Chung","doi":"10.1109/CMPSAC.1990.139400","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139400","url":null,"abstract":"In an execution of a concurrent Ada program, each task will traverse its own path so that the execution can be seen as involving a set of concurrent paths, referred to as a concurrent path (C-path). The path feasibility problem of concurrent program testing is to identify whether a given C-path is traversable in some execution. A static analysis technique is proposed to address this problem. The technique is based on the analysis of the possible execution order of rendezvous statements within the given C-path. A precede relation is defined to express the execution order of rendezvous statements in a C-path. Several precedence rules and an algorithm are proposed to derive precede relations defined in a C-path. Based on the precede relations and the semantics of Ada, several decision rules are given to identify static infeasible C-paths.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114677217","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139354
G. .. Qadah
The author presents and evaluates, using rigorous analytical models, a number of parallel algorithms suitable for processing an important class of recursive queries, the instantiated transitive closure (TC) queries. These algorithms are variants of the sequential delta -wavefront algorithm, designed to run on a shared-nothing (message-passing) type of multiprocessor system. The results obtained indicate that the relative performance of these algorithms is a strong function of not only the parameters which characterize the database and the processed query. Two parallel algorithms have been identified to be the best performing ones, one for systems with slow interconnection networks and the other for systems with fast networks. It is also found that allocating too many nodes to a query which does not need them results in a substantial loss of potential speedup in the processing of the query.<>
{"title":"Processing the transitive-closure logic rules on shared-nothing multiprocessor systems","authors":"G. .. Qadah","doi":"10.1109/CMPSAC.1990.139354","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139354","url":null,"abstract":"The author presents and evaluates, using rigorous analytical models, a number of parallel algorithms suitable for processing an important class of recursive queries, the instantiated transitive closure (TC) queries. These algorithms are variants of the sequential delta -wavefront algorithm, designed to run on a shared-nothing (message-passing) type of multiprocessor system. The results obtained indicate that the relative performance of these algorithms is a strong function of not only the parameters which characterize the database and the processed query. Two parallel algorithms have been identified to be the best performing ones, one for systems with slow interconnection networks and the other for systems with fast networks. It is also found that allocating too many nodes to a query which does not need them results in a substantial loss of potential speedup in the processing of the query.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121623022","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139328
Ming-Jie Chen, C. Chung
A process modeling language (PML) has been developed which aids the analyst in modeling the processes of large process control systems. Because PML is based on a conceptual framework close to the customer's view of controlled processes, a PML model is an effective communication medium between the analyst and the customer. PML allows a process to be decomposed into activities and a composite activity to be decomposed into more primitive activities. The structuring facility for these decompositions is the same. PML represents activity sequences by scenarios and uses conditions to control their start and end. The modeling of various operation sequences, interprocess sequence control, and operators' interactions is made easy. The condition facility also facilitates the specification of various timing constraints. Therefore, PML is a valuable aid for the requirements analysis of large process control systems.<>
{"title":"A process modeling language for large process control systems","authors":"Ming-Jie Chen, C. Chung","doi":"10.1109/CMPSAC.1990.139328","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139328","url":null,"abstract":"A process modeling language (PML) has been developed which aids the analyst in modeling the processes of large process control systems. Because PML is based on a conceptual framework close to the customer's view of controlled processes, a PML model is an effective communication medium between the analyst and the customer. PML allows a process to be decomposed into activities and a composite activity to be decomposed into more primitive activities. The structuring facility for these decompositions is the same. PML represents activity sequences by scenarios and uses conditions to control their start and end. The modeling of various operation sequences, interprocess sequence control, and operators' interactions is made easy. The condition facility also facilitates the specification of various timing constraints. Therefore, PML is a valuable aid for the requirements analysis of large process control systems.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115340592","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139396
T. Khoshgoftaar, J. Munson
The relationship between measures of software complexity and programming errors is explored. Four distinct regression models were developed for an experimental set of data to create a predictive model from software complexity metrics to program errors. The lines of code metric, traditionally associated with programming errors in predictive models, was found to be less valuable as a criterion measure in these models than measures of software control complexity. A factor analytic technique used to construct a linear compound of lines of code with control metrics was found to yield models of superior predictive quality.<>
{"title":"The lines of code metric as a predictor of program faults: a critical analysis","authors":"T. Khoshgoftaar, J. Munson","doi":"10.1109/CMPSAC.1990.139396","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139396","url":null,"abstract":"The relationship between measures of software complexity and programming errors is explored. Four distinct regression models were developed for an experimental set of data to create a predictive model from software complexity metrics to program errors. The lines of code metric, traditionally associated with programming errors in predictive models, was found to be less valuable as a criterion measure in these models than measures of software control complexity. A factor analytic technique used to construct a linear compound of lines of code with control metrics was found to yield models of superior predictive quality.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124837025","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 : 1990-10-31DOI: 10.1109/CMPSAC.1990.139370
Ye-In Chang, M. Singhal, Ming T. Liu
A hybrid approach to mutual exclusion is proposed to minimize both message traffic and time delay at the same time. A hybrid mutual exclusion algorithm using the release local sites first mode, the requesting group semantics, and the requesting sequence 1324 (i.e., local competition followed by global competition) is found to be an efficient way to control the interaction. This hybrid algorithm uses M. Singhal's (1989) algorithm as the local algorithm and M. Maekawa's (1985) algorithm as the global algorithm. Compared to Maekawa's algorithm, which needs 3 square root N. . .5 square root N messages but two time units delay between successive executions of the critical section (where N is the number of sites in the system), the proposed hybrid algorithm can reduce message traffic by 55% and time delay by 32% at the same time. Furthermore, when a distributed system exhibits locality of requests, the proposed hybrid algorithm can achieve even better performance.<>
{"title":"A hybrid approach to mutual exclusion for distributed systems","authors":"Ye-In Chang, M. Singhal, Ming T. Liu","doi":"10.1109/CMPSAC.1990.139370","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139370","url":null,"abstract":"A hybrid approach to mutual exclusion is proposed to minimize both message traffic and time delay at the same time. A hybrid mutual exclusion algorithm using the release local sites first mode, the requesting group semantics, and the requesting sequence 1324 (i.e., local competition followed by global competition) is found to be an efficient way to control the interaction. This hybrid algorithm uses M. Singhal's (1989) algorithm as the local algorithm and M. Maekawa's (1985) algorithm as the global algorithm. Compared to Maekawa's algorithm, which needs 3 square root N. . .5 square root N messages but two time units delay between successive executions of the critical section (where N is the number of sites in the system), the proposed hybrid algorithm can reduce message traffic by 55% and time delay by 32% at the same time. Furthermore, when a distributed system exhibits locality of requests, the proposed hybrid algorithm can achieve even better performance.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130036404","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
扫码关注我们
求助内容：
应助结果提醒方式：