Pub Date : 1989-09-20DOI: 10.1109/CMPSAC.1989.65093
Yunmo Chung, M. Ramakrishna
A dynamic hashing scheme that guarantees single access retrieval from the disk is proposed. This is based on the external hashing scheme proposed by G.H. Gonnet and P.A. Larson (see JACM, vol.35, no.1, p.161-84, 1988). The performance of the scheme is achieved at the cost of a small amount of internal memory which remains proportional to the file size. The necessary algorithms for address computation, insertions and file expansions are presented. Since theoretical analysis appears too difficult, the performance is studied using simulations with real-life files.<>
{"title":"Dynamic signature hashing","authors":"Yunmo Chung, M. Ramakrishna","doi":"10.1109/CMPSAC.1989.65093","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65093","url":null,"abstract":"A dynamic hashing scheme that guarantees single access retrieval from the disk is proposed. This is based on the external hashing scheme proposed by G.H. Gonnet and P.A. Larson (see JACM, vol.35, no.1, p.161-84, 1988). The performance of the scheme is achieved at the cost of a small amount of internal memory which remains proportional to the file size. The necessary algorithms for address computation, insertions and file expansions are presented. Since theoretical analysis appears too difficult, the performance is studied using simulations with real-life files.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"15 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":"125576381","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.65106
W. LaLonde, J. McGugan, D. Thomas
Object-oriented languages provide facilities for code reuse, abstraction, encapsulation, instantiation, polymorphism, and inheritance. Major differences between pure object-oriented languages like Smalltalk and hybrid languages like C++, Objective-C, and Object Pascal are discussed. It is argued that the inclusion of both pointer and nonpointer types and the lack of garbage collection in hybrid systems is a major impediment to reliability, correctness, and extensibility. Hybrid systems lack design environments that permit evolutionary code development, which is a major impediment to rapid, and therefore cost-effective, software development and to the development of reusable libraries.<>
{"title":"The real advantages of pure object-oriented systems or why object-oriented extensions to C are doomed to fail","authors":"W. LaLonde, J. McGugan, D. Thomas","doi":"10.1109/CMPSAC.1989.65106","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65106","url":null,"abstract":"Object-oriented languages provide facilities for code reuse, abstraction, encapsulation, instantiation, polymorphism, and inheritance. Major differences between pure object-oriented languages like Smalltalk and hybrid languages like C++, Objective-C, and Object Pascal are discussed. It is argued that the inclusion of both pointer and nonpointer types and the lack of garbage collection in hybrid systems is a major impediment to reliability, correctness, and extensibility. Hybrid systems lack design environments that permit evolutionary code development, which is a major impediment to rapid, and therefore cost-effective, software development and to the development of reusable libraries.<<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":"130143179","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.65123
B. Bryant, Aiqin Pan
Prolog is proposed as an implementable specification language for programming language semantics. It is shown that both static semantics, specified by either attribute grammar or denotational semantics, and dynamic semantics, specified by either denotational semantics or axiomatic semantics, can be conveniently expressed in Prolog with the following advantages: (1) because the notations used in formal semantics are based upon logic, it is straightforward to translate these into Prolog, thus making the conformity of the Prolog specifications with the original specifications more reliable; (2) specifications expressed in Prolog are executable and can therefore be considered as prototype implementations of the semantics; and (3) Prolog exhibits the maximum amount of parallelism in the specifications, indicating where production quality systems might be implemented in parallel for improved performance. Prolog allows for a complete programming language specification which integrates all aspects of programming language semantics into a single unified framework.<>
{"title":"Rapid prototyping of programming language semantics using Prolog","authors":"B. Bryant, Aiqin Pan","doi":"10.1109/CMPSAC.1989.65123","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65123","url":null,"abstract":"Prolog is proposed as an implementable specification language for programming language semantics. It is shown that both static semantics, specified by either attribute grammar or denotational semantics, and dynamic semantics, specified by either denotational semantics or axiomatic semantics, can be conveniently expressed in Prolog with the following advantages: (1) because the notations used in formal semantics are based upon logic, it is straightforward to translate these into Prolog, thus making the conformity of the Prolog specifications with the original specifications more reliable; (2) specifications expressed in Prolog are executable and can therefore be considered as prototype implementations of the semantics; and (3) Prolog exhibits the maximum amount of parallelism in the specifications, indicating where production quality systems might be implemented in parallel for improved performance. Prolog allows for a complete programming language specification which integrates all aspects of programming language semantics into a single unified framework.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"17 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":"122430302","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.65113
C. Papaconstantinou, K. Doty, S. Navathe
An application of the object-oriented semantic association model (OSAM) concepts to the modeling of parts and their relationships, including assembly operations, is presented. It is shown that the semantic primitives (facilities) of OSAM make it possible to model the necessary structural relationships and constraints adequately. The proposed scheme can be used for simulation and task planning in the workcell environment.<>
{"title":"Modeling parts and discrete assembly operations, using an object-oriented data model","authors":"C. Papaconstantinou, K. Doty, S. Navathe","doi":"10.1109/CMPSAC.1989.65113","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65113","url":null,"abstract":"An application of the object-oriented semantic association model (OSAM) concepts to the modeling of parts and their relationships, including assembly operations, is presented. It is shown that the semantic primitives (facilities) of OSAM make it possible to model the necessary structural relationships and constraints adequately. The proposed scheme can be used for simulation and task planning in the workcell environment.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"197 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":"121300588","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.65165
G. Baraghimian
A three-phase algorithm is presented for labeling the connected components of a binary image. The importance of the algorithm is that a connectionist parallel implementation will be proportional only to the number of points in the image, and only two parameters need to be tuned, one directly controlling the number of iterations and one to determine the desired number of connected components. The approach taken is to consider the object points in the image as cities in the traveling salesman problem and then use the optimization power of self-organizing feature maps to find a near-optimum path. It is found that this path can be partitioned into a number of subpaths, each representing a connected component. Theoretical work is needed to support these experimental findings.<>
{"title":"Connected component labeling using self-organizing feature maps","authors":"G. Baraghimian","doi":"10.1109/CMPSAC.1989.65165","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65165","url":null,"abstract":"A three-phase algorithm is presented for labeling the connected components of a binary image. The importance of the algorithm is that a connectionist parallel implementation will be proportional only to the number of points in the image, and only two parameters need to be tuned, one directly controlling the number of iterations and one to determine the desired number of connected components. The approach taken is to consider the object points in the image as cities in the traveling salesman problem and then use the optimization power of self-organizing feature maps to find a near-optimum path. It is found that this path can be partitioned into a number of subpaths, each representing a connected component. Theoretical work is needed to support these experimental findings.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"79 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":"127452945","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.65148
Richard Holcomb, A. L. Tharp
The purpose of this study was to develop a basic model of software usability for human-computer interaction that accomplishes two primary goals: to allow software designers to make quantitative decisions about which usability attributes should be included in a design, and to provide a usability metric by which software designs can be consistently rated and compared. The model of software usability presented amalgamates the results from much of the research on usability and organizes it into seven basic usability principles, their underlying attributes, and associated relative weights.<>
{"title":"An amalgamated model of software usability","authors":"Richard Holcomb, A. L. Tharp","doi":"10.1109/CMPSAC.1989.65148","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65148","url":null,"abstract":"The purpose of this study was to develop a basic model of software usability for human-computer interaction that accomplishes two primary goals: to allow software designers to make quantitative decisions about which usability attributes should be included in a design, and to provide a usability metric by which software designs can be consistently rated and compared. The model of software usability presented amalgamates the results from much of the research on usability and organizes it into seven basic usability principles, their underlying attributes, and associated relative weights.<<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":"130803348","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.65184
Judith A. Markowitz
The worker's compensation reserve expert system advisor helps worker's compensation analysts to make timely and accurate estimates about compensation claims. A description is presented of the system, focusing on several issues which are typical of those facing developers working in commercial settings: access to expertise, computer phobia of end-users, and maintenance. The advisor performs three principal operations: creation of a reserve estimate, revision of existing estimates, and update of state statue files.<>
{"title":"Next Steps: Navistar's compensation reserve expert system advisor","authors":"Judith A. Markowitz","doi":"10.1109/CMPSAC.1989.65184","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65184","url":null,"abstract":"The worker's compensation reserve expert system advisor helps worker's compensation analysts to make timely and accurate estimates about compensation claims. A description is presented of the system, focusing on several issues which are typical of those facing developers working in commercial settings: access to expertise, computer phobia of end-users, and maintenance. The advisor performs three principal operations: creation of a reserve estimate, revision of existing estimates, and update of state statue files.<<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":"116850260","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.65170
Qiming Chen
The theoretical foundations of a strongly typed high-order rule language, HILOG, are developed by introducing appropriate mathematical concepts to reformulate the logic programming (LP) notions. This work is significant for enhancing the LP capability to support object orientation, ADT, and knowledge representation with type hierarchies and for applying LP and deductive database techniques to practical applications involving complex objects.<>
{"title":"A high-order logic programming framework for complex objects reasoning","authors":"Qiming Chen","doi":"10.1109/CMPSAC.1989.65170","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65170","url":null,"abstract":"The theoretical foundations of a strongly typed high-order rule language, HILOG, are developed by introducing appropriate mathematical concepts to reformulate the logic programming (LP) notions. This work is significant for enhancing the LP capability to support object orientation, ADT, and knowledge representation with type hierarchies and for applying LP and deductive database techniques to practical applications involving complex objects.<<ETX>>","PeriodicalId":339677,"journal":{"name":"[1989] Proceedings of the Thirteenth Annual International Computer Software & Applications Conference","volume":"32 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":"121389718","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.65049
Chih-Hao Huang, Ting-Lu Huang, J. Juang
The processor allocation problem in a hypercube system is to find a free subcube for a given request. The subcube recognition capability of existing allocation strategies, e.g. the buddy strategy and the Gray code strategy, is far below the theoretical upper bound due to their incomplete representation of the hypercube interconnection structure. A complete strategy that outperforms the existing ones in subcube recognition capability and average waiting time but incurs a higher overhead is proposed. Efficient implementation of the complete strategy is also studied.<>
{"title":"On processor allocation in hypercube multiprocessors","authors":"Chih-Hao Huang, Ting-Lu Huang, J. Juang","doi":"10.1109/CMPSAC.1989.65049","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65049","url":null,"abstract":"The processor allocation problem in a hypercube system is to find a free subcube for a given request. The subcube recognition capability of existing allocation strategies, e.g. the buddy strategy and the Gray code strategy, is far below the theoretical upper bound due to their incomplete representation of the hypercube interconnection structure. A complete strategy that outperforms the existing ones in subcube recognition capability and average waiting time but incurs a higher overhead is proposed. Efficient implementation of the complete strategy is also studied.<<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":"115938048","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.65059
B. Qin, R. Ammar
A model is presented for estimating the average response time of parallel programs. It is assumed that the underlying system has a number of processors and all the processors have the same speed. The system is represented as a state transition diagram in which each state represents the number of processes in the system. A state transition can occur in every Delta t time units. If the system has U processors and i processes, each process will receive Delta t*min (1,U/i) processor time before the number of processes in the system changes. A process is terminated when it receives the required processor time. A program leaves the system when all the corresponding processes are terminated. Methods based on the model are developed to estimate the average response time. Several examples are given to demonstrate these methods.<>
{"title":"A model to estimate average response time of parallel programs","authors":"B. Qin, R. Ammar","doi":"10.1109/CMPSAC.1989.65059","DOIUrl":"https://doi.org/10.1109/CMPSAC.1989.65059","url":null,"abstract":"A model is presented for estimating the average response time of parallel programs. It is assumed that the underlying system has a number of processors and all the processors have the same speed. The system is represented as a state transition diagram in which each state represents the number of processes in the system. A state transition can occur in every Delta t time units. If the system has U processors and i processes, each process will receive Delta t*min (1,U/i) processor time before the number of processes in the system changes. A process is terminated when it receives the required processor time. A program leaves the system when all the corresponding processes are terminated. Methods based on the model are developed to estimate the average response time. Several examples are given to demonstrate these methods.<<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":"127565925","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
扫码关注我们
求助内容：
应助结果提醒方式：