In this paper, we present the specification and implementation of a multimedia presentation database, which supports the reuse of many kinds of multimedia objects. A formal specification of the presentation database is introduced. The implementation of database and complexities are addressed. The main strength of our system is in a reuse mechanism, which allows the inheritance of multimedia properties and the instantiation of new multimedia objects, as well as large binary data sharing. The proposed system is implemented on the Microsoft Windows 95.
本文提出了一个支持多种多媒体对象复用的多媒体表示数据库的规范和实现。介绍了表示数据库的形式化规范。解决了数据库的实现和复杂性。该系统的主要优势在于复用机制，它允许多媒体属性的继承和新多媒体对象的实例化，以及大型二进制数据的共享。该系统在Microsoft Windows 95操作系统上实现。
{"title":"Specification and implementation of reusable multimedia presentations","authors":"T. Shih","doi":"10.1145/2817460.2817526","DOIUrl":"https://doi.org/10.1145/2817460.2817526","url":null,"abstract":"In this paper, we present the specification and implementation of a multimedia presentation database, which supports the reuse of many kinds of multimedia objects. A formal specification of the presentation database is introduced. The implementation of database and complexities are addressed. The main strength of our system is in a reuse mechanism, which allows the inheritance of multimedia properties and the instantiation of new multimedia objects, as well as large binary data sharing. The proposed system is implemented on the Microsoft Windows 95.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122866950","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}
We describe a unified approach to coupling that incorporates four disparate elements, namely, taxonomies for classical coupling; taxonomies for object-oriented coupling; metrics for classical coupling; and metrics for object-oriented coupling. A single instance of coupling between two modules (or classes) can incorporate several points of dependency between the two modules (or classes). It is the combination of the effects of these dependencies that gives the true measure of that instance of coupling. We identify a metric based on three types of dependencies that commonly exist between modules, namely, referential dependency, a measure of the extent to which the program relies on its declarations remaining unchanged; structural dependency, a measure of the extent to which the program relies upon its internal organization remaining unchanged; and data integrity dependency, a measure of the vulnerability of data elements in one module to change by other modules. We show how this approach can be used to describe different forms of coupling. We also compare our metric with another coupling metrics.
{"title":"Toward a unified approach to coupling","authors":"Aaron B. Binkley, S. Schach","doi":"10.1145/2817460.2817486","DOIUrl":"https://doi.org/10.1145/2817460.2817486","url":null,"abstract":"We describe a unified approach to coupling that incorporates four disparate elements, namely, taxonomies for classical coupling; taxonomies for object-oriented coupling; metrics for classical coupling; and metrics for object-oriented coupling. A single instance of coupling between two modules (or classes) can incorporate several points of dependency between the two modules (or classes). It is the combination of the effects of these dependencies that gives the true measure of that instance of coupling. We identify a metric based on three types of dependencies that commonly exist between modules, namely, referential dependency, a measure of the extent to which the program relies on its declarations remaining unchanged; structural dependency, a measure of the extent to which the program relies upon its internal organization remaining unchanged; and data integrity dependency, a measure of the vulnerability of data elements in one module to change by other modules. We show how this approach can be used to describe different forms of coupling. We also compare our metric with another coupling metrics.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116880306","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}
Users need a certain level of skill or knowledge in order to be successful in the performance of human computer interaction. Many software systems have been designed to assist in using an interface. These packages are not only expensive but restricted to specific applications, i.e., they provide help in the environment for which they were created. This paper deals with the design and development of a training tool, the Generic Rule Based Training System (GETS), which provided the proper connection with an application system, helps the user in the utilization of the interface. As input, the training system requires a User Action Notation (UAN) description of the steps to be performed in order to accomplish a given task. The descriptions are translated into rules and transferred to an expert system tool which supplies information on the user's state, including, among others, completed tasks, remaining steps to complete a task and recommendations for future steps. The system's abilities are demonstrated by its implementation on the Hopkins Ultraviolet Telescope's graphical interface.
{"title":"The generation of rules for intelligent help based on task analysis","authors":"Selma Holmquist, L. Moore","doi":"10.1145/2817460.2817467","DOIUrl":"https://doi.org/10.1145/2817460.2817467","url":null,"abstract":"Users need a certain level of skill or knowledge in order to be successful in the performance of human computer interaction. Many software systems have been designed to assist in using an interface. These packages are not only expensive but restricted to specific applications, i.e., they provide help in the environment for which they were created. This paper deals with the design and development of a training tool, the Generic Rule Based Training System (GETS), which provided the proper connection with an application system, helps the user in the utilization of the interface. As input, the training system requires a User Action Notation (UAN) description of the steps to be performed in order to accomplish a given task. The descriptions are translated into rules and transferred to an expert system tool which supplies information on the user's state, including, among others, completed tasks, remaining steps to complete a task and recommendations for future steps. The system's abilities are demonstrated by its implementation on the Hopkins Ultraviolet Telescope's graphical interface.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116665812","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}
We extend the deductive database model by incorporating the notion of time. We define the notion of temporal Horn clauses. The declarative semantics of temporal deductive databases is presented. Then, we develop a bottom-up evaluation scheme for temporal deductive rules. We establish the correctness of the bottom-up approach. Examples of queries are presented.
{"title":"A temporal deductive database model","authors":"Rajshekhar Sunderraman","doi":"10.1145/2817460.2817533","DOIUrl":"https://doi.org/10.1145/2817460.2817533","url":null,"abstract":"We extend the deductive database model by incorporating the notion of time. We define the notion of temporal Horn clauses. The declarative semantics of temporal deductive databases is presented. Then, we develop a bottom-up evaluation scheme for temporal deductive rules. We establish the correctness of the bottom-up approach. Examples of queries are presented.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132177638","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}
A simple O(n2) disk scheduling algorithm is suggested, and its performance on a real system, an Intel P6-based system running Linux 2.0.18, is compared with that of standard O(n) scheduling algorithms, with the aim of determining whether the large disparity between processor speeds and disk speeds might now allow for improved disk scheduling under heavy loads. The simple O(n2) algorithm is seen to provide some modest performance improvements over the best linear algorithms. The study also identifies several areas where potentially large additional performance improvements may be found by extending the framework suggested here.
{"title":"Disk scheduling revisited: can O(n2) algorithms compete?","authors":"R. Geist, R. Ross","doi":"10.1145/2817460.2817473","DOIUrl":"https://doi.org/10.1145/2817460.2817473","url":null,"abstract":"A simple O(n2) disk scheduling algorithm is suggested, and its performance on a real system, an Intel P6-based system running Linux 2.0.18, is compared with that of standard O(n) scheduling algorithms, with the aim of determining whether the large disparity between processor speeds and disk speeds might now allow for improved disk scheduling under heavy loads. The simple O(n2) algorithm is seen to provide some modest performance improvements over the best linear algorithms. The study also identifies several areas where potentially large additional performance improvements may be found by extending the framework suggested here.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131787482","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}
This paper reports on work to establish the relationship between various patterns of syntax errors and both the programming process and the ultimate degree of success. Students in introductory and intermediate programming courses tend to have a large number of syntax errors; some of these errors are simply typos, while others are the result of some type of misunderstanding about the fundamentals of programming or of the programming language. In this work, which is currently in progress, we have accumulated student compilation data from an intermediate programming-intensive course at The University of Alabama. We are in the process of correlating these data with both the (a) overall project grade and (b) whether or not the students followed an iterative enhancement paradigm in completing the assignment. The idea is to determine whether different patterns of errors led to a difference in overall performance, as well as whether different development paradigms led to different patterns of errors.
{"title":"Analyzing syntax error patterns among novice programmers","authors":"D. Moore, A. Parrish, D. Cordes","doi":"10.1145/2817460.2817508","DOIUrl":"https://doi.org/10.1145/2817460.2817508","url":null,"abstract":"This paper reports on work to establish the relationship between various patterns of syntax errors and both the programming process and the ultimate degree of success. Students in introductory and intermediate programming courses tend to have a large number of syntax errors; some of these errors are simply typos, while others are the result of some type of misunderstanding about the fundamentals of programming or of the programming language. In this work, which is currently in progress, we have accumulated student compilation data from an intermediate programming-intensive course at The University of Alabama. We are in the process of correlating these data with both the (a) overall project grade and (b) whether or not the students followed an iterative enhancement paradigm in completing the assignment. The idea is to determine whether different patterns of errors led to a difference in overall performance, as well as whether different development paradigms led to different patterns of errors.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133390968","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}
On-line scheduling has traditionally been restricted to single machines or work cells. In this paper, a dynamic on-line scheduling algorithm is presented to encompass several machines or work cells. The algorithm uses a dimensional database to store and query system information such as machine availabilities and other requirements. Due to the built-in capabilities of the dimensional data model for the seamless handling of dimensional data, the algorithm does not depend on a particular data type. As illustrated in this paper, this is particularly applicable to flexible manufacturing systems, where the system data may include any assortment of dimensional data. Such data may include ordinary/temporal data about resource availabilities, spatial data about machine locations and spatio-temporal data such as prior schedules.
{"title":"Dynamic scheduling of manufacturing processes using dimensional databases","authors":"T. Cheng, S. Ramaswamy","doi":"10.1145/2817460.2817516","DOIUrl":"https://doi.org/10.1145/2817460.2817516","url":null,"abstract":"On-line scheduling has traditionally been restricted to single machines or work cells. In this paper, a dynamic on-line scheduling algorithm is presented to encompass several machines or work cells. The algorithm uses a dimensional database to store and query system information such as machine availabilities and other requirements. Due to the built-in capabilities of the dimensional data model for the seamless handling of dimensional data, the algorithm does not depend on a particular data type. As illustrated in this paper, this is particularly applicable to flexible manufacturing systems, where the system data may include any assortment of dimensional data. Such data may include ordinary/temporal data about resource availabilities, spatial data about machine locations and spatio-temporal data such as prior schedules.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126639820","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
扫码关注我们
求助内容：
应助结果提醒方式：