Pub Date : 2001-10-08DOI: 10.1109/CMPSAC.2001.960616
Jie-qiang Dai, J. Alves-Foss
Using certificates for distributed authorizations in computer network systems has been discussed in the literature. However real implementations of the concept are rarely seen. In our certificate based authorization simulation system (CBASS) project, we prototyped a computer system including some of the emulated functions of an operating system such as machine, user and file management, and emulated applications. These system management functions and applications use certification instead of conventional access control list mechanism for resource access control. It is our purpose to explore a practical way to build the distributed authorization into computer systems in order to solve authorization problems which exist in present open and large distributed computing environments. In this paper, we present our design and implementation of the CBASS.
{"title":"Certificate based authorization simulation system","authors":"Jie-qiang Dai, J. Alves-Foss","doi":"10.1109/CMPSAC.2001.960616","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960616","url":null,"abstract":"Using certificates for distributed authorizations in computer network systems has been discussed in the literature. However real implementations of the concept are rarely seen. In our certificate based authorization simulation system (CBASS) project, we prototyped a computer system including some of the emulated functions of an operating system such as machine, user and file management, and emulated applications. These system management functions and applications use certification instead of conventional access control list mechanism for resource access control. It is our purpose to explore a practical way to build the distributed authorization into computer systems in order to solve authorization problems which exist in present open and large distributed computing environments. In this paper, we present our design and implementation of the CBASS.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116962358","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960646
D. Turgut, Nevin Aydin, R. Elmasri, B. Turgut
Virtual Reality Modeling Language (VRML) is widely used to represent, create, and display virtual reality objects and their environment. Some VRML applications require concurrent interaction by multiple users in a real-time distributed fashion. Such applications need a method for users to share and update the VRML objects in real-time. To allow concurrent shared real-time access, our approach is to store the VRML objects in an object-oriented database system (ObjectStore) in order to utilize the concurrency control mechanisms of the system. The authors present an architecture that allows multiple users to interact in a non-trivial way in such a shared VRML environment. We outline how the VRML world can be saved in ObjectStore and implement a series of test cases demonstrating concurrency issues arising from simultaneous updates. Our architecture uses ordinary Java enabled Web browsers with a VRML plug-in. A commercial Web server routes client requests to a custom application server which interacts with the object-oriented database. As users change the VRML world, our application server orders the requests and updates the master copy in the database.
{"title":"Utilizing object-oriented databases for concurrency control in virtual environments","authors":"D. Turgut, Nevin Aydin, R. Elmasri, B. Turgut","doi":"10.1109/CMPSAC.2001.960646","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960646","url":null,"abstract":"Virtual Reality Modeling Language (VRML) is widely used to represent, create, and display virtual reality objects and their environment. Some VRML applications require concurrent interaction by multiple users in a real-time distributed fashion. Such applications need a method for users to share and update the VRML objects in real-time. To allow concurrent shared real-time access, our approach is to store the VRML objects in an object-oriented database system (ObjectStore) in order to utilize the concurrency control mechanisms of the system. The authors present an architecture that allows multiple users to interact in a non-trivial way in such a shared VRML environment. We outline how the VRML world can be saved in ObjectStore and implement a series of test cases demonstrating concurrency issues arising from simultaneous updates. Our architecture uses ordinary Java enabled Web browsers with a VRML plug-in. A commercial Web server routes client requests to a custom application server which interacts with the object-oriented database. As users change the VRML world, our application server orders the requests and updates the master copy in the database.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115677850","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960601
J. Rilling, A. Seffah
Many tools have been developed to derive abstract representations from existing source code. Yet, most of these tools provide only little help in providing an encompassing picture of the system under examination. Graphical visualization techniques derived from reverse engineered source code have long been recognized for their impact on improving the comprehensibility of software systems and their source code. In this paper, we present a task-oriented approach to software comprehension by introducing our MOOSE (Montreal Object-Oriented Slicing Environment) environment that provides a task-driven wizard approach that supports a cognitive comprehension model combined with reverse engineering techniques, algorithmic and visualization support. We close our discussion with a brief overview of typical software comprehension tasks and how the MOOSE environment will benefit users during these comprehension tasks.
{"title":"MOOSE - a task-driven program comprehension environment","authors":"J. Rilling, A. Seffah","doi":"10.1109/CMPSAC.2001.960601","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960601","url":null,"abstract":"Many tools have been developed to derive abstract representations from existing source code. Yet, most of these tools provide only little help in providing an encompassing picture of the system under examination. Graphical visualization techniques derived from reverse engineered source code have long been recognized for their impact on improving the comprehensibility of software systems and their source code. In this paper, we present a task-oriented approach to software comprehension by introducing our MOOSE (Montreal Object-Oriented Slicing Environment) environment that provides a task-driven wizard approach that supports a cognitive comprehension model combined with reverse engineering techniques, algorithmic and visualization support. We close our discussion with a brief overview of typical software comprehension tasks and how the MOOSE environment will benefit users during these comprehension tasks.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122149615","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960604
T. Walton
A historical project is used as a reference model for the verification planning process. The planning equations and an example are presented. The example objective set is to increase the level of defect removal from the final software from the historical level of 35% to about 88% of the defects introduced into the code and to reduce the overall number of delivered defects/KLOC by 85%. The example illustrates the methods used to estimate the phase-by-phase effort required to achieve the specified goal. The use of the planning model and the resulting data in day-to-day activities is also discussed.
{"title":"Quality planning for software development","authors":"T. Walton","doi":"10.1109/CMPSAC.2001.960604","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960604","url":null,"abstract":"A historical project is used as a reference model for the verification planning process. The planning equations and an example are presented. The example objective set is to increase the level of defect removal from the final software from the historical level of 35% to about 88% of the defects introduced into the code and to reduce the overall number of delivered defects/KLOC by 85%. The example illustrates the methods used to estimate the phase-by-phase effort required to achieve the specified goal. The use of the planning model and the resulting data in day-to-day activities is also discussed.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126929470","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960659
R. Paul, Lian Yu, W. Tsai, Xiaoying Bai
Regression testing has been a popular quality-assurance technique. Most regression testing techniques are based on code or software design. This paper proposes a scenario-based functional regression testing, which is based on end-to-end (E2E) integration test scenarios. The test scenarios are first represented in a template model that embodies both test dependency and traceability. By using test dependency information, one can obtain a test slicing algorithm to detect the scenarios that are affected and thus they are candidates for regression testing. By using traceability information, one can find affected components and their associated test scenarios and test cases for regression testing. With the same dependency and traceability information one can use the ripple effect analysis to identify all affected, including directly or indirectly, scenarios and thus the set of test cases can be selected for regression testing. This paper also provides several alternative test-case selection approaches and a hybrid approach to meet various requirements. A web-based tool has been developed to support these regression testing tasks.
{"title":"Scenario-based functional regression testing","authors":"R. Paul, Lian Yu, W. Tsai, Xiaoying Bai","doi":"10.1109/CMPSAC.2001.960659","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960659","url":null,"abstract":"Regression testing has been a popular quality-assurance technique. Most regression testing techniques are based on code or software design. This paper proposes a scenario-based functional regression testing, which is based on end-to-end (E2E) integration test scenarios. The test scenarios are first represented in a template model that embodies both test dependency and traceability. By using test dependency information, one can obtain a test slicing algorithm to detect the scenarios that are affected and thus they are candidates for regression testing. By using traceability information, one can find affected components and their associated test scenarios and test cases for regression testing. With the same dependency and traceability information one can use the ripple effect analysis to identify all affected, including directly or indirectly, scenarios and thus the set of test cases can be selected for regression testing. This paper also provides several alternative test-case selection approaches and a hybrid approach to meet various requirements. A web-based tool has been developed to support these regression testing tasks.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121438617","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960610
U. Hannemann, J. Hooman
We present a formal approach to the top-down design of real-time components that communicate using a shared data space. The approach is compositional, that is, only the formal specifications of the components are used to reason about their combined behaviour Formal reasoning is supported by the interactive theorem prover PVS. Our shared data space model is based on the so are architecture SPLICE, that allows loosely-coupled components. Our formalism is illustrated by the top-down design of a smallflight-tracking-and-display system, which contains an event-driven and a time-driven component. Formal correctness is established, given suitable assumptions about the environment of the system and relations between timing parameters.
{"title":"Formal design of real-time components on a shared data space architecture","authors":"U. Hannemann, J. Hooman","doi":"10.1109/CMPSAC.2001.960610","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960610","url":null,"abstract":"We present a formal approach to the top-down design of real-time components that communicate using a shared data space. The approach is compositional, that is, only the formal specifications of the components are used to reason about their combined behaviour Formal reasoning is supported by the interactive theorem prover PVS. Our shared data space model is based on the so are architecture SPLICE, that allows loosely-coupled components. Our formalism is illustrated by the top-down design of a smallflight-tracking-and-display system, which contains an event-driven and a time-driven component. Formal correctness is established, given suitable assumptions about the environment of the system and relations between timing parameters.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131172956","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960629
Zeng-Wei Hong, Jim-Min Lin, De-Sheng Chen, H. C. Jiau
We propose a distributed software integration architectural style (DSIAS) to provide a blueprint and reference document that would be useful to software system designers when integrating commercial off-the-shelf (COTS) products under distributed and Internet environment. DSIAS provides a framework indicating the structure topology to put lots of originally unrelated COTS products together into a COTS based system. We then successfully applied DSIAS to the design of an example, a distributed graphical parking lot management system.
{"title":"DSIAS: a software architectural style for distributed software integration systems","authors":"Zeng-Wei Hong, Jim-Min Lin, De-Sheng Chen, H. C. Jiau","doi":"10.1109/CMPSAC.2001.960629","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960629","url":null,"abstract":"We propose a distributed software integration architectural style (DSIAS) to provide a blueprint and reference document that would be useful to software system designers when integrating commercial off-the-shelf (COTS) products under distributed and Internet environment. DSIAS provides a framework indicating the structure topology to put lots of originally unrelated COTS products together into a COTS based system. We then successfully applied DSIAS to the design of an example, a distributed graphical parking lot management system.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132736840","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960675
I. Chiang, T. Lin
Index Miner is a Java-based data mining tool which contains the methodologies of classification, clustering, association rules, visualization, attribute transformation and feature selection. The paper briefly introduces this tool and discusses the methods that are implemented in this tool to show how to create and perform a learning process for data in order to mine the patterns that are hidden in the data.
Index Miner是一个基于java的数据挖掘工具，它包含了分类、聚类、关联规则、可视化、属性转换和特征选择等方法。本文简要介绍了该工具，并讨论了在该工具中实现的方法，以展示如何为数据创建和执行学习过程，以挖掘隐藏在数据中的模式。
{"title":"Index Miner","authors":"I. Chiang, T. Lin","doi":"10.1109/CMPSAC.2001.960675","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960675","url":null,"abstract":"Index Miner is a Java-based data mining tool which contains the methodologies of classification, clustering, association rules, visualization, attribute transformation and feature selection. The paper briefly introduces this tool and discusses the methods that are implemented in this tool to show how to create and perform a learning process for data in order to mine the patterns that are hidden in the data.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702913","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960641
D. Mennie, B. Pagurek
The creation of composite services from service components at runtime can be achieved using several different techniques. In the first approach, a new common interface is constructed at runtime which allows the functionality of two or more components to be accessed from a single entity while the service components themselves remain distinct and potentially distributed within in a network. In the second approach, a new composite service is formed where all of the functionality of the service components is housed within a single new service. In the third approach, a new composite service is formed where all the functionality of the service components is extracted and re-assembled into the body of a single new service. The paper describes the design of an infrastructure to support the runtime creation of composite services. An application to create user-defined security associations dynamically and deploy them between any two points in the Internet is presented to exemplify the need for dynamic service composition techniques. Some other potential applications in e-commerce and software provisioning are also discussed.
{"title":"A runtime composite service creation and deployment infrastructure and its applications in Internet security, e-commerce, and software provisioning","authors":"D. Mennie, B. Pagurek","doi":"10.1109/CMPSAC.2001.960641","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960641","url":null,"abstract":"The creation of composite services from service components at runtime can be achieved using several different techniques. In the first approach, a new common interface is constructed at runtime which allows the functionality of two or more components to be accessed from a single entity while the service components themselves remain distinct and potentially distributed within in a network. In the second approach, a new composite service is formed where all of the functionality of the service components is housed within a single new service. In the third approach, a new composite service is formed where all the functionality of the service components is extracted and re-assembled into the body of a single new service. The paper describes the design of an infrastructure to support the runtime creation of composite services. An application to create user-defined security associations dynamically and deploy them between any two points in the Internet is presented to exemplify the need for dynamic service composition techniques. Some other potential applications in e-commerce and software provisioning are also discussed.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128227197","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 : 2001-10-08DOI: 10.1109/CMPSAC.2001.960660
Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen
In this paper we devise an efficient algorithm for clustering market-basket data items. In view of the nature of clustering market basket data, we devise in this paper a novel measurement, called the small-large (abbreviated as SL) ratio, and utilize this ratio to perform the clustering. With this SL ratio measurement, we develop an efficient clustering algorithm for data items to minimize the SL ratio in each group. The proposed algorithm not only incurs an execution time that is significantly smaller than that by prior work but also leads to the clustering results of very good quality.
{"title":"An efficient clustering algorithm for market basket data based on small large ratios","authors":"Ching-Huang Yun, Kun-Ta Chuang, Ming-Syan Chen","doi":"10.1109/CMPSAC.2001.960660","DOIUrl":"https://doi.org/10.1109/CMPSAC.2001.960660","url":null,"abstract":"In this paper we devise an efficient algorithm for clustering market-basket data items. In view of the nature of clustering market basket data, we devise in this paper a novel measurement, called the small-large (abbreviated as SL) ratio, and utilize this ratio to perform the clustering. With this SL ratio measurement, we develop an efficient clustering algorithm for data items to minimize the SL ratio in each group. The proposed algorithm not only incurs an execution time that is significantly smaller than that by prior work but also leads to the clustering results of very good quality.","PeriodicalId":269568,"journal":{"name":"25th Annual International Computer Software and Applications Conference. COMPSAC 2001","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124966584","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
扫码关注我们
求助内容：
应助结果提醒方式：