Yifang Chang, Kai-Hsiung Chang, L. Murphy, Timothy W. Dollar, B. Lee, Jonathan D. Fouss
Distributed Collaborative Writing Aid (DCWA) is an environment developed for a group of designers to work together. It provides real-time communication that enables collaboration members to share ideas while working together. The emphasis of this paper is on the process of integrating and generating documents. This process involves creating, editing, and revising a document tree structure and integrating textual, graphic, and image components into a complete document. HTML is chosen as the format for the integrated documents generated by DCWA. With this capability, collaboration members can tailor the collaboration document to meet their individual needs.
{"title":"Hypertext document generator in a computer supported cooperative work environment","authors":"Yifang Chang, Kai-Hsiung Chang, L. Murphy, Timothy W. Dollar, B. Lee, Jonathan D. Fouss","doi":"10.1145/2817460.2817512","DOIUrl":"https://doi.org/10.1145/2817460.2817512","url":null,"abstract":"Distributed Collaborative Writing Aid (DCWA) is an environment developed for a group of designers to work together. It provides real-time communication that enables collaboration members to share ideas while working together. The emphasis of this paper is on the process of integrating and generating documents. This process involves creating, editing, and revising a document tree structure and integrating textual, graphic, and image components into a complete document. HTML is chosen as the format for the integrated documents generated by DCWA. With this capability, collaboration members can tailor the collaboration document to meet their individual needs.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"42 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":"127855119","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}
Today's industries, such as the intelligence industry, the medical industry, and the government, rely strongly on object-oriented database systems to protect their highly sensitive data from being infiltrated and/or corrupted by malicious users. Therefore, the need for a reliable database security paradigm has become an immediate concern. Current security methods such as the discretionary method, and the mandatory method address this concern. Although both methods provide significant progresses in database security for object-oriented databases, there still exists a gap between current security measures and a completely secure database system. Our goal in this paper is to narrow this gap by presenting a security data model that combines both the discretionary policies and the mandatory policies as well as establish its own security policies.
{"title":"A tightly secure object-oriented data model using both discretionary and mandatory security methodologies","authors":"Eric Minor, Susan V. Vrbsky","doi":"10.1145/2817460.2817515","DOIUrl":"https://doi.org/10.1145/2817460.2817515","url":null,"abstract":"Today's industries, such as the intelligence industry, the medical industry, and the government, rely strongly on object-oriented database systems to protect their highly sensitive data from being infiltrated and/or corrupted by malicious users. Therefore, the need for a reliable database security paradigm has become an immediate concern. Current security methods such as the discretionary method, and the mandatory method address this concern. Although both methods provide significant progresses in database security for object-oriented databases, there still exists a gap between current security measures and a completely secure database system. Our goal in this paper is to narrow this gap by presenting a security data model that combines both the discretionary policies and the mandatory policies as well as establish its own security policies.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"6 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":"130426390","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 present a fuzzy version of the crisp spatial logic developed by Randell et al., which takes the single relation connected-with as primitive. Membership functions are defined for each spatial relation defined in the crisp theory. Furthermore, principles are presented for defining linguistic variables whose linguistic values are spatial relations. The work reported here addresses spatial reasoning in situations where numerical or geometric precision is unlikely; it is particularly suited for dynamic situations.
{"title":"Fuzzy spatial relations","authors":"A. Esterline, G. Dozier, A. Homaifar","doi":"10.1145/2817460.2817498","DOIUrl":"https://doi.org/10.1145/2817460.2817498","url":null,"abstract":"We present a fuzzy version of the crisp spatial logic developed by Randell et al., which takes the single relation connected-with as primitive. Membership functions are defined for each spatial relation defined in the crisp theory. Furthermore, principles are presented for defining linguistic variables whose linguistic values are spatial relations. The work reported here addresses spatial reasoning in situations where numerical or geometric precision is unlikely; it is particularly suited for dynamic situations.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"46 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":"122244346","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}
In this paper, we develop a parallel algorithm on the Intel Paragon supercomputer for constructing the two-dimensional Delaunay triangulation (called 2-d DT) of a point set with N points on the plane. The time complexity of the best sequential algorithm for 2-d DT is O(N log N). Our parallel algorithm improves it to constant or O(1) time by using N processors in the Paragon. The 2-d DT has many practical applications on sciences and technologies, such as unstructured mesh generation on computational fluid dynamics, geometric modeling on computer-aided design, volume rendering on scientific visualization, and Voronoi diagram on robotics and image processing.
{"title":"Constructing Delaunay triangulation on the Intel Paragon","authors":"F. Lee","doi":"10.1145/2817460.2817476","DOIUrl":"https://doi.org/10.1145/2817460.2817476","url":null,"abstract":"In this paper, we develop a parallel algorithm on the Intel Paragon supercomputer for constructing the two-dimensional Delaunay triangulation (called 2-d DT) of a point set with N points on the plane. The time complexity of the best sequential algorithm for 2-d DT is O(N log N). Our parallel algorithm improves it to constant or O(1) time by using N processors in the Paragon. The 2-d DT has many practical applications on sciences and technologies, such as unstructured mesh generation on computational fluid dynamics, geometric modeling on computer-aided design, volume rendering on scientific visualization, and Voronoi diagram on robotics and image processing.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"155 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":"114240834","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}
Java's portability, architectural neutrality, and support of network connectivity make it ideal for implementation of applications on networks. Java applets in particular are designed to interact with Web browsers to provide a variety of services over the network. Unfortunately, Java applet security constraints restrict the user's ability to connect with and transfer data to and from remote sites and thus limit the user's ability to utilize distributed applications. In this paper we explore ways to get around this limitation. Specifically, we propose to use an intermediate server to connect the user of the applet to remote sites that they wish to access.
{"title":"Implementation of distributed applications using Java","authors":"Obaid Yousuf, Jennifer McManis","doi":"10.1145/2817460.2817519","DOIUrl":"https://doi.org/10.1145/2817460.2817519","url":null,"abstract":"Java's portability, architectural neutrality, and support of network connectivity make it ideal for implementation of applications on networks. Java applets in particular are designed to interact with Web browsers to provide a variety of services over the network. Unfortunately, Java applet security constraints restrict the user's ability to connect with and transfer data to and from remote sites and thus limit the user's ability to utilize distributed applications. In this paper we explore ways to get around this limitation. Specifically, we propose to use an intermediate server to connect the user of the applet to remote sites that they wish to access.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"50 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":"116218998","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}
Bridgette M. Wallace, Richard O. Chapman, L. Moore
We present an example of the design of an embedded digital system using hardware-software codesign methodology. The use of this methodology permits a relatively inexperienced digital designer to develop a reasonably sophisticated device consisting of a microprocessor and custom hardware in a very short time. The device under production is a telephone rate meter that keeps track of the cost of calls made from a particular telephone. Given the plethora of calling plans marketed by telecommunications providers, a great deal of flexibility is required in the manner in which the rate structure can be specified. Use of codesign methodology permits the metering of any rate structure that can be specified algorithmically.
{"title":"A programmable telephone rate meter: a hardware/software codesign case study","authors":"Bridgette M. Wallace, Richard O. Chapman, L. Moore","doi":"10.1145/2817460.2817483","DOIUrl":"https://doi.org/10.1145/2817460.2817483","url":null,"abstract":"We present an example of the design of an embedded digital system using hardware-software codesign methodology. The use of this methodology permits a relatively inexperienced digital designer to develop a reasonably sophisticated device consisting of a microprocessor and custom hardware in a very short time. The device under production is a telephone rate meter that keeps track of the cost of calls made from a particular telephone. Given the plethora of calling plans marketed by telecommunications providers, a great deal of flexibility is required in the manner in which the rate structure can be specified. Use of codesign methodology permits the metering of any rate structure that can be specified algorithmically.","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":"129646382","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 distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.
{"title":"I want it all and I want it now!: data retrieval in a distributed multimedia database system","authors":"Sasa Tomic, T. Camp","doi":"10.1145/2817460.2817525","DOIUrl":"https://doi.org/10.1145/2817460.2817525","url":null,"abstract":"A distributed algorithm for data retrieval in a distributed multimedia database system is presented. The algorithm combines the idea of a token ring algorithm with the use of parallelism to solve the 'hiccups' problem. Data objects are replicated across an array of disk stations to increase the total throughput of the system, and to prevent object requests from becoming unserviceable due to a failure of a disk station. Two replication strategies are examined: media independent partitioning and media type partitioning.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"16 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":"123998350","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 describes a correction to an existing linear transitive closure algorithm found in [1], explains how the algorithm works and provides an example of how it works. Relational database design involves the generation of relational schemes that avoid unnecessary repetition of information. At the same time the ability to accurately retrieve all data stored in the database must be preserved. A transitive closure algorithm can be used in the design process to identify the correct attributes that can be removed without jeopardizing the accuracy of data retrieval [2]. Linear run time can be achieved with the corrected algorithm described in this paper.
{"title":"Implementation of a linear transitive closure algorithm in relational database design","authors":"R. Ladner","doi":"10.1145/2817460.2817462","DOIUrl":"https://doi.org/10.1145/2817460.2817462","url":null,"abstract":"This paper describes a correction to an existing linear transitive closure algorithm found in [1], explains how the algorithm works and provides an example of how it works. Relational database design involves the generation of relational schemes that avoid unnecessary repetition of information. At the same time the ability to accurately retrieve all data stored in the database must be preserved. A transitive closure algorithm can be used in the design process to identify the correct attributes that can be removed without jeopardizing the accuracy of data retrieval [2]. Linear run time can be achieved with the corrected algorithm described in this paper.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"60 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":"123045416","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}
The Java programming language allows programs developed to access data across the Inter-Net. One of the main applications of this technology is distributed databases. In this paper we investigate the use of Java as a language for manipulating object-oriented databases and also the Remote Method Invocation (RMI) package for distributing this data. We were able to allow distributed access to a database from multiple clients on a variety of different machines.
{"title":"Distributed object-oriented database programming using Java","authors":"Oceana O. Pun","doi":"10.1145/2817460.2817480","DOIUrl":"https://doi.org/10.1145/2817460.2817480","url":null,"abstract":"The Java programming language allows programs developed to access data across the Inter-Net. One of the main applications of this technology is distributed databases. In this paper we investigate the use of Java as a language for manipulating object-oriented databases and also the Remote Method Invocation (RMI) package for distributing this data. We were able to allow distributed access to a database from multiple clients on a variety of different machines.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"9 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":"125695582","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 outlines an ongoing study investigating the maintenance of literate programs. The study examines the accuracy and performance time of subjects performing maintenance task on 4 different literate programs of varying size. The preliminary data suggest that subject performance is not directly related to program size.
{"title":"A study on the maintenance of literate programs","authors":"Randy K. Smith, Marcus Brown","doi":"10.1145/2817460.2817507","DOIUrl":"https://doi.org/10.1145/2817460.2817507","url":null,"abstract":"This paper outlines an ongoing study investigating the maintenance of literate programs. The study examines the accuracy and performance time of subjects performing maintenance task on 4 different literate programs of varying size. The preliminary data suggest that subject performance is not directly related to program size.","PeriodicalId":274966,"journal":{"name":"ACM-SE 35","volume":"10 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":"122108879","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
扫码关注我们
求助内容：
应助结果提醒方式：