Pub Date : 1998-12-02DOI: 10.1109/APSEC.1998.733725
Jungkyu Rho, Chisu Wu
Various types of diagrams are used to represent the design of software systems. During the design phase, versions of a diagram may be created like other design documents and source code, and it is necessary to manage them efficiently. However, traditional configuration management systems and some object-oriented database management systems that provide object versioning are not suitable for managing versions of a diagram. In this paper, we propose an efficient version model of software diagrams. This model reflects the common characteristics and structure of software diagrams, and revisions of a diagram are managed by operation delta and object visibility. A merge model for versions of a diagram is also presented at the end of this paper.
{"title":"An efficient version model of software diagrams","authors":"Jungkyu Rho, Chisu Wu","doi":"10.1109/APSEC.1998.733725","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733725","url":null,"abstract":"Various types of diagrams are used to represent the design of software systems. During the design phase, versions of a diagram may be created like other design documents and source code, and it is necessary to manage them efficiently. However, traditional configuration management systems and some object-oriented database management systems that provide object versioning are not suitable for managing versions of a diagram. In this paper, we propose an efficient version model of software diagrams. This model reflects the common characteristics and structure of software diagrams, and revisions of a diagram are managed by operation delta and object visibility. A merge model for versions of a diagram is also presented at the end of this paper.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132237189","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733741
K. Jea, H. Feng, Yang-Ren Yau, Shih-Kung Chen, Jian-Cheng Dai
Data versioning is important for many applications such as CASE, CAD and CAM. New design objects in these applications are usually created from existing ones because they share a large degree of similarity. In this paper we propose a difference-based version model for object-oriented database systems. The large object stores only the difference data from its parent version. To show the feasibility of this version model, a prototype is implemented and a performance study on the version storage and access time is made. We observe from this study that, when the difference between two versions is less than 10%, the system has the best storage efficiency and incurs the least overhead in access time. Our implementation experience also shows that the proposed version model can be implemented as an independent module to plug in a data storage system easily.
{"title":"A difference-based version model for OODBMS","authors":"K. Jea, H. Feng, Yang-Ren Yau, Shih-Kung Chen, Jian-Cheng Dai","doi":"10.1109/APSEC.1998.733741","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733741","url":null,"abstract":"Data versioning is important for many applications such as CASE, CAD and CAM. New design objects in these applications are usually created from existing ones because they share a large degree of similarity. In this paper we propose a difference-based version model for object-oriented database systems. The large object stores only the difference data from its parent version. To show the feasibility of this version model, a prototype is implemented and a performance study on the version storage and access time is made. We observe from this study that, when the difference between two versions is less than 10%, the system has the best storage efficiency and incurs the least overhead in access time. Our implementation experience also shows that the proposed version model can be implemented as an independent module to plug in a data storage system easily.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114158297","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733731
A. Hamie, J. Howse, S. Kent
The Object Constraint Language (OCL), which forms part of the UML 1.1. set of modelling notations is a precise, textual language for expressing constraints that cannot be shown in the standard diagrammatic notation used in UML. A semantics for OCL lays the foundation for building CASE tools that support integrity checking of whole UML models, not just the component expressed using OCL. This paper provides a semantics for OCL, at the same time providing a semantics for classes, associations, attributes and states.
{"title":"Interpreting the object constraint language","authors":"A. Hamie, J. Howse, S. Kent","doi":"10.1109/APSEC.1998.733731","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733731","url":null,"abstract":"The Object Constraint Language (OCL), which forms part of the UML 1.1. set of modelling notations is a precise, textual language for expressing constraints that cannot be shown in the standard diagrammatic notation used in UML. A semantics for OCL lays the foundation for building CASE tools that support integrity checking of whole UML models, not just the component expressed using OCL. This paper provides a semantics for OCL, at the same time providing a semantics for classes, associations, attributes and states.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125101750","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 : 1998-12-02DOI: 10.1109/APSEC.1998.733737
B. Yoon, J. J. You, Soo Dong Kim
Searching the right information on the Internet is a time-consuming task, mainly due to the large amount of information flow on the network and the nature of HTTP protocol. Push technology has been introduced in order to increase the search efficiency by providing only the pre-selected types of information. However, current push technique employs a simple method of defining users' preferences; letting the users select the right items in the menu or type the URLs interested. As a result, the information pushed by the push-engine does not satisfy much of the users' interest, lacking the search accuracy. Moreover, the HTML pages are transmitted to the user without any factoring, abstraction or re-packaging, yielding a large amount of information flow. In this paper, we present an intelligent push-engine, COPEN, that is based on Java & CORBA. The client part of COPEN monitors and intercepts the interaction between the user and the Web server in order to intelligently formulated the interests of the user. Based on the interests formulated, the server side of COPEN searches the Web, packages the information and transmits the packaged information to the user's local database. In order to overcome the storage access restriction of Java Security Manager, we developed an Java/ORB-based interceptor that can manage the cache database on the client's computer. As the result, the user's interest is dynamically and silently monitored, maintained in user profiles, information is intelligently searched based on the user's interests, and pre-transmitted to the cache database for faster retrieval.
{"title":"COPEN: a CORBA-based intelligent push-engine","authors":"B. Yoon, J. J. You, Soo Dong Kim","doi":"10.1109/APSEC.1998.733737","DOIUrl":"https://doi.org/10.1109/APSEC.1998.733737","url":null,"abstract":"Searching the right information on the Internet is a time-consuming task, mainly due to the large amount of information flow on the network and the nature of HTTP protocol. Push technology has been introduced in order to increase the search efficiency by providing only the pre-selected types of information. However, current push technique employs a simple method of defining users' preferences; letting the users select the right items in the menu or type the URLs interested. As a result, the information pushed by the push-engine does not satisfy much of the users' interest, lacking the search accuracy. Moreover, the HTML pages are transmitted to the user without any factoring, abstraction or re-packaging, yielding a large amount of information flow. In this paper, we present an intelligent push-engine, COPEN, that is based on Java & CORBA. The client part of COPEN monitors and intercepts the interaction between the user and the Web server in order to intelligently formulated the interests of the user. Based on the interests formulated, the server side of COPEN searches the Web, packages the information and transmits the packaged information to the user's local database. In order to overcome the storage access restriction of Java Security Manager, we developed an Java/ORB-based interceptor that can manage the cache database on the client's computer. As the result, the user's interest is dynamically and silently monitored, maintained in user profiles, information is intelligently searched based on the user's interests, and pre-transmitted to the cache database for faster retrieval.","PeriodicalId":296589,"journal":{"name":"Proceedings 1998 Asia Pacific Software Engineering Conference (Cat. No.98EX240)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126439630","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
扫码关注我们
求助内容：
应助结果提醒方式：