ACM-SE 28最新文献

{"title":"Intelligent tutoring systems for teaching algebra: the handling of student misconceptions","authors":"Kimberly D. Bozeman","doi":"10.1145/98949.99135","DOIUrl":"https://doi.org/10.1145/98949.99135","url":null,"abstract":"With the coming of the computer age, many technological advances have made everyday life easier. There are auto­ mated machines to keep bowling scores and scanners check out merchandise in grocery stores. It is only natural and expected that computers would be found in the classroom. Interactive video is used for class­ room instruction. This technology is also known as Computer Aided Instruction (CAI). Roughly defined, CAI is a method by which student(s) are taught through the use of a computer. When the word \"intelligent\" is added, the idea becomes INTELLIGENT COMPUTER AIDED INSTRUCTION (ICAI). Now the classroom system can learn from and Instruct the student(s). The main focus of this paper is on analyzing faulty behavior. It has been found that \"children can even be observed to employ two different buggy procedures in solving almost identical problems within a single session.\" [2] So some type of methodology must be designed to classify faults. Many systems have approached the problem in different ways. The DIAGNOSTIC CONSULTANT [2] observes the child to determine his trouble. In the West system [1], an ISSUE RECOGNIZER and an ISSUE EVALUATOR are used to develop and maintain a model of student behavior. Each procedure will monitor the student's behavior for less than optimal solutions as well as for buggy actions. The BUGGY MODEL [4] deals primarily with arithmetic and introduces the diag-","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126152724","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}

{"title":"The first class of “think time oriented” CPU scheduling algorithms","authors":"R. A. Allen","doi":"10.1145/98949.98966","DOIUrl":"https://doi.org/10.1145/98949.98966","url":null,"abstract":"A bstract One goal of traditional CPU scheduling algori­ thms (like Round Robin) is to provide homogeneous service to all jobs in the system. Another traditional goal is to provide minimal mean system response time. While these goals are intuitively pleasing, there is little evidence to support the assumption that users ben­ efit from minimal mean system response time. The individuality of cadi user dictates the need for a cus­ tomized virtual system which reflects that user’s re­ sponse time needs. Think-Time Oriented CPU scheduling algorithms are introduced in an attempt to begin providing users with a customized virtual system. These algorithms obtain think-tiinc characteristics from users and then incorporate this knowledge in the scheduling process. Three non-preemptive think-time oriented algorithms arc described. Performance comparisons are then made between the think-time algorithms and FCFS.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127028575","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}

{"title":"Handling uncertainty and exceptions with defeasible dependencies","authors":"W. Potter, A. Wright, A. Morton, W. Kessler","doi":"10.1145/98949.99020","DOIUrl":"https://doi.org/10.1145/98949.99020","url":null,"abstract":"Recently, the merger of artificial intelligence tech­ niques with database management concepts has sparked much interest. One important area is the development of a theory for relational database design based on absolute, incomplete, and uncertain knowledge about the domain. Tire approach presented here brings a new dimension to the traditional theory of relational database design based solely on absolute knowledge. Specifically, we present the foundations of a theory of defeasible dependencies. Defeasible Dependencies are closely related to functional dependencies, but they allow exceptions as well as uncertain relationships between groups of attri­ butes to be represented. That is, functional dependencies rely on the fact that dependent relationships among the attributes of interest arc known for certain. Defeasible dependencies provide a capability for handling these rela­ tionships even when exceptions exist. In addition, defeasible dependencies can represent relationships that the designer would not specify as functional because of some degree of uncertainty regarding the relationship. This allows designers to develop database applications in a more natural and flexible manner than currently possi­ ble.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131924648","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}

{"title":"The role of literate programming in the software engineering life-cycle","authors":"Marcus Brown, D. Cordes","doi":"10.1145/98949.99007","DOIUrl":"https://doi.org/10.1145/98949.99007","url":null,"abstract":"The software life-cycle identifies a formal strategy for the systematic development of software. It pro­ vides a broad organizational platform for the genera­ tion of both small-scale and large-scale software sys­ tems. This platform defines a methodology for the specification, design, implementation, testing and maintenance of computer systems. Knuth's Literate Programming pnradigm presents a novel approach to coding software. It has proven beneficinl to the process of system implementation. This paper ex­ plores the fundamental characteristics of the literate parndigm, and looks at how they might be utilized within other stages of system development. The current (and potential) role of a literate pnradigm within the overall software life-cycle is examined. I n t r o d u c t io n As the demand for reliable, maintainable soft­ ware continues to increase, a growing concern is be­ ing placed on a developmental process that promotes comprehension and understandability. Such a tech­ nique would provide the development team with an effective tool for mnnnging the demands plnced upon them by software that is increasing in both size nnd complexity. Additionally, the method would sim­ plify maintenance of the developed product, nnd also promote code reusability. Permission lo copy without fee nil or part of this material is granted provided that the copies nre not made or distributed for direct com­ mercial advantage, the ACM copyright notice and (lie title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific per­ mission. © 1990 ACMO-8979I-356-6/90AMOO/OIOI $1.50 Knuth’s literate programming pnradigm [8] in­ troduces a technique for the coding of software that focuses on understandability. While literate pro­ gramming is normally associated with system im­ plementation, the general concerns addressed by the literate environment are not confined to the cod­ ing phase of software development. In fact, these concerns arise during all stages of softwnre devel­ opment. Issues such as underslandnbility, compre­ hension, readability, traceability nnd documentation are realized throughout the life-cycle. The literate paradigm represents a novel approach in addressing these items. To dale, the literate paradigm has remained entrenched within the implementation phase of the software life-cycle. System specification, design, test­ ing and maintenance must all rely on other develop­ ment techniques. However, the literate paradigm addresses issues of concern to these stages of de­ velopment. This paper reviews the current literate parndigm, identifies the underlying concepts central to this paradigm, nnd exnmines the impact of a fil­ trate approach on other phases of the software lifecycle. T h e C u r r e n t LH etnl.e I’n rn d igm Typical computer programs are conceived of as a set of instructions from a human programm","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134641481","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}

{"title":"Referential integrity: semantic glue for relational database","authors":"Y. S. Chua, B. Seyed-Abbassi","doi":"10.1145/98949.99022","DOIUrl":"https://doi.org/10.1145/98949.99022","url":null,"abstract":"A teaching tool for classroom presentation of referential integrity in relational database is described. Most existing database software packages can be clas­ sified as rclationally complete in their implementation of relational data structure and manipulation. However, to be fully relational, a third component, called data integrity, must also be completely supported. Data integrity is supported partially by some packages. The authors have designed and implemented a prototype teaching tool which can be used in a classroom environ­ ment to teach and demonstrate the concept of data integrity, especially, referential integrity. This teaching tool is an important supplement to reinforce the theory presented in the lectures as well as a practical means of providing a hands-on component for the students.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342273","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}

{"title":"An approach to a methodology which is easy to use and application domain independent","authors":"Seok-Joong Yoon","doi":"10.1145/98949.99155","DOIUrl":"https://doi.org/10.1145/98949.99155","url":null,"abstract":"This paper discusses the direction o f research to develop a system analysis and design methodology which is easy to use and application dom ain independent. In recent years of the inform ation systems field, several new m ethodologies for softw are analysis and design tasks have been developed. These m ethodologies can be generally classified into three categories: process-oriented, d a ta-o ri­ ented, and o b jec to rien te d. All o f these m eth­ odology types deal w ith how to decom pose a complex application dom ain in order to accom plish desirable levels of abstraction, m odularity, and inform ation hiding. The m ajor differen ce across the above categories lies in the kinds o f inform ation (i.e., process a n d /o r data) which each m ethodology tries to extract from the problem space. H ow ever, d espite o f the huge am ount o f effo rt put into the developm ent o f these m ethodologies, a question o f w hether these m ethodologies really help practitioners in system analysis and design tasks still rem ains. Most m ethodology research firs t identifies an ap plica­ tion dom ain then fits a m ethodology to c h a r­ acteristics o f the application. N evertheless, these works ignore that, fo r a m ethodology to be easily used, it should be constrained as little as possible by the characteristics o f an application dom ain. Based on this reasoning, an ideal goal is the developm ent o f a m ethodology w hich is ap plica­ ble and appropriate to any application dom ain. The overall fram ew ork for the developm ent o f an application dom ain independent m ethodology is iterative, com bining experim ents and theory-based reasoning. Each m ethodology is identified in term s o f its own strengths and weaknesses, and the strengths are m erged into a unified m ethodology. T he rationale for e x p e ri­ mental m ethod is that any currently available m ethodology should be thoroughly tested and understood. The basic experim ental procedure is: 1. Identify subjects with sim ilar experience with the knowledge of experim ental methodologies. 2. Subjects identify \"difficult parts\" of methods based on use. 3. R esearcher replaces d iffic u lt parts with analo­ gous activities …","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121102877","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}

{"title":"A data exchange paradigm for microprocessor-based groupware applications","authors":"M. Pendergast","doi":"10.1145/98949.99080","DOIUrl":"https://doi.org/10.1145/98949.99080","url":null,"abstract":"This paper describes a message-based data exchange model which was successful­ ly used to implement several groupware applications with real time data exchange requirements. The paper establishes the data communications requirements of groupware applications based on a \"what you see is what I see\" approach augmented with a requirement for private views of common data. The data exchange model and implementation details of the communica­ tion system (PLEXNET) developed to sup­ port the model are presented. Several groupware applications which were deve­ loped using the data exchange paradigm are also described. Groupware applications hold great promise for enhancing group work, but have experienced mixed success both in research and industry environments. Many of the problems are a result of poor system performance, restricted functiona­ lity, and the reliance on expensive or experimental equipment. The data exchange model and the communications system described in this paper were designed to help groupware developers overcome these problems. The viability of PLEXNET as the primary method of data exchange between groupware applications was proven by the development of several groupware tools. Furthermore, the suc­ cessful development of PLEXNET has the added benefit of demonstrating that powerful groupware tools can be imple­ mented on relatively inexpensive PC-based systems. This allows for the migration of groupware applications away from spe­ cial laboratory settings and into the office. Use of existing equipment should increase management and user acceptance of groupware applications and reduce equipment and training costs. Permission lo copy without fee all or part of litis material is granted provided that the copies are not made or distributed for direct com­ mercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice Is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific per­ mission.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117063702","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}

{"title":"Disk scheduling with future knowledge","authors":"Darrell Suggs","doi":"10.1145/98949.99156","DOIUrl":"https://doi.org/10.1145/98949.99156","url":null,"abstract":"Disk scheduling is a major concern in heavily loaded systems since disk I/O is typically a performance bot­ tleneck. There have been numerous studies of the rela­ tive performance of the traditional disk scheduling al­ gorithms, SSTF, SCAN, and FCFS, as well as several studies on the more recently developed VSCAN. We present an approach to studying disk scheduling that compares each algorithm’s performance to an optimal, perhaps unattainable, performance. We consider op­ timal to mean the order of service which yields the smallest average seek distance, and we show seek dis­ tance to be a reliable measure of performance. This approach is in the same spirit as Belady’s MIN algo­ rithm for optimal page replacement in a virtual mem­ ory system. Using a modified version of a disk sim­ ulator from a previous study, we generate fixed but realistic request streams and show how each test case can be represented as a search tree. A branch and bound tree searching algorithm is used to select the optimal path. We then compare the performance of traditional disk scheduling algorithms to that of the optimal schedule. Our results indicate that there is substantial performance gain to be achieved by devel­ oping belter disk scheduling algorithms.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130695009","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}

{"title":"AGENT: active logical objects","authors":"K. Kochut","doi":"10.1145/98949.98975","DOIUrl":"https://doi.org/10.1145/98949.98975","url":null,"abstract":"This paper introduces AGENT, a logic programming-based concurrent object-oriented language. An AGENT program is a collection of active objects (agents). Cooperation and synchronization among objects is achieved by message passing. AGENT pro­ vides a flexible way of defining classes of objects, speci­ fying their data members as well as methods. In addition to data members and methods of a traditional object, an active object (agent), has its script. A script specifies some activity performed by the active object. AGENT provides also multiple inheritance as a tool for expressing hierarchical similarities among various agent classes. An AGENT program can be easily translated to the Kernel Language (KL). KL, described in a separate paper, is a logic programming language, based on the notion of communicating sequential logic programs. KL has been designed as a tool for implementing various concurrent logic programming-based systems.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114582445","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}

{"title":"A double step algorithm for rendering parabolic curves","authors":"Euisuk Park, L. Hodges","doi":"10.1145/98949.99109","DOIUrl":"https://doi.org/10.1145/98949.99109","url":null,"abstract":"Development of fast algorithms for rendering lines and curves has continued to be an active area of computer graphics research since Bresenham First published his line drawing algorithm in the mid sixties. Although there has been some work in developing a general curve rendering algorithm, most of the activity has concerned the development of algorithms for special cases of the quadratic curve described by the equation Ax^ + 2Bxy + 2Cx + Dy^ + 2Ey + F = 0. The most efficient of these algorithms are based on the midpoint method described by Akcn in which the implicit form, f(x,y) = 0, of the equation describing the curve is segmented based on its slope and convexity into cases where the choice of pixels to approximate the curve is reduced to two possibilities'. An integer value, the decision variable, can then be used to choose the closest pixel to the curve. Recently Wu and Rokne have developed a variation of this approach that calculates two pixel positions within each iteration of the algorithm when rendering lines and circles^. In this paper we incorporate elements of their double-step algorithm with the parabolic function rendering algorithm developed by Watson and Hodges to derive a fast algorithm for rendering parabolic functions of the form y = C jx^ + C2X + C3 3. The algorithm also provides a simple form of antialiasing. To achieve performance we have compromised slightly on accuracy, since the actual position of the curve in some cases may differ by as much as one unit from the plotted pixel position. Recent work by Wu and Rokne, however, argues that in the case when the choice of a more distant pixel agrees with the convexity of the curve, the overall shape of the curve may be even belter represented than by a","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131563380","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}